{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:02:10Z","timestamp":1725541330668},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642103650"},{"type":"electronic","value":"9783642103667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10366-7_18","type":"book-chapter","created":{"date-parts":[[2009,11,30]],"date-time":"2009-11-30T22:08:44Z","timestamp":1259618924000},"page":"303-318","source":"Crossref","is-referenced-by-count":5,"title":["Non-malleable Statistically Hiding Commitment from Any One-Way Function"],"prefix":"10.1007","author":[{"given":"Zongyang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"1","volume-title":"STOC","author":"I. Haitner","year":"2007","unstructured":"Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 1\u201310. ACM, New York (2007)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput.\u00a030, 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-44598-6_26","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"M. Fischlin","year":"2000","unstructured":"Fischlin, M., Fischlin, R.: Efficient non-malleable commitment schemes. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 413\u2013431. Springer, Heidelberg (2000)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: STOC, pp. 141\u2013150 (1998)","DOI":"10.1145\/276698.276722"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00204448","volume":"2","author":"J. Boyar","year":"1990","unstructured":"Boyar, J., Kurtz, S.A., Krentel, M.W.: A discrete logarithm implementation of perfect zero-knowledge blobs. J. Cryptology\u00a02, 63\u201376 (1990)","journal-title":"J. Cryptology"},{"issue":"2","key":"18_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. Comput. Syst. Sci.\u00a037(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR7","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. Comput.\u00a017, 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"18_CR8","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. J. Cryptology\u00a09, 167\u2013190 (1996)","journal-title":"J. Cryptology"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s001459900026","volume":"10","author":"I. Damg\u00e5rd","year":"1997","unstructured":"Damg\u00e5rd, I., Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop signatures. J. Cryptology\u00a010, 163\u2013194 (1997)","journal-title":"J. Cryptology"},{"key":"18_CR10","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. Cryptology\u00a011, 87\u2013108 (1998)","journal-title":"J. Cryptology"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/11426639_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"I. Haitner","year":"2005","unstructured":"Haitner, I., Horvitz, O., Katz, J., Koo, C.Y., Morselli, R., Shaltiel, R.: Reducing complexity assumptions for statistically-hiding commitment. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 58\u201377. Springer, Heidelberg (2005)"},{"key":"18_CR12","first-page":"3","volume-title":"FOCS","author":"M.H. Nguyen","year":"2006","unstructured":"Nguyen, M.H., Ong, S.J., Vadhan, S.P.: Statistical zero-knowledge arguments for NP from any one-way function. In: FOCS, pp. 3\u201314. IEEE Computer Society, Los Alamitos (2006)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"Di Crescenzo, G., Katz, J., Ostrovsky, R., Smith, A.: Efficient and non-interactive non-malleable commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 40\u201359. Springer, Heidelberg (2001)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/060671553","volume":"38","author":"R. Pass","year":"2008","unstructured":"Pass, R., Rosen, A.: New and improved constructions of nonmalleable cryptographic protocols. SIAM J. Comput.\u00a038, 702\u2013752 (2008)","journal-title":"SIAM J. Comput."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-78524-8_31","volume-title":"Theory of Cryptography","author":"H. Lin","year":"2008","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: Concurrent non-malleable commitments from any one-way function. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 571\u2013588. Springer, Heidelberg (2008)"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1145\/100216.100272","volume-title":"STOC","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC, pp. 416\u2013426. ACM, New York (1990)"},{"key":"18_CR17","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"18_CR18","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. J. Cryptology\u00a04, 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"18_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol.\u00a01. Cambridge University Press, UK (2001)"},{"key":"18_CR20","unstructured":"Feige, U.: Alternative Models for Zero Knowledge Interactive Proofs. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel (1990)"},{"key":"18_CR21","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 noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput.\u00a029, 1\u201328 (1999)","journal-title":"SIAM J. Comput."},{"key":"18_CR22","unstructured":"MacKenzie, P., Yang, K.: On simulation-sound trapdoor commitments. Cryptology ePrint Archive, Report 2003\/252 (2003), http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10366-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:54:46Z","timestamp":1606168486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10366-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642103650","9783642103667"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10366-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}