FHE circuit privacy almost for free
From MaRDI portal
Publication:2829211
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Advances in Cryptology - EUROCRYPT 2004
- An efficient and parallel Gaussian sampler for lattices
- Bootstrapping for HElib
- Classical hardness of learning with errors
- Discrete Gaussian leftover hash lemma over infinite domains
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Evaluating Branching Programs on Encrypted Data
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- Lattice-based FHE as secure as PKE
- Leveled fully homomorphic signatures from standard lattices
- Maliciously circuit-private FHE
- On CCA-Secure Somewhat Homomorphic Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Sanitization of FHE ciphertexts
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
Cited in
(18)- Maliciously circuit-private FHE from information-theoretic principles
- Sanitization of FHE ciphertexts
- Efficient laconic cryptography from learning with errors
- Maliciously circuit-private FHE
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- 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
- Asymptotically quasi-optimal cryptography
- Batch-OT with optimal rate
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Adaptive oblivious transfer with access control from lattice assumptions
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- 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
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)
