{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:33:48Z","timestamp":1780068828767,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374329","type":"print"},{"value":"9783540374336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_16","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T06:21:52Z","timestamp":1158992512000},"page":"271-289","source":"Crossref","is-referenced-by-count":48,"title":["Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Pass","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"abhi","family":"shelat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 26. Springer, Heidelberg (1998)"},{"key":"16_CR3","unstructured":"Blum, M.: How to prove a theorem so no one can claim it. In: Proc. of The International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/3-540-48405-1_33","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Bellare","year":"1999","unstructured":"Bellare, M., Sahai, A.: Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 519\u2013536. Springer, Heidelberg (1999)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-44448-3_25","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"J.L. Camenisch","year":"2000","unstructured":"Camenisch, J.L., Damg\u00e5rd, I.B.: Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 331\u2013345. Springer, Heidelberg (2000)"},{"key":"16_CR6","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.B., 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":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"issue":"2","key":"16_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.: Nonmalleable cryptography. SIAM J. Comput.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"16_CR10","unstructured":"Dwork, C.: The non-malleability lectures. Course notes for Stanford CS 359 (1999), http:\/\/theory.stanford.edu\/~gdurf\/cs359-s99\/"},{"key":"16_CR11","unstructured":"Elkind, E., Sahai, A.: A unified methodology for constructing public-key encryption schemes secure against adaptive chosen-ciphertext attack. ePrint Archive 2002\/042 (2002)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-39200-9_33","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Gennaro","year":"2003","unstructured":"Gennaro, R., Lindell, Y.: A framework for password-based authenticated key exchange. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 524\u2013543. Springer, Heidelberg (2003)"},{"issue":"2","key":"16_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Kilian, J., Micali, S., Ostrovsky, R.: Minimum resource zero-knowledge proofs. In: FOCS, pp. 474\u2013479 (1989)","DOI":"10.1109\/SFCS.1989.63521"},{"key":"16_CR16","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical Report CSL-98, SRI International (October 1979)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Naor: Bit commitment using pseudorandomness. J. of Cryptology\u00a04 (1991)","DOI":"10.1007\/BF00196774"},{"key":"16_CR18","unstructured":"Naor, M.: A taxonomy of encryption scheme security (2004)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/11535218_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R. Pass","year":"2005","unstructured":"Pass, R., Shelat, A.: Unconditional characterizations of non-interactive zero-knowledge. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 118\u2013134. Springer, Heidelberg (2005)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:07Z","timestamp":1605644167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11818175_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}