Fully homomorphic encryption with chosen-ciphertext security from LWE
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Advances in Cryptology - EUROCRYPT 2004
- Boosting batch arguments and RAM delegation
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constraining pseudorandom functions privately
- Correlation intractability and SNARGs from sub-exponential DDH
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Faster Bootstrapping with Polynomial Error
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic Encryption with CCA Security
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- Incrementally verifiable computation via rate-1 batch arguments
- Indistinguishability against chosen ciphertext verification attack revisited: the complete picture
- Lattice-based FHE as secure as PKE
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Multi-identity and multi-key leveled FHE from learning with errors
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On CCA-Secure Somewhat Homomorphic Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- On the communication complexity of secure function evaluation with long output
- On the practical \(\mathrm{CPA}^D\) security of ``exact and threshold FHE schemes and libraries
- On the security of homomorphic encryption on approximate numbers
- Rate-1 non-interactive arguments for batch-NP and applications
- Recovering short generators of principal ideals in cyclotomic rings
- Security with functional re-encryption from CPA
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short non-interactive zero-knowledge proofs
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for monotone policy batch NP
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Targeted malleability: homomorphic encryption for restricted computations
- TFHE: fast fully homomorphic encryption over the torus
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- Vector commitments and their applications
- Zero-Knowledge Sets with Short Proofs
Cited in
(2)
This page was built for publication: Fully homomorphic encryption with chosen-ciphertext security from LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863927)
