FHE circuit privacy almost for free
From MaRDI portal
Publication:2829211
DOI10.1007/978-3-662-53008-5_3zbMATH Open1391.94733OpenAlexW2498753511MaRDI QIDQ2829211FDOQ2829211
Authors: Florian Bourse, Rafael del Pino, Hoeteck Wee 
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
Recommendations
rerandomizationbranching programhomomorphic encryptionLearning with Errorscircuit privacynoise flooding
Cites Work
- Homomorphic evaluation of the AES circuit
- Bootstrapping for HElib
- Faster fully homomorphic encryption
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully homomorphic encryption over the integers
- \(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
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Classical hardness of learning with errors
- (Leveled) fully homomorphic encryption without bootstrapping
- Leveled fully homomorphic signatures from standard lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Advances in Cryptology - EUROCRYPT 2004
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- An efficient and parallel Gaussian sampler for lattices
- FHEW: bootstrapping homomorphic encryption in less than a second
- On CCA-Secure Somewhat Homomorphic Encryption
- Maliciously circuit-private FHE
- Faster Bootstrapping with Polynomial Error
- Discrete Gaussian leftover hash lemma over infinite domains
- Sanitization of FHE ciphertexts
- Lattice-based FHE as secure as PKE
Cited In (18)
- Maliciously circuit-private FHE from information-theoretic principles
- Sanitization of FHE ciphertexts
- Efficient laconic cryptography from learning with errors
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Maliciously circuit-private FHE
- Privacy-preserving blueprints
- Functional commitments for all functions, with transparent setup and from SIS
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Adaptive oblivious transfer with access control from lattice assumptions
- Asymptotically quasi-optimal cryptography
- Batch-OT with optimal rate
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Gimme That Model!: A Trusted ML Model Trading Protocol
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Practical randomized lattice gadget decomposition with application to FHE
Uses Software
This page was built for publication: FHE circuit privacy almost for free
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829211)
