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)- Integer feasibility of random polytopes: random integer programs
- Improved filter permutators for efficient FHE: better instances and implementations
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- A new framework for fast homomorphic matrix multiplication
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- New ideas to build noise-free homomorphic cryptosystems
- EvalRound algorithm in CKKS bootstrapping
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
- On the security of homomorphic encryption schemes with restricted decryption oracles
- Predicate encryption from lattices: enhanced compactness and refined functionality
- Vanishing short integer solution, revisited. Reductions, trapdoors, homomorphic signatures for low-degree polynomials
- Adaptively secure IBE from lattices with asymptotically better efficiency
- Reverse firewalls for adaptively secure MPC without setup
- Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
- Unsupervised Machine Learning on encrypted data
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
- More efficient functional bootstrapping for general functions in polynomial modulus
- Revisiting key decomposition techniques for FHE: simpler, faster and more generic
- Tree codes and a conjecture on exponential sums
- Complexity of approximating CSP with balance / hard constraints
- Multi-key Homomorphic Proxy Re-Encryption
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
- Limits of local algorithms over sparse random graphs
- 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
- mrNISC from LWE with polynomial modulus
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- Optimal single-server private information retrieval
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Public-key watermarking schemes for pseudorandom functions
- Unbounded ABE for circuits from LWE, revisited
- Strongly secure universal thresholdizer
- Post-quantum multi-party computation
- Candidate iO from homomorphic encryption schemes
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- FHE circuit privacy almost for free
- Trapdoors for ideal lattices with applications
- Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme
- Multi-key homomorphic encryption with threshold re-encryption
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- Cryptogenography
- Ring packing and amortized FHEW bootstrapping
- Mechanism design in large games: incentives and privacy (extended abstract)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Towards practical doubly-efficient private information retrieval
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- Access control encryption from group encryption
- Password protected secret sharing from lattices
- A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
- Full domain functional bootstrapping with least significant bit encoding
- Capacity of non-malleable codes
- Testers and their applications
- Fully selective opening secure IBE from LWE
- Computing primitive idempotents in finite commutative rings and applications
- Deterministic compression with uncertain priors
- CRT representation of LWE based TFHE
- Bootstrappable identity-based fully homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Black-box obfuscation for \(d\)-CNFs
- Learning mixtures of arbitrary distributions over large discrete domains
- Combinatorially homomorphic encryption
- Chainable functional commitments for unbounded-depth circuits
- Near-optimal private information retrieval with preprocessing
- A homomorphic proxy re-encryption from lattices
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Sequential decision making with vector outcomes
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- Decision trees, protocols and the entropy-influence conjecture
- Why do simple algorithms for triangle enumeration work in the real world?
- Faster private release of marginals on small databases
- Attribute-based fully homomorphic encryption with a bounded number of inputs
- Adaptively secure distributed PRFs from LWE
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- Time-release cryptography from minimal circuit assumptions
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Counterexamples to new circular security assumptions underlying iO
- Deniable fully homomorphic encryption from learning with errors
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- Revocable cryptography from learning with errors
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- Cryptanalysis of GGH15 multilinear maps
- How to prove knowledge of small secrets
- Expanders with respect to Hadamard spaces and random graphs (extended abstract)
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Multi-client oblivious RAM with poly-logarithmic communication
- Watermarking cryptographic functionalities from standard lattice assumptions
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Breaking the circuit size barrier for secure computation under DDH
- Fully homomorphic encryption with auxiliary inputs
- Multi-key FHE from LWE, revisited
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
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)
