{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:53:36Z","timestamp":1773237216114,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_15","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:28:14Z","timestamp":1194964094000},"page":"239-259","source":"Crossref","is-referenced-by-count":143,"title":["OAEP Reconsidered"],"prefix":"10.1007","author":[{"given":"Victor","family":"Shoup","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In Advances in Cryptology-Crypto\u2019 98, pages 26\u201345, 1998.","DOI":"10.1007\/BFb0055718"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"D. Boneh. Simplified OAEP for the RSA and Rabin functions. In Advances in Cryptology-Crypto 2001, 2001.","DOI":"10.1007\/3-540-44647-8_17"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology\u2014Eurocrypt\u2019 94, pages 92\u2013111, 1994.","DOI":"10.1007\/BFb0053428"},{"key":"15_CR5","unstructured":"R. Canetti, O. Goldreich, and S. Halevi. The random oracle model, revisted. In 30th Annual ACM Symposium on Theory of Computing, 1998."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"D. Coppersmith. Finding a small root of a univariate modular equation. In Advances in Cryptology-Eurocrypt\u2019 96, pages 155\u2013165, 1996.","DOI":"10.1007\/3-540-68339-9_14"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In 23rd Annual ACM Symposium on Theory of Computing, pages 542\u2013552, 1991.","DOI":"10.1145\/103418.103474"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM J. Comput., 30(2):391\u2013437, 2000.","journal-title":"SIAM J. Comput."},{"key":"15_CR9","unstructured":"E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP is still alive! Cryptology ePrint Archive, Report 2000\/061, 2000. http:\/\/eprint.iacr.org ."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP is secure under the RSA assumption. In Advances in Cryptology-Crypto 2001, 2001.","DOI":"10.1007\/3-540-44647-8_16"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In 22nd Annual ACM Symposium on Theory of Computing, pages 427\u2013437, 1990.","DOI":"10.1145\/100216.100273"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology-Crypto\u2019 91, pages 433\u2013444, 1991.","DOI":"10.1007\/3-540-46766-1_35"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, pages 120\u2013126, 1978.","DOI":"10.1145\/359340.359342"},{"key":"15_CR14","unstructured":"V. Shoup. OAEP reconsidered. Cryptology ePrint Archive, Report 2000\/060, 2000. http:\/\/eprint.iacr.org ."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:22:14Z","timestamp":1556950934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}