{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:28Z","timestamp":1725456748377},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642347030"},{"type":"electronic","value":"9783642347047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34704-7_25","type":"book-chapter","created":{"date-parts":[[2012,10,19]],"date-time":"2012-10-19T02:38:37Z","timestamp":1350614317000},"page":"363-378","source":"Crossref","is-referenced-by-count":0,"title":["Concurrent Non-Malleable Witness Indistinguishable Argument from Any One-Way Function"],"prefix":"10.1007","author":[{"given":"Guifang","family":"Huang","sequence":"first","affiliation":[]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","first-page":"106","volume-title":"42nd Annual Symposium on Foundations of Computer Science (FOCS 2001)","author":"B. Barak","year":"2001","unstructured":"Barak, B.: How to Go Beyond the Black-Box Barrier. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), pp. 106\u2013115. IEEE Computer Society Press, Washington (2001)"},{"key":"25_CR2","first-page":"345","volume-title":"43rd Annual Symposium on Foundations of Computer Science (FOCS 2002)","author":"B. Barak","year":"2002","unstructured":"Barak, B.: Constant-Round Coin-Tossing or Realizing the Shared random String Model. In: 43rd Annual Symposium on Foundations of Computer Science (FOCS 2002), pp. 345\u2013355. IEEE Computer Society Press, Washington (2002)"},{"key":"25_CR3","unstructured":"Blum, M.: How to Prove a Theorem So No One Else Can Claim It. In: International Congress of Mahematicians (ICM 1986), pp. 1444\u20131451 (1986)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proof of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/276698.276722","volume-title":"30th Annual ACM Symposium on Theory of Computing (STOC 1998)","author":"G. Crescenzo Di","year":"1998","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-Interactive and Non-Malleable Commitments. In: Vitter, J.S. (ed.) 30th Annual ACM Symposium on Theory of Computing (STOC 1998), pp. 141\u2013150. ACM Press, New York (1998)"},{"key":"25_CR6","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":"25_CR7","first-page":"426","volume-title":"35th Annual ACM Symposium on Theory of Computing (STOC 2003)","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Groth, J.: Non-Interactive and Reusable Non-Malleable Commitment Schemes. In: Larmore, L.L., Goemans, M.X. (eds.) 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 426\u2013437. ACM Press, New York (2003)"},{"key":"25_CR8","unstructured":"Damg\u00e5rd, I.: On \u03a3-Protocols, http:\/\/www.daimi.au.dk\/~ivan\/CPT.html"},{"issue":"2","key":"25_CR9","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.: Non-Malleable Cryptography. SIAM Journal on Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR10","first-page":"141","volume-title":"30th Annual ACM Symposium on Theory of Computing (STOC 1998)","author":"C. Dork","year":"1998","unstructured":"Dork, C., Naor, M., Sahai, A.: Concurrent Zero Knowledge. In: Vitter, J.S. (ed.) 30th Annual ACM Symposium on Theory of Computing (STOC 1998), pp. 141\u2013150. ACM Press, New York (1998)"},{"issue":"6","key":"25_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A Randomized Protocol for Signing Contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"25_CR12","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)"},{"issue":"1","key":"25_CR13","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 Journal on Computing\u00a029(1), 1\u201328 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR14","first-page":"416","volume-title":"22nd Annual Symposium on Theory of Computing (STOC 1990)","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Witness Indistinguishable and Witness Hiding Protocols. In: Ortiz, H. (ed.) 22nd Annual Symposium on Theory of Computing (STOC 1990), pp. 416\u2013426. ACM Press, New York (1990)"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00145-005-0307-3","volume":"19","author":"J.A. Garay","year":"2006","unstructured":"Garay, J.A., Mackenzie, P., Yang, K.: Strengtheninging Zero Knowledge Protocols Using Signatures. Journal of Cryptology\u00a019(2), 169\u2013209 (2006)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR17","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":"25_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/1536414.1536441","volume-title":"41st Annual ACM Symposium on Theory of Computing (STOC 2009)","author":"H. Lin","year":"2009","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: A Unified Framework for Concrrent Security: Universal Composability from Stand-Alone Non-Malleability. In: Mitzenmacher, M. (ed.) 41st Annual ACM Symposium on Theory of Computing (STOC 2009), pp. 179\u2013188. ACM Press, New York (2009)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-642-14623-7_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H. Lin","year":"2010","unstructured":"Lin, H., Pass, R., Tseng, W.-L.D., Venkitasubramaniam, M.: Concurrent Non-Malleable Zero Knowledge Proofs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 429\u2013446. Springer, Heidelberg (2010)"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit Commitment Using Pseudo-Randomness. Journal of Crypto.\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Crypto."},{"key":"25_CR21","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Concurrent Non-Malleable Witness Indistinguishability and Its Applications. Electronic Colloquium on Computational Complexity (ECCC), Report (2006)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-70583-3_45","volume-title":"Automata, Languages and Programming","author":"R. Ostrovsky","year":"2008","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 548\u2013559. Springer, Heidelberg (2008)"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-00457-5_7","volume-title":"Theory of Cryptography","author":"R. Ostrovsky","year":"2009","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Simulation-Based Concurrent Non-Malleable Commitments and Decommitments. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 91\u2013108. Springer, Heidelberg (2009)"},{"key":"25_CR24","first-page":"533","volume-title":"37th Annual ACM Symposium on Theory of Computing (STOC 2005)","author":"R. Pass","year":"2005","unstructured":"Pass, R., Rosen, A.: New and Improved Constructions of Non-Malleable Cryptographic Protocols. In: Gabow, H.N., Fagin, R. (eds.) 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 533\u2013542. ACM Press, New York (2005)"},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/SFCS.2005.27","volume-title":"46th Annual Symposium on Foundations of Computer Science (FOCS 2005)","author":"R. Pass","year":"2005","unstructured":"Pass, R., Rosen, A.: Concurrent Non-Malleable Commitments. In: 46th Annual Symposium on Foundations of Computer Science (FOCS 2005), pp. 563\u2013572. IEEE Computer Society Press, Washington (2005)"},{"key":"25_CR26","first-page":"387","volume-title":"22nd Annual ACM Symposium on Theory of Computing (STOC 1990)","author":"J. Rompel","year":"1990","unstructured":"Rompel, J.: One-Way Function are Necessary and Sufficient for Secure Signatures. In: Ortiz, H. (ed.) 22nd Annual ACM Symposium on Theory of Computing (STOC 1990), pp. 387\u2013394. ACM Press, New York (1990)"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the Concurrent Composition of Zero-Knowledge Proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 415\u2013431. Springer, Heidelberg (1999)"},{"key":"25_CR28","first-page":"543","volume-title":"40th Annual Symposium on Foundations of Computer Science (FOCS 1999)","author":"A. Sahai","year":"1999","unstructured":"Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen Cipher-Text Security. In: 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 543\u2013553. IEEE Computer Society Press, Washington (1999)"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust Non-interactive Zero Knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34704-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T08:49:01Z","timestamp":1687769341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34704-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642347030","9783642347047"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34704-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}