{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:04Z","timestamp":1725664024964},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572206"},{"type":"electronic","value":"9783540479765"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/3-540-57220-1_81","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:21:50Z","timestamp":1330258910000},"page":"435-446","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On bit correlations among preimages of \u201cMany to one\u201d One-way functions"],"prefix":"10.1007","author":[{"given":"Kouichi","family":"Sakurai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiya","family":"Itoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"No.2","key":"35_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi,W., Chor,B., Goldreich,O., and Schnorr, C.P., \u201cRSA and Rabin functions: Certain Parts are as Hard as the Whole,\u201d SIAM J. on Computing, Vol.17, No.2, pp.194\u2013209 (April 1988).","journal-title":"SIAM J. on Computing"},{"key":"35_CR2","unstructured":"Bach, E., \u201cDiscrete Logarithms and Factoring,\u201d Report No. UCB\/CSD 84\/186, Univ. of California (1984)."},{"issue":"No.2","key":"35_CR3","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., and Cr\u00e9peau, C., \u201cMinimum Disclosure Proofs of Knowledge,\u201d Journal of Computer and System Sciences, Vol.37, No.2, pp.156\u2013189 (1988).","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Chor, B., and Shamir, A., \u201cOn the cryptographic security of single RSA bits,\u201d Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp.421\u2013430 (1983).","DOI":"10.1145\/800061.808773"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman,P., and Micali, S., \u201cNon-interactive zero-knowledge and its applications,\u201d Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.103\u2013112 (1988).","DOI":"10.1145\/62212.62222"},{"key":"35_CR6","unstructured":"Blum, M., \u201cCoin Flipping by Telephone,\u201d IEEE Spring COMPCOM (1982)."},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., and Micali, S., \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-Random Bits,\u201d SIAM J. on Computing, Vol.13, pp.850\u2013864 (1984).","journal-title":"SIAM J. on Computing"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science 218","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3-540-39799-X_35","volume-title":"Proceedings of CRYPTO'85","author":"B. Chor","year":"1986","unstructured":"Chor, B., Goldreich, O., and Goldwasser, S., \u201cThe bit security of modular squaring given partial factorization of the modulus,\u201d Proceedings of CRYPTO'85, Lecture Notes in Computer Science 218, pp.448\u2013457, Springer-Verlag, Berlin (1986)."},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science 304","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Proceedings of EUROCRYPT87","author":"I.B. Damg\u00e5rd","year":"1988","unstructured":"Damg\u00e5rd,I.B., \u201cCollision Free Hash Functions and Public Key Signature Scheme,\u201d Proceedings of EUROCRYPT87, Lecture Notes in Computer Science 304, Springer-Verlag, pp.203\u2013216, Berlin (1988)."},{"key":"35_CR10","unstructured":"Feige, U., Lapidot, D., and Shamir A., \u201cMultiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String,\u201d Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp.308\u2013318 (1990)."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Krawczyk, H. and Luby, M., \u201cOn the Existence of Pseudorandom Generator,\u201d Proceedings of the 29st Annual Symposium on Foundations of Computer Science, pp.12\u201324 (1988).","DOI":"10.1109\/SFCS.1988.21917"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., and Tong, P., \u201cWhy and how to establish a private code on a public network,\u201d Proceedings of the 23st Annual Symposium on Foundations of Computer Science, pp.134\u2013144 (1982).","DOI":"10.1109\/SFCS.1982.100"},{"issue":"No.2","key":"35_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., and Rivest, L., \u201cA digital signature scheme against adaptive chosen-message attack,\u201d SIAM J. on Computing, Vol.17, No.2, pp.281\u2013308 (April 1988).","journal-title":"SIAM J. on Computing"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich.O., and Levin, L.A., \u201cA Hard-Core Predicate for all One-Way Functions,\u201d Proceedings of the 21th Annual ACM Symposium on Theory of Computing, pp.25\u201332 (May 1989).","DOI":"10.1145\/73007.73010"},{"key":"35_CR15","unstructured":"Goldwasser, S. and Ostrovsky, R. \u201cNon-Interactive Zero-Knowledge Proofs and Invariant Signature are Equivalent,\u201d Preproceedings of CRYPTO'92 (1992)."},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., \u201cPseudo-Random Generator under Uniform Assumptions,\u201d Proceedings of the 22th Annual ACM Symposium on Theory of Computing, pp.12\u201324 (May 1990).","DOI":"10.1145\/100216.100270"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., and Luby, M., \u201cPseudo-random generation from one-way functions,\u201d Proceedings of the 21th Annual ACM Symposium on Theory of Computing, pp.12\u201324 (May 1989).","DOI":"10.1145\/73007.73009"},{"issue":"No.125","key":"35_CR18","first-page":"63","volume":"90","author":"K. Kurosawa","year":"1990","unstructured":"Kurosawa, K., Ogata, W., and Tsujii, S., \u201c4 Move ZKIP,\u201d IEICE Technical Report, Vol.90, No.125, pp.63\u201369 (July 1990).","journal-title":"IEICE Technical Report"},{"issue":"No.365","key":"35_CR19","first-page":"7","volume":"90","author":"K. Kurosawa","year":"1990","unstructured":"Kurosawa, K., Ogata, W., Sakurai, K., Itoh, T., and Tsujii, S., \u201c4-move zero-knowledge interactive proof systems,\u201d IEICE Technical Report, Vol.90, No.365, pp.7\u201310 (Dec. 1990).","journal-title":"IEICE Technical Report"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Kranakis, E., \u201cPrimality and cryptography,\u201d Wiley-Teubner Series in Computer Science (1986).","DOI":"10.1007\/978-3-322-96647-6"},{"key":"35_CR21","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G. Miller","year":"1976","unstructured":"Miller, G., \u201cRiemann's Hypothesis and Test for Primality,\u201d Journal of Computer and System Sciences, Vol.13, pp.300\u2013317 (1976).","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR22","series-title":"Lecture Notes in Computer Science 435","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Proceedings of CRYPTO'89","author":"M. Naor","year":"1990","unstructured":"Naor,M., \u201cBit Commitments using Pseudo-Randomness,\u201d Proceedings of CRYPTO'89, Lecture Notes in Computer Science 435, pp.128\u2013136, Springer-Verlag, Berlin (1990)."},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Naor,M., and Yung,M., \u201cUniversal One-way Hash functions and their Cryptographic Applications,\u201d Proceedings of the 21th Annual ACM Symposium on Theory of Computing, pp.33\u201343 (May 1989).","DOI":"10.1145\/73007.73011"},{"key":"35_CR24","unstructured":"Okamoto, T., private communication (Oct. 1990)."},{"key":"35_CR25","unstructured":"Rabin,M.O., \u201cDigital Signatures and public key functions as intractable as factorization,\u201d Technical Memo TM-212, LCS\/MIT (1919)."},{"key":"35_CR26","unstructured":"Russell A., \u201cNecessary and Sufficient Conditions for Collision-Free Hashing,\u201d Preproceedings of Crypto'92, (1992)."},{"key":"35_CR27","unstructured":"Sakurai,K., and Itoh,T., \u201cOn the Distribution of a Hard Bit of Square Roots Modulo a Product of Two Distinct Odd Primes,\u201d Manuscript (Oct. 1990)."},{"key":"35_CR28","doi-asserted-by":"crossref","unstructured":"Schrift, A.W. and Shamir, A. \u201cThe Discrete Log is very Discrete,\u201d Proceedings of the 22th Annual ACM Symposium on Theory of Computing, pp.405\u2013415 (May 1990).","DOI":"10.1145\/100216.100271"},{"key":"35_CR29","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0890-5401(87)90030-7","volume":"72","author":"H. Woll","year":"1987","unstructured":"Woll, H., \u201cReductions among Number Theoretic Problems,\u201d Information and computation, 72, pp.167\u2013179 (1987).","journal-title":"Information and computation"},{"key":"35_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C. \u201cTheory and applications of trapdoor functions,\u201d Proceedings of the 23st Annual Symposium on Foundations of Computer Science, pp.80\u201391 (1982).","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 AUSCRYPT '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57220-1_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:54:31Z","timestamp":1578527671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57220-1_81"}},"subtitle":["A new approach to study on randomness and hardness of one-way functions"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572206","9783540479765"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-57220-1_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}