A decade of lattice cryptography

Recommendations

Some Recent Progress in Lattice-Based Cryptography
Lattice-based cryptography: a survey
A survey on lattice-based cryptography
scientific article; zbMATH DE number 1186867
Lattice-based Cryptography
Lattice-Based Cryptography
scientific article; zbMATH DE number 2063208
Lattice-based cryptosystems. A design perspective
Cryptographic protocols from lattices (abstract)
Expressive Cryptography: Lattice Perspectives

Cited in

(only showing first 100 items - show all)

Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
Post-quantum key exchange for the Internet and the open quantum safe project
Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
A framework for cryptographic problems from linear algebra
CCA-security from adaptive all-but-one lossy trapdoor functions
Verifiable single-server private information retrieval from LWE with binary errors
The randomized slicer for CVPP: sharper, faster, smaller, batchier
Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
Slide reduction, revisited -- filling the gaps in SVP approximation
Rounding in the rings
Covert authentication from lattices
Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
An improved quantum algorithm for the quantum learning with errors problem
Secure hybrid encryption in the standard model from hard learning problems
Does Fiat-Shamir require a cryptographic hash function?
The matrix reloaded: multiplication strategies in FrodoKEM
Gadget-based iNTRU lattice trapdoors
Application of automorphic forms to lattice problems
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
Algebraically structured LWE. Revisited
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
Pseudorandom functions in NC class from the standard LWE assumption
Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
Algebraic generalization of Diffie-Hellman key exchange
Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants
A note on the concrete hardness of the shortest independent vector in lattices
A survey of lattice based expressive attribute based encryption
Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
Hardness of SIS and LWE with small parameters
A survey on lattice-based cryptography
Lattice cryptography for the internet
Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme
A practical post-quantum public-key cryptosystem based on spLWE
The geometry of lattice cryptography
Classical homomorphic encryption for quantum circuits
Some Recent Progress in Lattice-Based Cryptography
Lattice-based Cryptography
Quantum hardness of learning shallow classical circuits
The Complexity of Public-Key Cryptography
Matrix Lie group as an algebraic structure for NTRU like cryptosystem
Application of algebraic-ring in key exchange protocol
Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm
Dynamical Systems Theory and Algorithms for NP-hard Problems
Quantum cryptography: key distribution and beyond
Verifying quantum computations at scale: a cryptographic leash on quantum devices
Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
Fiat-Shamir signatures based on module-NTRU
A polynomial time algorithm for breaking NTRU encryption with multiple keys
Achievable \textsf{CCA2} relaxation for homomorphic encryption
Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
Subfield attacks on HSVP in ideal lattices
On module unique-SVP and NTRU
Classical Homomorphic Encryption for Quantum Circuits
An Efficient Algorithm for Integer Lattice Reduction
On the hardness of the NTRU problem
Lattice-Based Proof of a Shuffle
PPAD is as hard as LWE and iterated squaring
Entropic hardness of Module-LWE from module-NTRU
Lattice-based cryptography: a survey
Interactions of computational complexity theory and mathematics
A Secure Algorithm for Rounded Gaussian Sampling
NTWE: A Natural Combination of NTRU and LWE
Construction-D lattice from Garcia–Stichtenoth tower code
Lattice problems beyond polynomial time
Shorter and faster identity-based signatures with tight security in the (Q)ROM from lattices
Tightly secure lattice identity-based signature in the quantum random oracle model
Modular design of KEM-based authenticated key exchange
Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction
Minkowski's successive minima in convex and discrete geometry
On lattice constructions D and D^ from q-ary linear codes
Algebraically structured LWE, revisited
Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
A refined hardness estimation of LWE in two-step mode
On algebraic embedding for unstructured lattices
Evaluating the security of CRYSTALS-Dilithium in the quantum random oracle model
Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
An algebraic algorithm for breaking NTRU with multiple keys
Achievable \textsf{CCA2} relaxation for homomorphic encryption
On the quantum security of high-dimensional RSA protocol
A new R-LWE based digital signature scheme
Graph lattices constructed by super total graceful-type labelings and colorings of topological coding
Quantum automating TC^0-Frege is LWE-hard
Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
Quantum automating \(\mathrm{TC}^0\)-Frege is LWE-hard
Cryptanalysis of LWE and SIS-based cryptosystems by using quantum annealing
On the independence heuristic in the dual attack
Well-rounded lattices from odd prime degree number fields in the ramified case

This page was built for publication: A decade of lattice cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808276)