{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:39Z","timestamp":1772283639073,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540432241","type":"print"},{"value":"9783540457602","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45760-7_18","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T16:11:12Z","timestamp":1184947872000},"page":"263-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["GEM: A Generic Chosen-Ciphertext Secure Encryption Method"],"prefix":"10.1007","author":[{"given":"Coron","family":"Jean-S\u00e9bastien","sequence":"first","affiliation":[]},{"given":"Helena","family":"Handschuh","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Joye","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Paillier","sequence":"additional","affiliation":[]},{"given":"David","family":"Pointcheval","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Tymen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,8]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology-CRYPTO\u201998","author":"M. Bellare","year":"1999","unstructured":"Mihir Bellare, Anand Desai, David Pointcheval, and Phillip Rogaway. Relations among notions of security for public-key encryption schemes. Full paper (30 pages), February 1999. An extended abstract appears in H. Krawczyk, ed., Advances in Cryptology-CRYPTO\u201998, volume 1462 of Lecture Notes in Computer Science, pages 26\u201345, Springer-Verlag, 1998."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62\u201373. ACM Press, 1993.","DOI":"10.1145\/168588.168596"},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology-EUROCRYPT\u201994","author":"M. Bellare","year":"1995","unstructured":"Mihir Bellare and Phillip Rogaway. Optimal asymmetric encryption. In A. De Santis, editor, Advances in Cryptology-EUROCRYPT\u201994, volume 950 of Lecture Notes in Computer Science, pages 92\u2013111. Springer-Verlag, 1995."},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-48405-1_32","volume-title":"Advances in Cryptology-CRYPTO\u201999","author":"V. Boyko","year":"1999","unstructured":"Victor Boyko. On the security properties of OAEP as an all-or-nothing transform. Full paper (28 pages), August 1999. An extended abstract appears in M. Wiener, ed., Advances in Cryptology-CRYPTO\u201999, volume 1666 of Lecture Notes in Computer Science, pages 503\u2013518, Springer-Verlag, 1999."},{"issue":"1","key":"18_CR5","first-page":"24","volume":"E83-A","author":"E. Fujisaki","year":"2000","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. How to enhance the security of public-key encryption at minimum cost. IEICE Transaction on of Fundamentals of Electronic Communications and Computer Science\n                           E83-A(1): 24\u201332, January 2000.","journal-title":"IEICE Transaction on of Fundamentals of Electronic Communications and Computer Science"},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology-CRYPTO\u201999","author":"E. Fujisaki","year":"1999","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. Secure integration of asymmetric and symmetric encryption schemes. In M. Wiener, editor, Advances in Cryptology-CRYPTO\u201999, volume 1666 of Lecture Notes in Computer Science, pages 537\u2013554. Springer-Verlag, 1999."},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology-CRYPTO2001","author":"E. Fujisaki","year":"2001","unstructured":"Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, and Jacques Stern. RSAOAEP is secure under the RSA assumption. In J. Kilian, editor, Advances in Cryptology-CRYPTO2001, volume 2139 of Lecture Notes in Computer Science, pages 260\u2013274. Springer-Verlag, 2001."},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BFb0052227","volume-title":"Advances in Cryptology-CRYPTO\u201997","author":"O. Goldreich","year":"1997","unstructured":"Oded Goldreich. On the foundations of modern cryptography. In B. Kaliski, editor, Advances in Cryptology-CRYPTO\u201997, volume 1294 of Lecture Notes in Computer Science, pages 46\u201374. Springer-Verlag, 1997."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. Modern cryptography, probabilistic proofs and pseudo-randomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-662-12521-2"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270\u2013299, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Moni Naor and Moti Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In 22nd ACM Annual Symposium on the Theory of Computing (STOC\u2019 90), pages 427\u2013437. ACM Press, 1990.","DOI":"10.1145\/100216.100273"},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45353-9_13","volume-title":"Topics in Cryptology-CT-RSA 2001","author":"T. Okamoto","year":"2001","unstructured":"Tatsuaki Okamoto and David Pointcheval. REACT: Rapid Enhanced-security Asymmetric Cryptosystem Transform. In D. Naccache, editor, Topics in Cryptology-CT-RSA 2001, volume 2020 of Lecture Notes in Computer Science, pages 159\u2013175. Springer-Verlag, 2001."},{"key":"18_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-46588-1_10","volume-title":"Public Key Cryptography","author":"D. Pointcheval","year":"2000","unstructured":"David Pointcheval. Chosen-ciphertext security for any one-way cryptosystem. In H. Imai and Y. Zheng, editors, Public Key Cryptography, volume 1751 of Lecture Notes in Computer Science, pages 129\u2013146. Springer-Verlag, 2000."},{"key":"18_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology-CRYPTO\u201991","author":"C. Rackoff","year":"1992","unstructured":"Charles Rackoff and Daniel R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, editor, Advances in Cryptology-CRYPTO\u201991, volume 576 of Lecture Notes in Computer Science, pages 433\u2013444. Springer-Verlag, 1992."},{"key":"18_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption","author":"R. L. Rivest","year":"1997","unstructured":"Ronald L. Rivest. All-or-nothing encryption and the package transform. In E. Biham, editor, Fast Software Encryption, volume 1267 of Lecture Notes in Computer Science, pages 210\u2013218. Springer-Verlag, 1997."}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45760-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:22:05Z","timestamp":1558470125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45760-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432241","9783540457602"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45760-7_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"8 February 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}