1

Lova: Lattice-Based Folding Scheme from Unstructured Lattices
Folding schemes (Kothapalli et al., CRYPTO 2022) are a conceptually simple, yet powerful cryptographic primitive that can be used as a …
Giacomo Fenzi, Duc Tu Pham, Christian Knabenhans, Ngoc Khan Nguyen
Asiacrypt'24 ePrint Code (soon) Blog
VERITAS: Plaintext Encoders for Practical Verifiable Homomorphic Encryption
Providing integrity guarantees for Fully Homomorphic Encryption using Homomorphic Message Authentication Codes.
Sylvain Chatel, Christian Knabenhans, Apostolos Pyrgelis, Carmela Troncoso, Jean-Pierre Hubaux
CCS'24 arXiv Code
VERITAS: Plaintext Encoders for Practical Verifiable Homomorphic Encryption
vFHE: Verifiable Fully Homomorphic Encryption
Fully Homomorphic Encryption (FHE) is a powerful building block for secure and private applications. However, state-of-the-art FHE …
Christian Knabenhans, Alexander Viand, Antonio Merino-Gallardo, Anwar Hithnawi
WAHC'24 arXiv Code
Holding Secrets Accountable: Auditing Privacy-Preserving Machine Learning
Recent advancements in privacy-preserving machine learning are paving the way to extend the benefits of ML to highly sensitive data …
Hidde Lycklama, Alexander Viand, Nicolas Küchler, Christian Knabenhans, Anwar Hithnawi
USENIX'24 arXiv Code
Holding Secrets Accountable: Auditing Privacy-Preserving Machine Learning