A toolkit for ring-LWE cryptography
From MaRDI portal
Publication:4924402
Recommendations
- On ideal lattices and learning with errors over rings
- On ideal lattices and learning with errors over rings
- Learning with errors over rings. (Abstract)
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- A note on Ring-LWE security in the case of fully homomorphic encryption
Cited in
(only showing first 100 items - show all)- LWE without modular reduction and improved side-channel attacks against BLISS
- Memory lower bounds of reductions revisited
- On the ring-LWE and polynomial-LWE problems
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- The closest vector problem in tensored root lattices of type A and in their duals
- Post-quantum key exchange for the Internet and the open quantum safe project
- Provably secure NTRUEncrypt over any cyclotomic field
- A note on Ring-LWE security in the case of fully homomorphic encryption
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- Ring-LWE: applications to cryptography and their efficient realization
- Finite interval-time transition system for real-time actors
- Discretisation and product distributions in ring-LWE
- (In)security of ring-LWE under partial key exposure
- Towards a ring analogue of the leftover hash lemma
- On the security of homomorphic encryption on approximate numbers
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- Rounding in the rings
- Efficient pseudorandom correlation generators from ring-LPN
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Implementation of lattice trapdoors on modules and applications
- A trace map attack against special ring-LWE samples
- Application of automorphic forms to lattice problems
- Non-commutative ring learning with errors from cyclic algebras
- The rank-based cryptography library
- Tightly secure ring-LWE based key encapsulation with short ciphertexts
- Asymptotically quasi-optimal cryptography
- Properties of constacyclic codes under the Schur product
- Efficient, actively secure MPC with a dishonest majority: a survey
- Efficient public-key encryption with equality test from lattices
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Worst-case to average-case reductions for module lattices
- Asymptotically efficient lattice-based digital signatures
- Bootstrapping for helib
- Post-quantum online voting scheme
- On the hardness of module learning with errors with short distributions
- Improving speed and security in updatable encryption schemes
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Bootstrapping for BGV and BFV revisited
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Adaptive security with quasi-optimal rate
- Additively homomorphic ring-LWE masking
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
- How (not) to instantiate ring-LWE
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- A practical post-quantum public-key cryptosystem based on spLWE
- Trapdoors for ideal lattices with applications
- Provably weak instances of Ring-LWE
- On ideal lattices and learning with errors over rings
- The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings
- Quantum hardness of learning shallow classical circuits
- Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
- PAKEs: new framework, new techniques and more efficient lattice-based constructions in the standard model
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Homomorphic Encryption Standard
- On the scaled inverse of \((x^i-x^j)\) modulo cyclotomic polynomial of the form \(\Phi_{p^s}(x)\) or \(\Phi_{p^s q^t}(x)\)
- On Quantum Chosen-Ciphertext Attacks and Learning with Errors
- Compact ring-LWE cryptoprocessor
- LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
- Provably secure NTRU instances over prime cyclotomic rings
- 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
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
- On homomorphic secret sharing from polynomial-modulus LWE
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- MuSig-L: lattice-based multi-signature with single-round online phase
- Verifiable decryption in the head
- Lattice signature with efficient protocols, application to anonymous credentials
- Polar coding for ring-LWE-based public key encryption
- Efficient lattice-based inner-product functional encryption
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
- Hardness of (M)LWE with semi-uniform seeds
- Hardness of entropic module-LWE
- Multi-key homomorphic secret sharing from LWE without multi-key HE
- Identity-based encryption from lattices using approximate trapdoors
- Practical lattice-based distributed signatures for a small number of signers
- Sequential half-aggregation of lattice-based signatures
- Practical randomized lattice gadget decomposition with application to FHE
- A generic construction of an anonymous reputation system and instantiations from lattices
- An iterative correction method for practically LPN solving
- On the multi-user security of LWE-based NIKE
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- On Gaussian sampling, smoothing parameter and application to signatures
- Ring/module learning with errors under linear leakage -- hardness and applications
- On algebraic embedding for unstructured lattices
- Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
- A new R-LWE based digital signature scheme
This page was built for publication: A toolkit for ring-LWE cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924402)
