The following pages link to A decade of lattice cryptography (Q2808276):
Displaying 50 items.
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures (Q1698622) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- CCA-security from adaptive all-but-one lossy trapdoor functions (Q2049981) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Rounding in the rings (Q2096527) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- An improved quantum algorithm for the quantum learning with errors problem (Q2107929) (← links)
- Secure hybrid encryption in the standard model from hard learning problems (Q2118559) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- The matrix reloaded: multiplication strategies in FrodoKEM (Q2149815) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Application of automorphic forms to lattice problems (Q2154470) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- Algebraically structured LWE. Revisited (Q2175901) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions (Q2235756) (← links)
- Pseudorandom functions in NC class from the standard LWE assumption (Q2243895) (← links)
- Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\) (Q2402971) (← links)
- Algebraic generalization of Diffie-Hellman key exchange (Q2413287) (← links)
- Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants (Q2415387) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- A survey of lattice based expressive attribute based encryption (Q2668411) (← links)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- A survey on lattice-based cryptography (Q2868269) (← links)
- Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme (Q2953874) (← links)
- A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ (Q2988333) (← links)
- Classical Homomorphic Encryption for Quantum Circuits (Q3387755) (← links)
- Some Recent Progress in Lattice-Based Cryptography (Q3611759) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Matrix Lie group as an algebraic structure for NTRU like cryptosystem (Q5034554) (← links)
- Application of algebraic-ring in key exchange protocol (Q5076475) (← links)
- Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography (Q5086199) (← links)
- (Q5091027) (← links)
- Dynamical Systems Theory and Algorithms for NP-hard Problems (Q5131680) (← links)
- Quantum Cryptography: Key Distribution and Beyond (Q5134949) (← links)
