The geometry of lattice cryptography
From MaRDI portal
Recommendations
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A Group Signature Scheme from Lattice Assumptions
- A lattice-based threshold ring signature scheme
- A note on the distribution of the distance from a lattice
- A simple BGN-type cryptosystem from LWE
- Adaptively secure identity-based identification from lattices without random oracles
- Additively homomorphic encryption with \(d\)-operand multiplications
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- Approximating CVP to within almost-polynomial factors is NP-hard
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
- Asymptotically Efficient Lattice-Based Digital Signatures
- Better key sizes (and attacks) for LWE-based encryption
- Bi-deniable public-key encryption
- Bonsai trees, or how to delegate a lattice basis
- Bounded key-dependent message security
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Cryptographic functions from worst-case complexity assumptions
- Efficient lattice (H)IBE in the standard model
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster fully homomorphic encryption
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Hardness of approximating the shortest vector problem in lattices
- Homomorphic signatures for polynomial functions
- scientific article; zbMATH DE number 5485482 (Why is no real title available?)
- scientific article; zbMATH DE number 5485483 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- scientific article; zbMATH DE number 1852141 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- Implementing Gentry's fully-homomorphic encryption scheme
- Improved Zero-Knowledge Identification with Lattices
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Lattice-based blind signatures
- Lattice-based Cryptography
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Learning with errors over rings. (Abstract)
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Lossy trapdoor functions and their applications
- Multi-bit Cryptosystems Based on Lattice Problems
- New bounds in some transference theorems in the geometry of numbers
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- On Bounded Distance Decoding for General Lattices
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of computing short linearly independent vectors and short bases in a lattice
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Public-key cryptosystems from the worst-case shortest vector problem
- Semi-homomorphic encryption and multiparty computation
- Smooth projective hashing and password-based authenticated key exchange from lattices
- Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
- SWIFFT: A Modest Proposal for FFT Hashing
- The complexity of the covering radius problem
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- The shortest vector in a lattice is hard to approximate to within some constant
- Theory of Cryptography
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Toward basing fully homomorphic encryption on worst-case hardness
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Zero-knowledge protocols for NTRU: application to identification and proof of plaintext knowledge
Cited in
(11)- An application of algebraic geometry to encryption: tame transformation method
- Geometry of Banach spaces: a new route towards position based cryptography
- scientific article; zbMATH DE number 4158545 (Why is no real title available?)
- scientific article; zbMATH DE number 4048521 (Why is no real title available?)
- Some mathematical mysteries in lattices
- Cryptographic protocols from lattices (abstract)
- Computational aspects of lattices and their cryptographic applications
- Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems
- Quantum automating TC^0-Frege is LWE-hard
- Quantum automating \(\mathrm{TC}^0\)-Frege is LWE-hard
- Post-quantum PKE from unstructured noisy linear algebraic assumptions: beyond LWE and Alekhnovich's LPN
This page was built for publication: The geometry of lattice cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092183)
