FHE circuit privacy almost for free
From MaRDI portal
Publication:2829211
DOI10.1007/978-3-662-53008-5_3zbMATH Open1391.94733OpenAlexW2498753511MaRDI QIDQ2829211FDOQ2829211
Author name not available (Why is that?), Rafael del Pino, Florian Bourse, 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 (15)
- Efficient laconic cryptography from learning with errors
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
- 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
- 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)
