Abstract
We describe constructions of several cryptographic primitives, including hash functions, public key cryptosystems, pseudo-random bit generators, and digital signatures, whose security depends on the assumed worst-case or average-case hardness of problems involving lattices.
Preview
Unable to display preview. Download preview PDF.
References
L. Adleman, On Breaking Generalized Knapsack Public Key Cryptosystems, Proceedings 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 402–412
M. Ajtai, Generating Hard Instances of Lattice Problems, Proceedings 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 99–108 Electronic Colloquium on Computational Complexity TR96-007, http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1996.html
M. Ajtai, discussion with the author, 1996
M. Ajtai, C. Dwork, A Public-Key Cryptosystem with Average-Case/Worst-Case Equivalence, Proceedings 29th Annual ACM Symposium on Theory of Computing, 1997; see also Electronic Colloquium on Computational Complexity TR96-065, http://www.eccc.unitrier.de/eccc-local/Lists/TR-1996.html
L. Babai, On Lovász' Lattice Reduction and the Nearest Lattice Point Problem, Combinatorica 6(1), 1986, pp. 1–13
M. Blum and S. Micali, How to Generate Cryptographically Strong Sequences of PseudoRandom Bits, SIAM J. Computing 13, 1984, pp. 850–864
J.-Y. Cai and A. P. Nerurkar, An Improved Worst-Case to Average-Case Connection for Lattice Problems, private communication, 1997
J.W.S. Cassels, An Introduction to the Geometry of Numbers, Springer, 1959
D. Coppersmith, Finding a Small Root of a Univariate Modular Equation, Proc. EUROCRYPT'96
D. Coppersmith, M. Franklin. J. Patarin, and M. Reiter, Low Exponent RSA with Related Messages, Proc. EUROCRYPT'96
D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography, Proceedings 23th Annual ACM Symposium on Theory of Computing, 1991, pp. 542–550
O. Goldreich, Foundations of Cryptography (Fragments of a Book), http://www.wisdom.weizmann.ac.il/people/homepages/oded/frag.html
O. Goldreich, S. Goldwasser, and S. Halevi, Collision-Free Hashing from Lattice Problems, Electronic Colloquium on Computational Complexity TR96-042, http://www.eccc.unitrier.de/eccc-local/Lists/TR-1996.html
O. Goldreich, S. Goldwasser, and S. Halevi, Public-Key Cryptosystems from Lattice Reduction Problems, Electronic Colloquium on Computational Complexity TR96-056, http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1996.html
O. Goldreich, S. Goldwasser, and S. Halevi, Eliminating the Decryption Error in the AjtaiDwork Cryptosystem, to appear, Proc. CRYPTO'97
S. Goldwasser and S. Micali, Probabilistic Encryption, J. Comput. System Sci. 28, 1984, pp. 270–299
S. Goldwasser, S. Micali, and R. Rivest, A “Paradoxical” Solution to the Signature Problem, SIAM J. Computing 17, 1988, pp. 281–308
M. Grötschel, Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Algorithms and Combinatorics 2, 1988
P.M. Gruber, C.G. Lekkerkerker, Geometry of Numbers, North-Holland, 1987
J. Hastad, Solving Simultaneous Modular Equations of Low Degree, SIAM J. Computing 17(2), pp. 336–341, 1988
R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum, J. Cryptology 9, pp. 199–216, 1996
J.C. Lagarias, A.M. Odlyzko, Solving low-density subset sum problems, Journal of the Association for Computing Machinery 32 pp. 229–246, 1985. An earlier version appeared in Proc. 24th Annual Symposium on Foundations of Computer Science, 1983
M. Luby, Pseudo-randomness and applications, Princeton University Press, 1996.
M. Naor and M. Yung, Universal One-Way Hash Functions and Their Cryptographic Applications, Proceedings 21th Annual ACM Symposium on Theory of Computing, 1989, pp. 33–43
A. Shamir, A Polynomial-Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem, Proc. 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 145–152
A. C. Yao, Theory and Applications of Trapdoor Functions, Proc. 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 80–91
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dwork, C. (1997). Positive applications of lattices to cryptography. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029948
Download citation
DOI: https://doi.org/10.1007/BFb0029948
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive