The Geometry of Lattice Cryptography
From MaRDI portal
Publication:3092183
DOI10.1007/978-3-642-23082-0_7zbMath1345.94081MaRDI QIDQ3092183
Publication date: 16 September 2011
Published in: Foundations of Security Analysis and Design VI (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23082-0_7
94A60: Cryptography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of the covering radius problem
- A note on the distribution of the distance from a lattice
- New bounds in some transference theorems in the geometry of numbers
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- 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
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
- On the complexity of computing short linearly independent vectors and short bases in a lattice
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- Homomorphic Signatures for Polynomial Functions
- Semi-homomorphic Encryption and Multiparty Computation
- Faster Fully Homomorphic Encryption
- A Group Signature Scheme from Lattice Assumptions
- Lattice-Based Blind Signatures
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- SWIFFT: A Modest Proposal for FFT Hashing
- Hardness of approximating the shortest vector problem in lattices
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Bounded Key-Dependent Message Security
- A Simple BGN-Type Cryptosystem from LWE
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Additively Homomorphic Encryption with d-Operand Multiplications
- A Lattice-Based Threshold Ring Signature Scheme
- Adaptively Secure Identity-Based Identification from Lattices without Random Oracles
- Generalized Compact Knapsacks Are Collision Resistant
- On Bounded Distance Decoding for General Lattices
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- A Framework for Efficient and Composable Oblivious Transfer
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Lattice-based Cryptography
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Efficient Public Key Encryption Based on Ideal Lattices
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- Learning with Errors over Rings
- Improved Zero-Knowledge Identification with Lattices
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Cryptographic Functions from Worst-Case Complexity Assumptions
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Bi-Deniable Public-Key Encryption
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Asymptotically Efficient Lattice-Based Digital Signatures
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Multi-bit Cryptosystems Based on Lattice Problems
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
