Towards Practical Lattice-Based Cryptography

Towards Practical Lattice-Based Cryptography (2008)

Cached

Download Links

by Vadim Lyubashevsky

Citations:

BibTeX

@MISC{Lyubashevsky08towardspractical,
    author = {Vadim Lyubashevsky},
    title = {Towards Practical Lattice-Based Cryptography},
    year = {2008}
}

Bookmark

OpenURL

Abstract

Citations

1130	Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
756	Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer - Shor - 1997
553	Factoring Polynomials with Rational Coefficients - Lenstra, Lovàsz - 1982
533	How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
512	Efficient signature generation for smart cards - Schnorr - 1991
289	Zero Knowledge Proofs of Identity - Feige, Fiat, et al. - 1987
284	M.: Universal one-way hash functions and their cryptographic applications - Naor, Yung - 1989
227	Security arguments for digital signatures and blind signatures - Pointcheval, Stern
183	A digital signature based on a conventional encryption function - Merkle - 1987
163	A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence - Ajtai, Dwork - 1997
150	Witness indistinguishable and witness hiding protocols - Feige, Shamir - 1990
131	Provably secure and practical identification schemes and corresponding signature schemes - Okamoto - 1993
124	Generating hard instances of lattice problems - Ajtai - 2004
75	On the limits of nonapproximability of lattice problems - Goldreich, Goldwasser
54	Lossy trapdoor functions and their applications - Peikert, Waters - 2008
51	Worst-Case to Average-Case Reductions Based on Gaussian Measures - Micciancio, Regev - 2007
49	A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem, in 23rd annual symposium on foundations of computer science - Shamir - 1982
47	Another NP-complete problem and the complexity of computing short vectors in a lattice - Boas - 1981
46	Trapdoors for hard lattices and new cryptographic constructions - Gentry, Peikert, et al. - 2008
45	On-line/off-line digital signatures - Even, Goldreich, et al. - 1996
43	Collision-Free Hashing from Lattice Problems - Goldreich, Goldwasser, et al. - 1996
37	New lattice based cryptographic constructions - Regev - 2003
36	An Efficient Identification Scheme Based on Permuted Kernels - Shamir - 1990
33	The Random Oracle Methodology - Canetti, Goldreich, et al.
33	Statistical zero-knowledge proofs with efficient provers: Lattice problems and more - Micciancio, Vadhan - 2003
30	Generalized compact knapsacks, cyclic lattices, and efficient one-way functions - Micciancio
29	A “paradoxical” indentity-based signature scheme resulting from zero-knowledge - Guillou, Quisquater - 1990
28	A knapsack type public key cryptosystem based on arithmetic in finite fields - Chor, Rivest - 1985
27	Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices - Peikert, Rosen - 2006
27	A hierarchy of polynomial time basis reduction algorithms. Theory of algorithms - Schnorr - 1986
26	From identification to signatures via the Fiat-Shamir transform: Minimizing assumptions for security and forward-security - Abdalla, An, et al. - 2002
24	U.: On the efficiency of one-time digital signatures - Bleichenbacher, Maurer - 1996
24	Ntrusign: Digital signatures using the ntru lattice - Hoffstein, Howgrave-Graham, et al.
23	Generalized Compact Knapsacks Are Collision Resistant - Lyubashevsky, Micciancio - 2006
20	On the security of a practical identification scheme - Shoup - 1999
19	The composite discrete logarithm and secure authentication - Pointcheval - 2000
18	Cryptanalysis of the Chor-Rivest Cryptosystem - Vaudenay
17	Lattice problems in NP ∩ coNP - Aharonov, Regev
15	SWIFFT: a modest proposal for FFT hashing - Lyubashevsky, Micciancio, et al. - 2008
15	Merkle tree traversal in log space and time - Szydlo - 2004
14	Lattice-based identification schemes secure under active attacks - Lyubashevsky - 2008
12	Multi-signatures in the plain public-key model and a general forking lemma - Bellare, Neven - 2006
9	A new paradigm for public key identification - Stern - 1996
8	Two-tier signatures, strongly unforgeable signatures, and fiat-shamir without random oracles - Bellare, Shoup - 2007
7	L.: A practical attack against knapsack based hash functions (extended abstract - Joux, Granboulan - 1994
6	Approximating SV P∞ to within almost-polynomial factors is NP-hard - Dinur - 2002
5	A design principle for hash functions, in Crypto ’89 [12 - Damg˚ard - 1990
4	M.: Lower bounds on signatures from symmetric primitives - Barak, Mahmoody - 2007
2	Provably unforgeable signatures, CRYPTO - Bos, Chaum - 1992