{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T13:28:39Z","timestamp":1773754119443,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540259107","type":"print"},{"value":"9783540320555","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11426639_4","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T11:02:36Z","timestamp":1279105356000},"page":"58-77","source":"Crossref","is-referenced-by-count":22,"title":["Reducing Complexity Assumptions for Statistically-Hiding Commitment"],"prefix":"10.1007","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Horvitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiu-Yuen","family":"Koo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruggero","family":"Morselli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronen","family":"Shaltiel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/147508.147537","volume":"39","author":"M. Bellare","year":"1992","unstructured":"Bellare, M., Micali, S.: How to sign given any trapdoor permutation. J. ACM\u00a039(1), 214\u2013233 (1992)","journal-title":"J. ACM"},{"key":"4_CR2","unstructured":"Blum, M.: Coin flipping by phone. In: IEEE COMPCOM (1982)"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically-strong sequences of pseudorandom bits. SIAM J. Computing\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM J. Computing"},{"issue":"6","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge. SIAM J. Computing\u00a020(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Computing"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00204448","volume":"2","author":"J.F. Boyar","year":"1990","unstructured":"Boyar, J.F., Kurtz, S.A., Krentel, M.W.: Discrete logarithm implementation of perfect zero-knowledge blobs. Journal of Cryptology\u00a02(2), 63\u201376 (1990)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Computer and System Sciences\u00a037(2), 156\u2013189 (1988)","journal-title":"J. Computer and System Sciences"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. J. Computer and System Sciences\u00a018(2), 143\u2013154 (1979)","journal-title":"J. Computer and System Sciences"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","first-page":"250","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"I. Damg\u00e5rd","year":"1993","unstructured":"Damg\u00e5rd, I., Pedersen, T., Pfitzmann, B.: On the existence of statistically-hiding bit commitment and fail-stop signatures. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 250\u2013265. Springer, Heidelberg (1993)"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero-knowledge proofs under general assumptions. SIAM J. Computing\u00a029(1), 1\u201328 (1999)","journal-title":"SIAM J. Computing"},{"key":"4_CR10","series-title":"Basic Tools","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Tools, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"key":"4_CR11","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-39568-7_22","volume-title":"Advances in Cryptology","author":"O. Goldreich","year":"1985","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 276\u2013288. Springer, Heidelberg (1985)"},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Impagliazzo, R., Levin, L., Venkatesan, R., Zuckerman, D.: Security preserving amplification of hardness. In: FOCS (1990)","DOI":"10.1109\/FSCS.1990.89550"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology\u00a09(3), 167\u2013190 (1996)","journal-title":"Journal of Cryptology"},{"issue":"6","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0222069","volume":"22","author":"O. Goldreich","year":"1993","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM J. Computing\u00a022(6), 1163\u20131175 (1993)","journal-title":"SIAM J. Computing"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: Hard-core predicates for any one-way function. In: STOC (1989)","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. on Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. on Computing"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"S. Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 201\u2013215. Springer, Heidelberg (1996)"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity-based cryptography. In: FOCS (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC (1989)","DOI":"10.1145\/73007.73012"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00145-002-0143-7","volume":"16","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. Journal of Cryptology\u00a016(3), 143\u2013184 (2003)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. J. Crypto.\u00a011(2), 87\u2013108 (1998)","journal-title":"J. Crypto."},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic application. In: STOC (1989)","DOI":"10.1145\/73007.73011"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 92","author":"R. Ostrovsky","year":"1992","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Secure commitment against a powerful adversary. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, Springer, Heidelberg (1992)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Fair games against an all-powerful adversary. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a013 (1993)","DOI":"10.1007\/978-1-4613-9323-8_31"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC (1990)","DOI":"10.1145\/100216.100269"},{"issue":"2","key":"4_CR30","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00190757","volume":"8","author":"A. Russel","year":"1995","unstructured":"Russel, A.: Necessary and sufficient conditions for collision-free hashing. J. Cryptology\u00a08(2), 87\u2013100 (1995)","journal-title":"J. Cryptology"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","first-page":"412","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"A. Santis De","year":"1990","unstructured":"De Santis, A., Yung, M.: On the design of provably-secure cryptographic hash functions. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 412\u2013431. Springer, Heidelberg (1990)"},{"issue":"2","key":"4_CR32","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/S089548019223872X","volume":"8","author":"J.P. Schmidt","year":"1995","unstructured":"Schmidt, J.P., Siegel, A., Srinivasan, A.: Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math.\u00a08(2), 223\u2013250 (1995)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11426639_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:55:36Z","timestamp":1605624936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11426639_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259107","9783540320555"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11426639_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}