{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T23:33:11Z","timestamp":1794353591120,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540785231","type":"print"},{"value":"9783540785248","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78524-8_31","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T04:18:12Z","timestamp":1203913092000},"page":"571-588","source":"Crossref","is-referenced-by-count":66,"title":["Concurrent Non-malleable Commitments from Any One-Way Function"],"prefix":"10.1007","author":[{"given":"Huijia","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go Beyond the Black-Box Simulation Barrier. In: 42nd FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B.: Constant-Round Coin-Tossing or Realizing the Shared-Random String Model. In: 43rd FOCS, pp. 345\u2013355 (2002)","DOI":"10.1109\/SFCS.2002.1181957"},{"key":"#cr-split#-31_CR3.1","doi-asserted-by":"crossref","unstructured":"Brassard, G., Chaum, D., Cr??peau, C.: Minimum Disclosure Proofs of Knowledge. JCSS??37(2), 156???189 (1988);","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"#cr-split#-31_CR3.2","unstructured":"Preliminary version by Brassard and Cr??peau. In: 27th FOCS (1986)"},{"key":"31_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.: Proofs 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":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-540-28628-8_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"G. Crescenzo di","year":"2004","unstructured":"di Crescenzo, G., Persiano, G., Visconti, I.: Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 237\u2013253. Springer, Heidelberg (2004)"},{"issue":"2","key":"31_CR6","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":"31_CR7","series-title":"Lecture Notes in Computer Science","first-page":"181","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Feige","year":"1987","unstructured":"Feige, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 181\u2013187. Springer, Heidelberg (1987)"},{"key":"31_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography \u2013 Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 Basic Tools. Cambridge University Press, Cambridge (2001)"},{"issue":"1","key":"31_CR9","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 Jour. on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Jour. on Computing"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In: 36th STOC, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In: 44th FOCS (2003)","DOI":"10.1109\/SFCS.2003.1238214"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and Improved Constructions of Non-Malleable Cryptographic Protocols. In: 37th STOC, pp. 533\u2013542 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"31_CR13","unstructured":"Pass, R., Vaikuntanathan, V.: New-Age Cryptography (manuscript)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78524-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:09Z","timestamp":1619507529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785231","9783540785248"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_31","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8","asserted-by":"object"}]},"subject":[]}}