{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:24:58Z","timestamp":1748384698438},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276588"},{"type":"electronic","value":"9783319276595"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27659-5_7","type":"book-chapter","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T12:33:52Z","timestamp":1451392432000},"page":"100-109","source":"Crossref","is-referenced-by-count":2,"title":["Reducing Public Key Sizes in Bounded CCA-Secure KEMs with Optimal Ciphertext Length"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Yamakawa","sequence":"first","affiliation":[]},{"given":"Shota","family":"Yamada","sequence":"additional","affiliation":[]},{"given":"Takahiro","family":"Matsuda","sequence":"additional","affiliation":[]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[]},{"given":"Noboru","family":"Kunihiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15(2), 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC, pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"key":"7_CR3","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., 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. 4833, pp. 502\u2013518. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR4","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. SIAM J. Comput. 33(1), 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: STOC, pp. 542\u2013552 (1991)","DOI":"10.1145\/103418.103474"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0097-3165(82)90004-8","volume":"33","author":"PL Erd\u00f6s","year":"1982","unstructured":"Erd\u00f6s, P.L., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of two others. J. Comb. Theor. Ser. A 33(2), 158\u2013166 (1982)","journal-title":"J. Comb. Theor. Ser. A"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"PL Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P.L., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of \n                      \n                        \n                      \n                      $$r$$\n                     others. Isr. J. Math. 51, 79\u201389 (1985)","journal-title":"Isr. J. Math."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-27800-9_32","volume-title":"Information Security and Privacy","author":"SD Galbraith","year":"2004","unstructured":"Galbraith, S.D., Hopkins, H.J., Shparlinski, I.E.: Secure bilinear Diffie-Hellman bits. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 370\u2013378. Springer, Heidelberg (2004)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-642-32009-5_47","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"G Hanaoka","year":"2012","unstructured":"Hanaoka, G., Matsuda, T., Schuldt, J.C.N.: On the impossibility of constructing efficient key encapsulation and programmable hash functions in prime order groups. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 812\u2013831. Springer, Heidelberg (2012)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13013-7_1","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"K Haralambiev","year":"2010","unstructured":"Haralambiev, K., Jager, T., Kiltz, E., Shoup, V.: Simple and efficient public-key encryption from computational Diffie-Hellman in the standard model. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 1\u201318. Springer, Heidelberg (2010)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-03356-8_37","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"D Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: The group of signed quadratic residues and applications. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 637\u2013653. Springer, Heidelberg (2009)"},{"key":"7_CR12","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":"Advances in Cryptology - EUROCRYPT 2009","author":"D Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: Practical chosen ciphertext secure encryption from factoring. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 313\u2013332. Springer, Heidelberg (2009)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-29011-4_39","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S Hohenberger","year":"2012","unstructured":"Hohenberger, S., Lewko, A., Waters, B.: Detecting dangerous queries: a new approach for chosen ciphertext security. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 663\u2013681. Springer, Heidelberg (2012)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-19379-8_13","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"Q Mei","year":"2011","unstructured":"Mei, Q., Li, B., Lu, X., Jia, D.: Chosen ciphertext secure encryption under factoring assumption revisited. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 210\u2013227. Springer, Heidelberg (2011)"},{"key":"7_CR15","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":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-18178-8_26","volume-title":"Information Security","author":"M Pereira","year":"2011","unstructured":"Pereira, M., Dowsley, R., Hanaoka, G., Nascimento, A.C.A.: Public key encryption schemes with bounded CCA security and optimal ciphertext length based on the CDH assumption. In: Burmester, M., Tsudik, G., Magliveras, S., Ilic, I. (eds.) ISC 2010. LNCS, vol. 6531, pp. 299\u2013306. Springer, Heidelberg (2011)"},{"key":"7_CR17","unstructured":"Shmuely, Z.: Composite diffie-hellman public-key generating systems are hard to break. Technical report 356, Computer Science Department, Technion, Israel, (1985)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-27954-6_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"S Yamada","year":"2012","unstructured":"Yamada, S., Hanaoka, G., Kunihiro, N.: Two-dimensional representation of cover free families and its applications: short signatures and more. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 260\u2013277. Springer, Heidelberg (2012)"},{"issue":"11","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1984","DOI":"10.1587\/transfun.E93.A.1984","volume":"93\u2013A","author":"S Yamada","year":"2010","unstructured":"Yamada, S., Kawai, Y., Hanaoka, G., Kunihiro, N.: Public key encryption schemes from the (b)cdh assumption with better efficiency. IEICE Trans. 93\u2013A(11), 1984\u20131993 (2010)","journal-title":"IEICE Trans."}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27659-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:38:03Z","timestamp":1559371083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27659-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319276588","9783319276595"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27659-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}