Efficient fully homomorphic encryption from (standard) LWE
From MaRDI portal
Publication:5494940
DOI10.1137/120868669zbMATH Open1302.94037OpenAlexW1979120705WikidataQ121632039 ScholiaQ121632039MaRDI QIDQ5494940FDOQ5494940
Authors: Zvika Brakerski, Vinod Vaikuntanathan 
Publication date: 30 July 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120868669
Recommendations
- (Leveled) fully homomorphic encryption without bootstrapping
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption from approximate ideal lattices
fully homomorphic encryptionlearning with errorspublic-key encryptioncryptologyprivate information retrieval
Cited In (only showing first 100 items - show all)
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Differential privacy enhanced dynamic searchable symmetric encryption for cloud environments
- On black-box verifiable outsourcing
- Combinatorially homomorphic encryption
- Revocable cryptography from learning with errors
- $$\mathsf {HIKE}$$ : Walking the Privacy Trail
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Fully homomorphic encryption with auxiliary inputs
- Public-key encryption from homogeneous CLWE
- On the LWE cryptosystem with more general disturbance
- Towards a simpler lattice gadget toolkit
- Fast blind rotation for bootstrapping FHEs
- Mathematics of computation through the lens of linear equations and lattices
- Classical Homomorphic Encryption for Quantum Circuits
- Identity-based re-encryption scheme with lightweight re-encryption key generation
- A novel fully homomorphic encryption scheme bsed on LWE
- Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
- SoK: learning with errors, circular security, and fully homomorphic encryption
- TFHE public-key encryption revisited
- Attacking a levelled fully homomorphic encryption system with topological data analysis
- The direction of updatable encryption does matter
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE
- A systematic study of sparse LWE
- How to construct quantum FHE, generically
- Threshold secret sharing with geometric algebras
- Homomorphic encryption: a mathematical survey
- Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
- Fractional LWE: a nonlinear variant of LWE
- EvalRound algorithm in CKKS bootstrapping
- On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices
- On the hardness of module-LWE with binary secret
- Attacks on the Search RLWE Problem with Small Errors
- Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- An efficient somewhat homomorphic encryption scheme based on factorization
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- Ring packing and amortized FHEW bootstrapping
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- (Leveled) fully homomorphic encryption without bootstrapping
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Fully homomorphic encryption scheme based on public key compression and batch processing
- Packed ciphertexts in LWE-based homomorphic encryption
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- A multi-valued quantum fully homomorphic encryption scheme
- Fine-grained secure computation
- Survey of information security
- Deniable fully homomorphic encryption from learning with errors
- How to prove knowledge of small secrets
- On the security of homomorphic encryption on approximate numbers
- A simple BGN-type cryptosystem from LWE
- Lower bounds on assumptions behind indistinguishability obfuscation
- Breaking the circuit size barrier for secure computation under DDH
- Private puncturable PRFs from standard lattice assumptions
- Foundations of homomorphic secret sharing
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Balanced non-adjacent forms
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption
- Lattice-based FHE as secure as PKE
- Differentially private naive Bayes learning over multiple data sources
- Homomorphic lower digits removal and improved FHE bootstrapping
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Towards classical hardness of module-LWE: the linear rank case
- Reduced memory meet-in-the-middle attack against the NTRU private key
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Classical homomorphic encryption for quantum circuits
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- Low-complexity cryptographic hash functions
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Cryptographic algorithms for privacy-preserving online applications
- Practical techniques building on encryption for protecting and managing data in the cloud
- Verifiable single-server private information retrieval from LWE with binary errors
- Homomorphic encryption
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- Compressible FHE with applications to PIR
- Fully homomorphic NIZK and NIWI proofs
- Leakage resilient fully homomorphic encryption
- LWE-based FHE with better parameters
- Structure versus hardness through the obfuscation lens
- Weak Zero-Knowledge beyond the Black-Box Barrier
- On the plausibility of fully homomorphic encryption for RAMs
- Fully homomorphic encryption using ideal lattices
- (Leveled) fully homomorphic encryption without bootstrapping
- Computational fuzzy extractor from LWE
- Sample-size-reduction of quantum states for the noisy linear problem
- Security considerations for Galois non-dual RLWE families
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Cryptanalysis of chosen symmetric homomorphic schemes
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- A survey on single server private information retrieval in a coding theory perspective
This page was built for publication: Efficient fully homomorphic encryption from (standard) LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494940)
