Public-Key Cryptosystems from Lattice Reduction Problems

Public-Key Cryptosystems from Lattice Reduction Problems (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Oded Goldreich , Shafi Goldwasser , Shai Halevi

Citations:

99 - 4 self

BibTeX

@INPROCEEDINGS{Goldreich96public-keycryptosystems,
    author = {Oded Goldreich and Shafi Goldwasser and Shai Halevi},
    title = {Public-Key Cryptosystems from Lattice Reduction Problems},
    booktitle = {},
    year = {1996},
    pages = {112--131},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We present a new proposal for a trapdoor one-way function, from whichwe derive public-key encryption and digital signatures. The security of the new construction is based on the conjectured computational difficulty of lattice-reduction problems, providing a possible alternative to existing public-key encryption algorithms and digital signatures such as RSA and DSS.

Citations

2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
2292	New directions in cryptography - Diffie, Hellmen - 1976
1001	Probabilistic encryption - Goldwasser, Micali - 1984
961	A public key cryptosystem and a signature scheme based on discrete logarithms - ElGamal - 1985
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
553	Factoring Polynomials with Rational Coefficients - Lenstra, Lovàsz - 1982
453	Theory and applications of trapdoor functions - Yao - 1982
292	L.: A Hard-Core Predicate for all One-Way Functions - Goldreich, Levin - 1989
284	M.: Universal one-way hash functions and their cryptographic applications - Naor, Yung - 1989
261	Digitalized signatures and public-key functions as intractable as factorization - Rabin
177	On Lovász’ lattice reduction and the nearest lattice point problem - Babai - 1986
171	One-way functions are necessary and sufficient for secure signatures - Rompel - 1990
163	A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence - Ajtai, Dwork - 1997
142	Public-Key Cryptosystem Based on Algebraic Coding Tehory - McEliece - 1978
138	Limits on the provable consequences of oneway permutations - Impagliazzo, Rudich - 1988
124	Generating hard instances of lattice problems - Ajtai - 2004
102	An efficient probabilistic public-key encryption scheme which hides all partial information - Blum, Goldwasser - 1985
89	A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms - Schnorr - 1987
82	Factoring polynomials with rational coe cients - Lenstra, Lenstra, et al. - 2001
69	Algorithms for black box fields and their application to cryptography - Boneh, Lipton - 1996
69	Efficient cryptographic schemes provably as secure as subset sum - Impagliazzo, Naor - 1996
54	On the existence of pseudorandom generators - Goldreich, Krawczyk, et al. - 1993
53	Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction - Schnorr, Hörner - 1995
47	Another NP-complete problem and the complexity of computing short vectors in a lattice - Boas - 1981
43	Collision-Free Hashing from Lattice Problems - Goldreich, Goldwasser, et al. - 1996
36	Algorithmic geometry of numbers - Kannan - 1987
34	One-way functions are necessary and su cient for secure signatures, STOC - Rompel - 1990
27	Two remarks concerning the Goldwasser-Micali-Rivest signature scheme - Goldreich - 1986
23	An E cient Probabilistic Public-Key Encryption Scheme which Hides All Partial Information - Blum, Goldwasser - 1984
16	Some Public-Key Crypto-Functions as Intractable as Factorization - Williams - 1985
15	E Hellman “ New directions - Diffie, Martin
6	The hardness of approximate optimia in lattices, codes, and systems of linear equations - Arora, Babai, et al. - 1993
1	AnotherNP-complete problem and the complexity of computing short vectors in a lattice. Reprot 81-04, Mathematische Instituut - Boas - 1981
1	Another MP-complete problem and the complexity of computing short vectors in a lattice. Reprot 81-04, Mathematische Instituut - Boas - 1981
1	A Public Key Cryptosystem and a Signature Scheme Basedon Discrete Logarithms - El-Carnal - 1985
1	Algorithmic Geometry of Numhers - Kannan - 1987