{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:32Z","timestamp":1725456332266},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029948","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"44-51","source":"Crossref","is-referenced-by-count":4,"title":["Positive applications of lattices to cryptography"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman, On Breaking Generalized Knapsack Public Key Cryptosystems, Proceedings 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 402\u2013412","DOI":"10.1145\/800061.808771"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, Generating Hard Instances of Lattice Problems, Proceedings 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 99\u2013108 Electronic Colloquium on Computational Complexity TR96-007, http:\/\/www.eccc.uni-trier.de\/eccc-local\/Lists\/TR-1996.html","DOI":"10.1145\/237814.237838"},{"key":"5_CR3","unstructured":"M. Ajtai, discussion with the author, 1996"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/258533.258604"},{"issue":"1","key":"5_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"L. Babai, On Lov\u00e1sz' Lattice Reduction and the Nearest Lattice Point Problem, Combinatorica 6(1), 1986, pp. 1\u201313","journal-title":"Combinatorica"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, How to Generate Cryptographically Strong Sequences of PseudoRandom Bits, SIAM J. Computing 13, 1984, pp. 850\u2013864","journal-title":"SIAM J. Computing"},{"key":"5_CR7","unstructured":"J.-Y. Cai and A. P. Nerurkar, An Improved Worst-Case to Average-Case Connection for Lattice Problems, private communication, 1997"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"J.W.S. Cassels, An Introduction to the Geometry of Numbers, Springer, 1959","DOI":"10.1007\/978-3-642-62035-5"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, Finding a Small Root of a Univariate Modular Equation, Proc. EUROCRYPT'96","DOI":"10.1007\/3-540-68339-9_14"},{"key":"5_CR10","unstructured":"D. Coppersmith, M. Franklin. J. Patarin, and M. Reiter, Low Exponent RSA with Related Messages, Proc. EUROCRYPT'96"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography, Proceedings 23th Annual ACM Symposium on Theory of Computing, 1991, pp. 542\u2013550","DOI":"10.1145\/103418.103474"},{"key":"5_CR12","unstructured":"O. Goldreich, Foundations of Cryptography (Fragments of a Book), http:\/\/www.wisdom.weizmann.ac.il\/people\/homepages\/oded\/frag.html"},{"key":"5_CR13","unstructured":"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"},{"key":"5_CR14","unstructured":"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"},{"key":"5_CR15","unstructured":"O. Goldreich, S. Goldwasser, and S. Halevi, Eliminating the Decryption Error in the AjtaiDwork Cryptosystem, to appear, Proc. CRYPTO'97"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, Probabilistic Encryption, J. Comput. System Sci. 28, 1984, pp. 270\u2013299","journal-title":"J. Comput. System Sci."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest, A \u201cParadoxical\u201d Solution to the Signature Problem, SIAM J. Computing 17, 1988, pp. 281\u2013308","journal-title":"SIAM J. Computing"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, Lov\u00e1sz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Algorithms and Combinatorics 2, 1988","DOI":"10.1007\/978-3-642-97881-4"},{"key":"5_CR19","unstructured":"P.M. Gruber, C.G. Lekkerkerker, Geometry of Numbers, North-Holland, 1987"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J. Hastad","year":"1988","unstructured":"J. Hastad, Solving Simultaneous Modular Equations of Low Degree, SIAM J. Computing 17(2), pp. 336\u2013341, 1988","journal-title":"SIAM J. Computing"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum, J. Cryptology 9, pp. 199\u2013216, 1996","journal-title":"J. Cryptology"},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"J.C. Lagarias, A.M. Odlyzko, Solving low-density subset sum problems, Journal of the Association for Computing Machinery 32 pp. 229\u2013246, 1985. An earlier version appeared in Proc. 24th Annual Symposium on Foundations of Computer Science, 1983","journal-title":"Journal of the Association for Computing Machinery"},{"key":"5_CR23","unstructured":"M. Luby, Pseudo-randomness and applications, Princeton University Press, 1996."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"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\u201343","DOI":"10.1145\/73007.73011"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"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\u2013152","DOI":"10.1109\/SFCS.1982.5"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Theory and Applications of Trapdoor Functions, Proc. 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 80\u201391","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:22:47Z","timestamp":1586593367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0029948","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}