Complexity of lattice problems - a cryptographic perspective

By Daniele Micciancio, Shafi Goldwasser. The Kluwer International Series in Engineering and Computer Science, 2002

661 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/26c255cc2a7eca8999079a4abcbef0cc36e7c72b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014, unknown): “We refer to [14,17] for introductions to the computational aspects of lattices.”
Worst-case to average-case reductions for module lattices (2014, methodology): “We refer to [24,39] for introductions to lattices and their computational aspects.”
Worst-case to average-case reductions based on Gaussian measures (2004, background): “For a more in-depth discussion, see [23].”
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (2011, background): “We refer to [29] for an introduction on the computational aspects of lattices, and to [31] and [47] for detailed surveys on lattice-based cryptography.”
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE (2010, background): “Micciancio and Goldwassser [MG02] showed that a full-rank set S in a lattice Λ can be converted into a basis T for Λ with an equally low Gram-Schmidt norm.”
Multi-bit Cryptosystems Based on Lattice Problems (2006, unknown): “[26] Daniele Micciancio and Shafi Goldwasser.”
On lattices, learning with errors, random linear codes, and cryptography (2009, background): “We briefly review some basic definitions; for a good introduction to lattices, see [28].”
Advances in Cryptology - CRYPTO 2003 (2003, methodology): “To mention just a few, it was used for optimal asymmetric encryption (OAEP) [5,33], for replacing interaction in the Fiat-Shamir signature scheme [13], and to justify hashing methodologies [4,35], a method for basing cryptosystems on one-way permutations [11], for analyzing the DESX construction [24”
Faster Fully Homomorphic Encryption (2010, background): “For a detailed introduction to the computational aspects of lattices, we refer to [21].”
Homomorphic Signatures for Polynomial Functions (2011, background): “We refer to S as the Gram-Schmidt norm of S. Micciancio and Goldwasser [28] showed that a full-rank set S in a lattice Λ can be converted into a basis T for Λ with an equally low Gram-Schmidt norm: Lemma 3.1 ([28, Lemma 7.1]).”