{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:06Z","timestamp":1760202606660},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119248"},{"type":"electronic","value":"9783642119255"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11925-5_5","type":"book-chapter","created":{"date-parts":[[2010,2,15]],"date-time":"2010-02-15T07:41:05Z","timestamp":1266219665000},"page":"57-72","source":"Crossref","is-referenced-by-count":5,"title":["Plaintext-Awareness of Hybrid Encryption"],"prefix":"10.1007","author":[{"given":"Shaoquan","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-45353-9_12","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Abdalla","year":"2001","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 143\u2013158. Springer, Heidelberg (2001)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-00468-1_21","volume-title":"Public Key Cryptography 2009","author":"M. Abe","year":"2009","unstructured":"Abe, M., Kiltz, E., Okamoto, T.: Compact CCA-Secure Encryption for Messages of Arbitrary Length. In: Public Key Cryptography 2009. LNCS, vol.\u00a05443, pp. 377\u2013392. Springer, Heidelberg (2009)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-89255-7_22","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"M. Abe","year":"2008","unstructured":"Abe, M., Kiltz, E., Okamoto, T.: Chosen Ciphertext Security with Optimal Ciphertext Overhead. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 355\u2013371. Springer, Heidelberg (2008)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00145-007-9010-x","volume":"21","author":"M. Abe","year":"2008","unstructured":"Abe, M., Gennaro, R., Kurosawa, K.: Tag-KEM\/DEM: A New Framework for Hybrid Encryption. J. Cryptology\u00a021(1), 97\u2013130 (2008)","journal-title":"J. Cryptology"},{"key":"5_CR5","unstructured":"American National Standards Institute (ANSI) X9.F1 subcommittee, ANSI X9.63 Public key cryptography for the Financial Services Industry: Elliptic curve key agreement and key transport schemes, Working draft, January 8 (1999)"},{"key":"5_CR6","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, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"5_CR8","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random Oracle is Practical: A Paradigm for Designing Efficient Protocols. In: Proceedings of the 1st ACM Symposium on Computer and Communication Security, CCS 1993, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0028457","volume-title":"Information and Communications Security","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Rogaway, P.: Minimizing the use of random oracles in authen- ticated encryption schemes. In: Han, Y., Qing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 1\u201316. Springer, Heidelberg (1997)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero knowledge and its applications. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/0-387-34799-2_20","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"M. Blum","year":"1990","unstructured":"Blum, M., Feldman, P., Micali, S.: Proving security against chosen ciphertext attacks. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 256\u2013268. Springer, Heidelberg (1990)"},{"key":"5_CR13","unstructured":"Certicom Research, Standards for Efficient Crpytography Group (SECG) - SEC 1: Elliptic Curve Cryptography. Version 1.0, September 20 (2000)"},{"issue":"16","key":"5_CR14","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.ipl.2009.04.007","volume":"109","author":"S. Choi","year":"2009","unstructured":"Choi, S., Herranz, J., Hofheinz, D., Hwang, J.Y., Kiltz, E., Lee, D.H., Yung, M.: The Kurosawa-Desmedt Key Encapsulation is not Chosen-Ciphertext Secure. Information Processing Letters\u00a0109(16), 897\u2013901 (2009)","journal-title":"Information Processing Letters"},{"key":"5_CR15","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 Journal on Computing\u00a033, 167\u2013226 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/3-540-44598-6_25","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A. Desai","year":"2000","unstructured":"Desai, A.: New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 394\u2013412. Springer, Heidelberg (2000)"},{"key":"5_CR17","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. Dent","year":"2006","unstructured":"Dent, A.: 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":"5_CR18","doi-asserted-by":"crossref","unstructured":"Di Raimondo, M., Gennaro, R., Krawczyk, H.: Deniable Authentication and Key Exchange. In: Proceedings of the 13th ACM Computer and Communication Security, CCS 2006, pp. 400\u2013409 (2006)","DOI":"10.1145\/1180405.1180454"},{"key":"5_CR19","unstructured":"IEEE P1363a Committee, IEEE P1363a, Version D6, November 9, 2000. Standard specifications for public-key cryptography"},{"issue":"2","key":"5_CR20","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.: Probabilitic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/978-3-540-45146-4_32","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Herzog","year":"2003","unstructured":"Herzog, J., Lizkov, M., Micali, S.: Plaintext Awareness via Key Registration. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 548\u2013564. Springer, Heidelberg (2003)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-74143-5_31","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D. Hofheinz","year":"2007","unstructured":"Hofheinz, D., Kiltz, E.: Secure Hybrid Encryption from Weakened Key Encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 553\u2013571. Springer, Heidelberg (2007)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-01001-9_18","volume-title":"EUROCRYPT 2009","author":"D. Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: Practical Chosen Ciphertext Secure Encryption from Factoring. In: EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 313\u2013332. Springer, Heidelberg (2009)"},{"key":"5_CR24","unstructured":"Jiang, S., Wang, H.: Plaintext-Awareness of Hybrid Encryption. Full version of this work, \n                    \n                      http:\/\/sites.google.com\/site\/shaoquan0825"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/978-3-540-28628-8_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Kurosawa","year":"2004","unstructured":"Kurosawa, K., Desmedt, Y.: A New Paradigm of Hybrid Encryption Scheme. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 426\u2013442. Springer, Heidelberg (2004)"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-540-27800-9_21","volume-title":"Information Security and Privacy","author":"K. Kurosawa","year":"2004","unstructured":"Kurosawa, K., Matsuo, T.: How to Remove MAC from DHIES. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol.\u00a03108, pp. 236\u2013247. Springer, Heidelberg (2004)"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-30108-0_21","volume-title":"Computer Security \u2013 ESORICS 2004","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B.: A Public-Key Encryption Scheme with Pseudo-random Ciphertexts. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 335\u2013351. Springer, Heidelberg (2004)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: On the deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 316\u2013337. Springer, Heidelberg (2003)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-540-30564-4_13","volume-title":"Selected Areas in Cryptography","author":"D.H. Phan","year":"2004","unstructured":"Phan, D.H., Pointcheval, D.: About the Security of Ciphers (Semantic Security and Pseudo-Random Permutations). In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 182\u2013197. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology - CT-RSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11925-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:45:27Z","timestamp":1606185927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11925-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119248","9783642119255"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11925-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}