{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:41Z","timestamp":1766281001230},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642004568"},{"type":"electronic","value":"9783642004575"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00457-5_7","type":"book-chapter","created":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T04:59:44Z","timestamp":1235019584000},"page":"91-108","source":"Crossref","is-referenced-by-count":14,"title":["Simulation-Based Concurrent Non-malleable Commitments and Decommitments"],"prefix":"10.1007","author":[{"given":"Rafail","family":"Ostrovsky","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/276698.276722","volume-title":"30th Annual ACM Symposium on Theory of Computing","author":"G. Crescenzo Di","year":"1998","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, USA, pp. 141\u2013150. ACM Press, New York (1998)"},{"key":"7_CR2","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":"7_CR3","first-page":"533","volume-title":"37th Annual ACM Symposium on Theory of Computing","author":"R. Pass","year":"2005","unstructured":"Pass, R., Rosen, A.: New and Improved Constructions of Non-Malleable Cryptographic Protocols. In: 37th Annual ACM Symposium on Theory of Computing, pp. 533\u2013542. ACM Press, New York (2005)"},{"key":"7_CR4","first-page":"563","volume-title":"46th Annual Symposium on Foundations of Computer Science","author":"R. Pass","year":"2005","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: 46th Annual Symposium on Foundations of Computer Science, pp. 563\u2013572. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"7_CR5","unstructured":"Blum, M.: Coin flipping by telephone. In: Proc. IEEE Spring COMPCOM, pp. 133\u2013137 (1982)"},{"key":"7_CR6","first-page":"174","volume-title":"27th Annual Symposium on Foundations of Computer Science","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Ontario, Canada, pp. 174\u2013187. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"7_CR7","first-page":"542","volume-title":"23rd Annual ACM Symposium on Theory of Computing","author":"D. Dolev","year":"1991","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: 23rd Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, USA, pp. 542\u2013552. ACM Press, New York (1991)"},{"key":"7_CR8","first-page":"345","volume-title":"43rd Annual Symposium on Foundations of Computer Science","author":"B. Barak","year":"2002","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: 43rd Annual Symposium on Foundations of Computer Science, Vancouver, British Columbia, Canada, pp. 345\u2013355. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1137\/060661880","volume":"37","author":"R. Pass","year":"2008","unstructured":"Pass, R., Rosen, A.: Concurrent nonmalleable commitments. SIAM Journal on Computing\u00a037, 1891\u20131925 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR10","unstructured":"Feige, U.: Alternative Models for Zero Knowledge Interactive Proofs. Weizmann Institute of Science (1990)"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/276698.276853","volume-title":"30th Annual ACM Symposium on Theory of Computing","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, USA, pp. 409\u2013418. ACM Press, New York (1998)"},{"key":"7_CR12","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":"7_CR13","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Concurrent non-malleable witness indistinguishability and its applications. Technical Report ECCC Report TR06-095, ECCC (2006)"},{"key":"7_CR14","volume-title":"47th Annual Symposium on Foundations of Computer Science","author":"B. Barak","year":"2006","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: 47th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Constant-round concurrent non-malleable commitments and decommitments. Technical Report 2008\/235, Cryptology ePrint Archive (2008)","DOI":"10.1007\/978-3-642-00457-5_7"},{"key":"7_CR16","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":"7_CR17","first-page":"416","volume-title":"22nd Annual ACM Symposium on Theory of Computing","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, USA, pp. 416\u2013426. ACM Press, New York (1990)"},{"key":"7_CR18","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 Journal on Computing\u00a029, 1\u201328 (1999)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00457-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T22:49:29Z","timestamp":1684882169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00457-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004568","9783642004575"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00457-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}