{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:47:14Z","timestamp":1746517634675},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329272"},{"type":"electronic","value":"9783642329289"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32928-9_9","type":"book-chapter","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T06:38:30Z","timestamp":1346308710000},"page":"149-165","source":"Crossref","is-referenced-by-count":10,"title":["Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness"],"prefix":"10.1007","author":[{"given":"Steven","family":"Myers","sequence":"first","affiliation":[]},{"given":"Mona","family":"Sergi","sequence":"additional","affiliation":[]},{"given":"abhi","family":"shelat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-30539-2_4","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Palacio, A.: Towards Plaintext-Aware Public-Key Encryption Without Random Oracles. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 48\u201362. Springer, Heidelberg (2004)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-78524-8_24","volume-title":"Theory of Cryptography","author":"S.G. Choi","year":"2008","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 427\u2013444. Springer, Heidelberg (2008)"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","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., et al.: Bounded CCA2-Secure Encryption. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 502\u2013518. Springer, Heidelberg (2007)"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput.\u00a033(1), 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"I. Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.: Towards Practical Public Key Systems Secure against Chosen Ciphertext Attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 445\u2013456. Springer, Heidelberg (1992)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIREV: SIAM Review\u00a045 (2003)","DOI":"10.1137\/S0036144503429856"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/11761679_18","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"A.W. Dent","year":"2006","unstructured":"Dent, A.W.: The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 289\u2013307. Springer, Heidelberg (2006)"},{"key":"9_CR9","unstructured":"Dent, A.W.: The hardness of the DHK problem in the generic group model. IACR Cryptology ePrint Archive\u00a02006, 156 (2006)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 432\u2013450. Springer, Heidelberg (2000)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-19379-8_15","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"T. Matsuda","year":"2011","unstructured":"Matsuda, T., Matsuura, K.: Parallel Decryption Queries in Bounded Chosen Ciphertext Attacks. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 246\u2013264. Springer, Heidelberg (2011)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Myers, S., Shelat, A.: Bit encryption is complete. In: FOCS, pp. 607\u2013616 (2009)","DOI":"10.1109\/FOCS.2009.65"},{"key":"9_CR13","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":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-00457-5_24","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2009","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 403\u2013418. Springer, Heidelberg (2009)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Wee, H.: Black-box, round-efficient secure computation via non-malleability amplification. In: FOCS, pp. 531\u2013540. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.87"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32928-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T06:03:27Z","timestamp":1557209007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32928-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329272","9783642329289"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32928-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}