(Leveled) fully homomorphic encryption without bootstrapping
From MaRDI portal
Publication:2826066
DOI10.1145/2090236.2090262zbMath1347.68120OpenAlexW2152926062WikidataQ130851568 ScholiaQ130851568MaRDI QIDQ2826066
Zvika Brakerski, Vinod Vaikuntanathan, Craig Gentry
Publication date: 7 October 2016
Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2090236.2090262
Related Items (only showing first 100 items - show all)
Verifiable Decryption for Fully Homomorphic Encryption ⋮ Parameter optimization and larger precision for (T)FHE ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Batched fully homomorphic encryption from TFHE ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ Transciphering framework for approximate homomorphic encryption ⋮ Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE ⋮ Dilithium for memory constrained devices ⋮ Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding ⋮ Entropic hardness of Module-LWE from module-NTRU ⋮ More efficient verifiable functional encryption ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Fast blind rotation for bootstrapping FHEs ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Error correction and ciphertext quantization in lattice cryptography ⋮ A lower bound for proving hardness of learning with rounding with polynomial modulus ⋮ Private AI: Machine Learning on Encrypted Data ⋮ Toward practical privacy-preserving linear regression ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes ⋮ Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption ⋮ On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption ⋮ Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-Based GSW-FHE ⋮ On the Hardness of Scheme-Switching Between SIMD FHE Schemes ⋮ Hardness of entropic module-LWE ⋮ Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE ⋮ Spherical Gaussian leftover hash lemma via the Rényi divergence ⋮ A lattice attack on CRYSTALS-Kyber with correlation power analysis ⋮ Secure outsourced matrix multiplication with fully homomorphic encryption ⋮ Practical randomized lattice gadget decomposition with application to FHE ⋮ Improved homomorphic evaluation for hash function based on TFHE ⋮ On the multi-user security of LWE-based NIKE ⋮ Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus ⋮ G+G: a Fiat-Shamir lattice signature based on convolved Gaussians ⋮ Practical and efficient FHE-based MPC ⋮ Homomorphic encryption of the \(k = 2\) Bernstein-Vazirani algorithm ⋮ Efficient updatable public-key encryption from lattices ⋮ CCA-1 secure updatable encryption with adaptive security ⋮ Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented ⋮ On the precision loss in approximate homomorphic encryption ⋮ Towards private deep learning-based side-channel analysis using homomorphic encryption. Opportunities and limitations ⋮ Vector commitments with proofs of smallness: short range proofs and more ⋮ Ring/module learning with errors under linear leakage -- hardness and applications ⋮ Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability ⋮ Bootstrapping bits with CKKS ⋮ Time-based attribute-based proxy re-encryption with decryption key update ⋮ A systematic study of sparse LWE ⋮ Faster private decision tree evaluation for batched input from homomorphic encryption ⋮ Attribute-based keyed fully homomorphic encryption ⋮ Constraining and Watermarking PRFs from Milder Assumptions ⋮ Homomorphic Encryption Standard ⋮ An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers ⋮ Fully Homomorphic Encryption with Auxiliary Inputs ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ Depth Optimized Efficient Homomorphic Sorting ⋮ Private Computation on Encrypted Genomic Data ⋮ Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV ⋮ Privacy-preserving blueprints ⋮ On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ A Homomorphic Proxy Re-encryption from Lattices ⋮ Optimisations and tradeoffs for HElib ⋮ Post-quantum anonymity of Kyber ⋮ Oblivious message retrieval ⋮ Solving LWR via BDD Strategy: Modulus Switching Approach ⋮ Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes ⋮ Verifiable decryption in the head ⋮ Multi-key Homomorphic Proxy Re-Encryption ⋮ Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment ⋮ On error distributions in ring-based LWE ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Fully Homomorphic Encryption for Point Numbers ⋮ Deterministic compression with uncertain priors ⋮ Enhancing Data Parallelism of Fully Homomorphic Encryption ⋮ Lattice-based FHE as secure as PKE ⋮ Cryptogenography ⋮ Limits of random oracles in secure computation ⋮ Non-commutative arithmetic circuits with division ⋮ Decision trees, protocols and the entropy-influence conjecture ⋮ Locally testable codes and cayley graphs ⋮ Invitation games and the price of stability ⋮ Welfare maximization and truthfulness in mechanism design with ordinal preferences ⋮ Coordination mechanisms from (almost) all scheduling policies
Cites Work
- Unnamed Item
- The reproducible properties of correct forecasts
- The dimensions of individual strings and sequences
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- The Complexity of Forecast Testing
- The Well-Calibrated Bayesian
- Asymptotic calibration
- Dimension in Complexity Classes
- Universal prediction
- THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES
This page was built for publication: (Leveled) fully homomorphic encryption without bootstrapping
