{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:52Z","timestamp":1775794852941,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633846","type":"print"},{"value":"9783540695288","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052231","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T14:37:31Z","timestamp":1155825451000},"page":"112-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":286,"title":["Public-key cryptosystems from lattice reduction problems"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai. Generating hard instances of lattice problems. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 99\u2013108, 1996.","DOI":"10.1145\/237814.237838"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai and C. Dwork. A Public-Key Cryptosystem with Worst-Case\/Average-Case Equivalence, In 29th ACM Symposium on Theory of Computing, pages 284\u2013293, 1997.","DOI":"10.1145\/258533.258604"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S. Arora","year":"1997","unstructured":"S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optimia in lattices, codes, and systems of linear equations. In Journal of Computer and System Sciences, 54(2), pages 317\u2013331, 1997.","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR4","doi-asserted-by":"publisher","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, in Combinatorica, vol. 6, 1986, pp. 1\u201313.","journal-title":"Combinatorica"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Goldwasser. An Efficient Probabilistic Public-Key Encryption Scheme which Hides All Partial Information, in Proceedings of CRYPTO '84, Springer-Verlag, 1985, pp. 289\u2013299.","DOI":"10.1007\/3-540-39568-7_23"},{"key":"8_CR6","unstructured":"P. van Emde Boas, Another NP-complete problem and the complexity of computing short vectors in a lattice. Reprot 81-04, Mathematische Instituut, University of Amsterdam, 1981."},{"key":"8_CR7","unstructured":"Digital Signature Standard (DSS). FIPS PUB 186, 1994."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M.E. Hellman. New Directions In Cryptography. IEEE Transactions on Information Theory, Vol IT-22, 1976, pp. 644\u2013654.","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. El-Gamal","year":"1985","unstructured":"T. El-Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Information Theory, vol. 31, 1985, pp. 469\u2013472","journal-title":"IEEE Trans. Information Theory"},{"key":"8_CR10","unstructured":"O. Goldreich, S. Goldwasser and S. Halevi Collision-Free Hashing from Lattice Problems. Theory of Cryptography Library: Record 96-09. Available from http:\/\/theory.lcs.mit.edu\/~tcryptol\/1996\/96-09.html"},{"key":"8_CR11","unstructured":"O. Goldreich, S. Goldwasser and S. Halevi Public-Key Cryptosystems from Lattice Reductions Problems. ECCC Report TR96-056. Available from http:\/\/www.eccc.uni-trier.de\/eccc-local\/Lists\/TR-1996.html"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L.A. Levin A Hard-Core Predicate for All One-Way Functions Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 25\u201332","DOI":"10.1145\/73007.73010"},{"key":"8_CR13","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. Journal of Computer and System Sciences, Vol. 28, 1984, pp. 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"issue":"no.2","key":"8_CR14","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.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack. SIAM Journal on Computing, Vol. 17, no. 2, 1988, pp. 281\u2013308.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"R. Kannan. Algorithmic Geometry of Numbers. in Annual Review of Computer Science, vol. 2, 1987, Annual Reviews Inc.","DOI":"10.1146\/annurev.cs.02.060187.001311"},{"key":"8_CR16","unstructured":"The LiDIA project software-package and user-manual. Available from http: \/\/www.informatik.th-darmstadt.de\/TI\/LiDIA\/"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra, L. Lov\u00e1sz. Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515\u2013534 (1982).","journal-title":"Mathematische Annalen"},{"key":"8_CR18","unstructured":"R.J. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory. DSN Progress Report 42-44, Jet Propulsion Laboratory"},{"key":"8_CR19","unstructured":"M.O. Rabin, Digital Signatures and Public-Key Functions as Intractable as Factorization. Technical Report MIT\/LCS\/TR-212, M.I.T., 1978."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, Vol. 21, 1978, pp. 120\u2013126.","journal-title":"Communications of the ACM"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.P. Schnorr","year":"1987","unstructured":"C.P. Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. in Theoretical Computer Science, vol. 53, 1987, pp. 201\u2013224","journal-title":"Theoretical Computer Science"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"C.P. Schnorr and H.H. Horner, Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction, in Proceedings of EUROCRYPT '95, Louis C. Guillou and Jean-Jacques Quisquater, editors. Lecture Notes in Computer Science, volume 921, Springer-Verlag, 1995. pp. 1\u201312","DOI":"10.1007\/3-540-49264-X_1"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:20:17Z","timestamp":1580336417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633846","9783540695288"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0052231","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}