{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:48:30Z","timestamp":1725504510343},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785231"},{"type":"electronic","value":"9783540785248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78524-8_24","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T09:18:12Z","timestamp":1203931092000},"page":"427-444","source":"Crossref","is-referenced-by-count":35,"title":["Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One"],"prefix":"10.1007","author":[{"given":"Seung Geol","family":"Choi","sequence":"first","affiliation":[]},{"given":"Dana","family":"Dachman-Soled","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: STOC, pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","first-page":"283","volume-title":"Advances in Cryptology - CRYPTO 1988","author":"M. Bellare","year":"1990","unstructured":"Bellare, M., Halevi, S., Sahai, A., Vadhan, S.P.: Many-to-one trapdoor functions and their relation to public-key cryptosystems. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 283\u2013298. Springer, Heidelberg (1990)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76900-2_31","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R. Cramer","year":"2007","unstructured":"Cramer, R., Hanaoka, G., Hofheinz, D., Imai, H., Kiltz, E., Pass, R., Shelat, A., Vaikuntanathan, V.: Bounded CCA2-secure encryption. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, Springer, Heidelberg (2007)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 207\u2013222. Springer, Heidelberg (2004)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO 1998","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":"24_CR7","series-title":"Lecture Notes in Computer Science","first-page":"45","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R. Cramer","year":"2004","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 45\u201364. Springer, Heidelberg (2004)"},{"issue":"2","key":"24_CR8","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":"24_CR9","unstructured":"Elkind, E., Sahai, A.: A unified methodology for constructing public-key encryption schemes secure against adaptive chosen-ciphertext attack. Cryptology ePrint Archive, Report, \/024, 2002. (2002), http:\/\/eprint.iacr.org\/"},{"issue":"2","key":"24_CR10","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":"24_CR11","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Malkin, T., Myers, S.: Towards a separation of semantic and CCA security for public key encryption. In: TCC, pp. 434\u2013455 (2007)","DOI":"10.1007\/978-3-540-70936-7_24"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Malkin, T., Reingold, O.: On the impossibility of basing trapdoor functions on trapdoor predicates. In: FOCS, pp. 126\u2013135 (2001)","DOI":"10.1109\/SFCS.2001.959887"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"24_CR14","unstructured":"Haitner, I.: Semi-Honest to Malicious Oblivious Transfer - The Black-Box Way. In: These proceedings (2008)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: STOC, pp. 99\u2013108 (2006)","DOI":"10.1145\/1132516.1132531"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"24_CR17","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory (1979)"},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00145-005-0345-x","volume":"19","author":"Y. Lindell","year":"2006","unstructured":"Lindell, Y.: A simpler construction of CCA2-secure public-key encryption under general assumptions. J. Cryptology\u00a019(3), 359\u2013377 (2006)","journal-title":"J. Cryptology"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 52\u201378. Springer, Heidelberg (2007)"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC, pp. 427\u2013437 (1990)","DOI":"10.1145\/100216.100273"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11818175_16","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"R. Pass","year":"2006","unstructured":"Pass, R., Shelat, A., Vaikuntanathan, V.: Construction of a non-malleable encryption scheme from any semantically secure one. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 271\u2013289. Springer, Heidelberg (2006)"},{"key":"24_CR22","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. Cryptology ePrint Archive, Report 2007\/279 (2007), http:\/\/eprint.iacr.org\/"},{"key":"24_CR23","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"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: TCC, pp. 1\u201320 (2004)","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: FOCS, pp. 543\u2013553 (1999)","DOI":"10.1109\/SFFCS.1999.814628"}],"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_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:12:06Z","timestamp":1619521926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785231","9783540785248"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_24","relation":{},"subject":[]}}