Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
From MaRDI portal
Recommendations
- Fully homomorphic encryption using ideal lattices
- Efficient fully homomorphic encryption from (standard) LWE
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- (Leveled) fully homomorphic encryption without bootstrapping
Cited in
(only showing first 100 items - show all)- Attribute-based fully homomorphic encryption with a bounded number of inputs
- Adaptively secure distributed PRFs from LWE
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Homomorphic lower digits removal and improved FHE bootstrapping
- Bootstrapping for approximate homomorphic encryption
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- Unsupervised Machine Learning on encrypted data
- 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
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Candidate iO from homomorphic encryption schemes
- Boosting verifiable computation on encrypted data
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Post-quantum multi-party computation
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- Multiparty reusable non-interactive secure computation from LWE
- Candidate obfuscation via oblivious LWE sampling
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- An efficient CCA-secure access control encryption for any policy
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Flexible and efficient verifiable computation on encrypted data
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- Access control encryption from group encryption
- Password protected secret sharing from lattices
- A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
- Deniable fully homomorphic encryption from learning with errors
- Counterexamples to new circular security assumptions underlying iO
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- White box traitor tracing
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- 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
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Tightly secure ring-LWE based key encapsulation with short ciphertexts
- Garbled circuits with sublinear evaluator
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Single-server private information retrieval with sublinear amortized time
- From FE combiners to secure MPC and back
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Incrementally verifiable computation via incremental PCPs
- Improved filter permutators for efficient FHE: better instances and implementations
- Flattening NTRU for evaluation key free homomorphic encryption
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
- TFHE: fast fully homomorphic encryption over the torus
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Tightly secure signature schemes from the LWE and subset sum assumptions
- On the deductive security of queries to confidential databases in cloud computing systems
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Bootstrapping for helib
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- A survey of lattice based expressive attribute based encryption
- Cryptographic algorithms for privacy-preserving online applications
- Computational fuzzy extractor from LWE
- Secure MPC: laziness leads to GOD
- Adaptively secure inner product encryption from LWE
- Multi-client oblivious RAM with poly-logarithmic communication
- Efficient homomorphic comparison methods with optimal complexity
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Succinct LWE sampling, random polynomials, and obfuscation
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Towards tight adaptive security of non-interactive key exchange
- Vector and functional commitments from lattices
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Simulatable verifiable random function from the LWE assumption
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Round-Optimal Password-Based Group Key Exchange Protocols in the Standard Model
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Accelerating homomorphic computations on rational numbers
- FHE circuit privacy almost for free
- Cryptanalysis of GGH15 multilinear maps
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- How to prove knowledge of small secrets
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Breaking the circuit size barrier for secure computation under DDH
- FHEW with Efficient Multibit Bootstrapping
- Private computation on encrypted genomic data
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Towards tightly secure lattice short signature and id-based encryption
- A homomorphic proxy re-encryption from lattices
- Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Cryptanalysis of a homomorphic encryption scheme over integers
- Lattice-based FHE as secure as PKE
- Cryptogenography
- Limits of random oracles in secure computation (extended abstract)
- 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
This page was built for publication: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845661)
