{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:38Z","timestamp":1725664058078},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992]]},"DOI":"10.1007\/3-540-56279-6_76","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:58:20Z","timestamp":1330253900000},"page":"229-238","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of composite numbers"],"prefix":"10.1007","author":[{"given":"Toshiya","family":"Itoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Horikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adleman, L.M. and Huang, M.D.A., \u201cRecognizing Primes in Random Polynomial Time,\u201d Proc. of STOC, pp.462\u2013469 (1987).","key":"25_CR1","DOI":"10.1145\/28395.28445"},{"issue":"No.3","key":"25_CR2","first-page":"327","volume":"42","author":"W. Aiello","year":"1991","unstructured":"Aiello, W. and H\u00e5stad, J., \u201cStatistical Zero-Knowledge Languages Can Be Recognized in Two Rounds,\u201d JCSS, Vol. 42, No.3, pp. 327\u2013345 (1991).","journal-title":"JCSS"},{"issue":"No.2","key":"25_CR3","first-page":"254","volume":"36","author":"L. Babai","year":"1988","unstructured":"Babai, L. and Moran, S., \u201cArthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes,\u201d JCSS, Vol. 36, No.2, pp. 254\u2013276 (1988).","journal-title":"JCSS"},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., and Ostrovsky, R., \u201cPerfect Zero-Knowledge in Constant Rounds,\u201d Proc. of STOC, pp.482\u2013493 (1990).","key":"25_CR4","DOI":"10.1145\/100216.100283"},{"doi-asserted-by":"crossref","unstructured":"Fortnow, L., The Complexity of Perfect Zero-Knowledge,\u201d Proc. of STOC, pp.204\u2013209 (1987).","key":"25_CR5","DOI":"10.1145\/28395.28418"},{"key":"25_CR6","series-title":"LNCS 443","first-page":"268","volume-title":"Proc. of ICALP'90","author":"O. Goldreich","year":"1990","unstructured":"Goldreich, O. and Krawczyk, H., \u201cOn the Composition of Zero-Knowledge Proof Systems,\u201d Proc. of ICALP'90, LNCS 443, Springer-Verlag, Berlin, pp. 268\u2013282 (1990)."},{"issue":"No.1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., and Rackoff, C., \u201cThe Knowledge Complexity of Interactive Proof Systems,\u201d SIAM J. Comput., Vol. 18, No.1, pp. 186\u2013208 (1989).","journal-title":"SIAM J. Comput."},{"issue":"No.1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., and Wigderson, A., \u201cProofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems,\u201d JACM, Vol. 38, No.1, pp. 691\u2013729 (1991).","journal-title":"JACM"},{"unstructured":"Goldreich, O. and Oren, Y., \u201cDefinitions and Properties of Zero-Knowledge Proof Systems,\u201d Tech. Rep. #610, Technion, Department of Computer Science (1990).","key":"25_CR9"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O., \u201cProbabilistic Algorithm for Primality Testing,\u201d Journal of Number Theory, Vol. 12, pp. 128\u2013138 (1980).","journal-title":"Journal of Number Theory"},{"issue":"No.1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"Solovay, R. and Strassen, V., \u201cA Fast Monte Calro Test for Primality,\u201d SIAM J. Comput., Vol. 6, No.1, pp. 84\u201385 (1977).","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Tompa, M. and Woll, H., \u201cRandom Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information,\u201d Proc. of FOCS, pp.472\u2013482 (1987).","key":"25_CR12","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:44:44Z","timestamp":1558269884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}