A decade of lattice cryptography
From MaRDI portal
Publication:2808276
DOI10.1561/0400000074zbMATH Open1391.94788OpenAlexW4205765479MaRDI QIDQ2808276FDOQ2808276
Authors: Chris Peikert 
Publication date: 23 May 2016
Published in: Foundations and Trends in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0400000074
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
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60)
Cited In (94)
- SoK: how (not) to design and implement post-quantum cryptography
- Lattice-Based Proof of a Shuffle
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
- Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme
- An improved quantum algorithm for the quantum learning with errors problem
- A framework for cryptographic problems from linear algebra
- Lattice-based cryptography: a survey
- Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
- The geometry of lattice cryptography
- Shorter and faster identity-based signatures with tight security in the (Q)ROM from lattices
- Title not available (Why is that?)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Lattice cryptography for the internet
- Some Recent Progress in Lattice-Based Cryptography
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Subfield attacks on HSVP in ideal lattices
- The randomized slicer for CVPP: sharper, faster, smaller, batchier
- Algebraically structured LWE. Revisited
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Algebraic generalization of Diffie-Hellman key exchange
- Hardness of SIS and LWE with small parameters
- Application of algebraic-ring in key exchange protocol
- Does Fiat-Shamir require a cryptographic hash function?
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- The matrix reloaded: multiplication strategies in FrodoKEM
- Quantum hardness of learning shallow classical circuits
- Gadget-based iNTRU lattice trapdoors
- Application of automorphic forms to lattice problems
- A note on the concrete hardness of the shortest independent vector in lattices
- Classical homomorphic encryption for quantum circuits
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Secure hybrid encryption in the standard model from hard learning problems
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- A survey of lattice based expressive attribute based encryption
- A survey on lattice-based cryptography
- Verifiable single-server private information retrieval from LWE with binary errors
- 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
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- A practical post-quantum public-key cryptosystem based on spLWE
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Quantum cryptography beyond quantum key distribution
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
- Pseudorandom functions in NC class from the standard LWE assumption
- The Complexity of Public-Key Cryptography
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants
- On the hardness of the NTRU problem
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Post-quantum key exchange for the Internet and the open quantum safe project
- Lattice-based Cryptography
- Quantum cryptography: key distribution and beyond
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- Covert authentication from lattices
- Rounding in the rings
- Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- On module unique-SVP and NTRU
- Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction
- An Efficient Algorithm for Integer Lattice Reduction
- Minkowski's successive minima in convex and discrete geometry
- On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes
- Algebraically structured LWE, revisited
- Entropic hardness of Module-LWE from module-NTRU
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Interactions of computational complexity theory and mathematics
- Classical Homomorphic Encryption for Quantum Circuits
- Matrix Lie group as an algebraic structure for NTRU like cryptosystem
- PPAD is as hard as LWE and iterated squaring
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
- A Secure Algorithm for Rounded Gaussian Sampling
- 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
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- An algebraic algorithm for breaking NTRU with multiple keys
- On the quantum security of high-dimensional RSA protocol
- NTWE: A Natural Combination of NTRU and LWE
- Construction-D lattice from Garcia–Stichtenoth tower code
- Lattice problems beyond polynomial time
- Fiat-Shamir signatures based on module-NTRU
- A new R-LWE based digital signature scheme
- Modular design of KEM-based authenticated key exchange
- Tightly secure lattice identity-based signature in the quantum random oracle model
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
- A polynomial time algorithm for breaking NTRU encryption with multiple keys
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)
