{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T05:40:29Z","timestamp":1743658829337,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314476"},{"type":"electronic","value":"9783642314483"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31448-3_35","type":"book-chapter","created":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T22:03:32Z","timestamp":1341439412000},"page":"450-457","source":"Crossref","is-referenced-by-count":0,"title":["Non-malleable Instance-Dependent Commitment in the Standard Model"],"prefix":"10.1007","author":[{"given":"Wenpan","family":"Jing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haixia","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, pp. 13\u201325. Springer (1998)","DOI":"10.1007\/BFb0055717"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment, pp. 141\u2013150. ACM (1998)","DOI":"10.1145\/276698.276722"},{"key":"35_CR3","unstructured":"Damgard, I.: On \u03a3-protocols (2010), http:\/\/www.daimi.au.dk\/ivan\/Sigma.pdf"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography, pp. 542\u2013552. ACM (1991)","DOI":"10.1145\/103418.103474"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: Completely non-malleable schemes. Automata, Languages and Programming, 779\u2013790 (2005)","DOI":"10.1007\/11523468_63"},{"key":"35_CR6","unstructured":"Goldreich, O.: On promise problems (a survey in memory of Shimon Even (1935-2004)). ECCC, TR05-018 127, 128 (2005)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Ong, S., Vadhan, S.: An equivalence between zero knowledge and commitments. Theory of Cryptography, 482\u2013500 (2008)","DOI":"10.1007\/978-3-540-78524-8_27"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: 40th FOCS, pp. 543\u2013553 (1999)","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45539-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: Using Hash Functions as a Hedge against Chosen Ciphertext Attack. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 275\u2013288. Springer, Heidelberg (2000)"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1137\/S0097539705447207","volume":"36","author":"S. Vadhan","year":"2007","unstructured":"Vadhan, S.: An unconditional study of computational zero knowledge. SIAM Journal on Computing\u00a036, 1160\u20131214 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 542\u2013552 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s001459900018","volume":"10","author":"T. Itoh","year":"1997","unstructured":"Itoh, T., Ohta, Y., Shizuya, H.: A language-dependent cryptographic primitive. Journal of Cryptology\u00a010, 37\u201349 (1997)","journal-title":"Journal of Cryptology"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-73420-8_30","volume-title":"Automata, Languages and Programming","author":"B. Kapron","year":"2007","unstructured":"Kapron, B., Malka, L., Srinivasan, V.: A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 328\u2013339. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31448-3_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T05:19:17Z","timestamp":1743657557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31448-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314476","9783642314483"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31448-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}