The Geometry of Lattice Cryptography (Q3092183): Difference between revisions

@@ Property / describes a project that uses @@
+fhe
@@ Property / describes a project that uses: fhe / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SWIFFT
@@ Property / describes a project that uses: SWIFFT / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-23082-0_7
+Normal rank
@@ Property / OpenAlex ID @@
+W1489923862
@@ Property / OpenAlex ID: W1489923862 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Lattice (H)IBE in the Standard Model
@@ Property / cites work: Efficient Lattice (H)IBE in the Standard Model / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
+Normal rank
@@ Property / cites work @@
+Additively Homomorphic Encryption with d-Operand Multiplications
+Normal rank
@@ Property / cites work @@
+Q4542515
@@ Property / cites work: Q4542515 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938616
@@ Property / cites work: Q4938616 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5465355
@@ Property / cites work: Q5465355 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526993
@@ Property / cites work: Q4526993 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+New bounds in some transference theorems in the geometry of numbers
+Normal rank
@@ Property / cites work @@
+Bounded Key-Dependent Message Security
@@ Property / cites work: Bounded Key-Dependent Message Security / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
+Normal rank
@@ Property / cites work @@
+Semi-homomorphic Encryption and Multiparty Computation
+Normal rank
@@ Property / cites work @@
+On the complexity of computing short linearly independent vectors and short bases in a lattice
+Normal rank
@@ Property / cites work @@
+Homomorphic Signatures for Polynomial Functions
@@ Property / cites work: Homomorphic Signatures for Polynomial Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
+Normal rank
@@ Property / cites work @@
+Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
+Normal rank
@@ Property / cites work @@
+Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
+Normal rank
@@ Property / cites work @@
+Bonsai Trees, or How to Delegate a Lattice Basis
@@ Property / cites work: Bonsai Trees, or How to Delegate a Lattice Basis / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Zero-Knowledge Identification with Lattices
+Normal rank
@@ Property / cites work @@
+A Lattice-Based Threshold Ring Signature Scheme
@@ Property / cites work: A Lattice-Based Threshold Ring Signature Scheme / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption over the Integers with Shorter Public Keys
+Normal rank
@@ Property / cites work @@
+Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
+Normal rank
@@ Property / cites work @@
+Approximating CVP to within almost-polynomial factors is NP-hard
+Normal rank
@@ Property / cites work @@
+Fully homomorphic encryption using ideal lattices
@@ Property / cites work: Fully homomorphic encryption using ideal lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
+Normal rank
@@ Property / cites work @@
+Implementing Gentry’s Fully-Homomorphic Encryption Scheme
+Normal rank
@@ Property / cites work @@
+A Simple BGN-Type Cryptosystem from LWE
@@ Property / cites work: A Simple BGN-Type Cryptosystem from LWE / rank @@
+Normal rank
@@ Property / cites work @@
+Trapdoors for hard lattices and new cryptographic constructions
+Normal rank
@@ Property / cites work @@
+A Group Signature Scheme from Lattice Assumptions
@@ Property / cites work: A Group Signature Scheme from Lattice Assumptions / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the covering radius problem
@@ Property / cites work: The complexity of the covering radius problem / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the distribution of the distance from a lattice
+Normal rank
@@ Property / cites work @@
+Q3549646
@@ Property / cites work: Q3549646 / rank @@
+Normal rank
@@ Property / cites work @@
+Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
+Normal rank
@@ Property / cites work @@
+Multi-bit Cryptosystems Based on Lattice Problems
@@ Property / cites work: Multi-bit Cryptosystems Based on Lattice Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
+Normal rank
@@ Property / cites work @@
+Hardness of approximating the shortest vector problem in lattices
+Normal rank
@@ Property / cites work @@
+Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
+Normal rank
@@ Property / cites work @@
+Better Key Sizes (and Attacks) for LWE-Based Encryption
+Normal rank
@@ Property / cites work @@
+On Bounded Distance Decoding for General Lattices
@@ Property / cites work: On Bounded Distance Decoding for General Lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice-Based Identification Schemes Secure Under Active Attacks
+Normal rank
@@ Property / cites work @@
+Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
+Normal rank
@@ Property / cites work @@
+Generalized Compact Knapsacks Are Collision Resistant
+Normal rank
@@ Property / cites work @@
+Asymptotically Efficient Lattice-Based Digital Signatures
+Normal rank
@@ Property / cites work @@
+On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
+Normal rank
@@ Property / cites work @@
+SWIFFT: A Modest Proposal for FFT Hashing
@@ Property / cites work: SWIFFT: A Modest Proposal for FFT Hashing / rank @@
+Normal rank
@@ Property / cites work @@
+Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
+Normal rank
@@ Property / cites work @@
+On Ideal Lattices and Learning with Errors over Rings
+Normal rank
@@ Property / cites work @@
+Q4787204
@@ Property / cites work: Q4787204 / rank @@
+Normal rank
@@ Property / cites work @@
+The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
+Normal rank
@@ Property / cites work @@
+Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
+Normal rank
@@ Property / cites work @@
+Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
+Normal rank
@@ Property / cites work @@
+Cryptographic Functions from Worst-Case Complexity Assumptions
+Normal rank
@@ Property / cites work @@
+Q4829810
@@ Property / cites work: Q4829810 / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
+Normal rank
@@ Property / cites work @@
+Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
+Normal rank
@@ Property / cites work @@
+Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
+Normal rank
@@ Property / cites work @@
+Lattice-based Cryptography
@@ Property / cites work: Lattice-based Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Bi-Deniable Public-Key Encryption
@@ Property / cites work: Bi-Deniable Public-Key Encryption / rank @@
+Normal rank
@@ Property / cites work @@
+Public-key cryptosystems from the worst-case shortest vector problem
+Normal rank
@@ Property / cites work @@
+Theory of Cryptography
@@ Property / cites work: Theory of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549647
@@ Property / cites work: Q3549647 / rank @@
+Normal rank
@@ Property / cites work @@
+Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
+Normal rank
@@ Property / cites work @@
+A Framework for Efficient and Composable Oblivious Transfer
+Normal rank
@@ Property / cites work @@
+Lossy trapdoor functions and their applications
@@ Property / cites work: Lossy trapdoor functions and their applications / rank @@
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+Learning with Errors over Rings
@@ Property / cites work: Learning with Errors over Rings / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptively Secure Identity-Based Identification from Lattices without Random Oracles
+Normal rank
@@ Property / cites work @@
+Lattice-Based Blind Signatures
@@ Property / cites work: Lattice-Based Blind Signatures / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
+Normal rank
@@ Property / cites work @@
+Faster Fully Homomorphic Encryption
@@ Property / cites work: Faster Fully Homomorphic Encryption / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Public Key Encryption Based on Ideal Lattices
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption over the Integers
@@ Property / cites work: Fully Homomorphic Encryption over the Integers / rank @@
+Normal rank
@@ Property / cites work @@
+Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
+Normal rank