FHE Circuit Privacy Almost for Free
From MaRDI portal
Publication:2829211
DOI10.1007/978-3-662-53008-5_3zbMath1391.94733OpenAlexW2498753511MaRDI QIDQ2829211
Rafael del Pino, Florian Bourse, Hoeteck Wee, Michele Minelli
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01360110/file/381.pdf
branching programhomomorphic encryptionLearning with Errorsrerandomizationcircuit privacynoise flooding
Related Items (11)
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Gimme That Model!: A Trusted ML Model Trading Protocol ⋮ Asymptotically quasi-optimal cryptography ⋮ Batch-OT with optimal rate ⋮ Privacy-preserving blueprints ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Efficient laconic cryptography from learning with errors ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats
Uses Software
Cites Work
- Sanitization of FHE Ciphertexts
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Discrete Gaussian Leftover Hash Lemma over Infinite Domains
- Faster Bootstrapping with Polynomial Error
- Maliciously Circuit-Private FHE
- On CCA-Secure Somewhat Homomorphic Encryption
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Homomorphic Evaluation of the AES Circuit
- Leveled Fully Homomorphic Signatures from Standard Lattices
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Lattice-based FHE as secure as PKE
- Faster Fully Homomorphic Encryption
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- An Efficient and Parallel Gaussian Sampler for Lattices
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Advances in Cryptology - EUROCRYPT 2004
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: FHE Circuit Privacy Almost for Free
