(Leveled) Fully Homomorphic Encryption without Bootstrapping
From MaRDI portal
Publication:92720
DOI10.1145/2633600zbMath1347.68121OpenAlexW2177209050WikidataQ123151094 ScholiaQ123151094MaRDI QIDQ92720
Vinod Vaikuntanathan, Zvika Brakerski, Craig Gentry, Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan
Publication date: July 2014
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2633600
Related Items (61)
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ A trace map attack against special ring-LWE samples ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption ⋮ Provably Weak Instances of Ring-LWE ⋮ Improving the efficiency of AES protocols in multi-party computation ⋮ Faster homomorphic encryption over GPGPUs via hierarchical DGT ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ Survey of information security ⋮ On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes ⋮ Approximate homomorphic encryption with reduced approximation error ⋮ Secure multiparty computation with sublinear preprocessing ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption ⋮ Bootstrapping for helib ⋮ Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives ⋮ Algebraically structured LWE. Revisited ⋮ From FE combiners to secure MPC and back ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ BLEACH: cleaning errors in discrete computations over CKKS ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Homomorphic encryption: a mathematical survey ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ Private join and compute from PIR with default ⋮ Balanced non-adjacent forms ⋮ Revisiting homomorphic encryption schemes for finite fields ⋮ A multi-valued quantum fully homomorphic encryption scheme ⋮ A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion ⋮ The direction of updatable encryption does matter ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Coefficient grouping for complex affine layers ⋮ HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering ⋮ Accelerating HE operations from key decomposition technique ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Reductions from module lattices to free module lattices, and application to dequantizing module-LLL ⋮ HRA-secure attribute-based threshold proxy re-encryption from lattices ⋮ Maliciously secure matrix multiplication with applications to private deep learning ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption ⋮ New cryptanalysis of LowMC with algebraic techniques ⋮ Unnamed Item ⋮ Fractional LWE: A Nonlinear Variant of LWE ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression ⋮ Trusted computing with addition machines. I ⋮ HomomorphicEncryption ⋮ A framework for cryptographic problems from linear algebra ⋮ Intelligent cryptography approach for secure distributed big data storage in cloud computing ⋮ Limits on the efficiency of (ring) LWE-based non-interactive key exchange ⋮ Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys ⋮ High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function ⋮ On the security of homomorphic encryption on approximate numbers ⋮ Accelerating Homomorphic Computations on Rational Numbers ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting ⋮ Practical post-quantum password-authenticated key exchange based-on module-lattice ⋮ Homomorphic Encryption
Uses Software
Cites Work
- Probabilistic encryption
- A hierarchy of polynomial time lattice basis reduction algorithms
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Fully Homomorphic Encryption with Polylog Overhead
- Better Bootstrapping in Fully Homomorphic Encryption
- Ring Switching in BGV-Style Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Bootstrapping for HElib
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- Faster Fully Homomorphic Encryption
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Additively Homomorphic Encryption with d-Operand Multiplications
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- A sieve algorithm for the shortest lattice vector problem
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: (Leveled) Fully Homomorphic Encryption without Bootstrapping
