{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:53:38Z","timestamp":1773237218793,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_17","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"275-291","source":"Crossref","is-referenced-by-count":79,"title":["Simplified OAEP for the RSA and Rabin Functions"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare, P. Rogaway, \u201cRandom oracles are practical: a paradigm for designing efficient protocols\u201d, In ACM conference on Computers and Communication Security, pp. 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, P. Rogaway, \u201cOptimal asymmetric encryption\u201d, Eurocrypt\u2019 94, pp. 92\u2013111, 1994.","DOI":"10.1007\/BFb0053428"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, D. Pointcheval, P. Rogaway, \u201cRelations among notions of security for public-key encryption schemes\u201d, in proc. Crypto\u2019 98, pp. 26\u201345, 1998.","DOI":"10.1007\/BFb0055718"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"D. Boneh, R. Venkatesan, \u201cHardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes\u201d, in proc. Crypto\u2019 96, pp. 129\u2013142, 1996.","DOI":"10.1007\/3-540-68697-5_11"},{"key":"17_CR5","unstructured":"R. Canetti, O. Goldreich, S. Halevi, \u201cThe random oracle model, revisited\u201d, in proc. STOC\u2019 98."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"D. Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology, vol. 10, pp. 233\u2013260, 1997.","journal-title":"Journal of Cryptology"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, M. Naor, \u201cNon-malleable cryptography\u201d, SIAM J. of Computing, Vol. 30(2), pp. 391\u2013437, 2000.","journal-title":"SIAM J. of Computing"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"E. Fujisaki, T. Okamoto, D. Pointcheval, J. Stern, \u201cRSA-OAEP is secure under the RSA assumption\u201d, In proc. Crypto\u2019 2001, Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44647-8_16"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"J. Manger, \u201cA chosen ciphertext attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as standardized in PKCS #1\u201d, In proc. Crypto\u2019 2001.","DOI":"10.1007\/3-540-44647-8_14"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"V. Shoup, \u201cOAEP reconsidered\u201d, In proc. Crypto\u2019 2001, Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44647-8_15"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"C. Rackoff, D. Simon, \u201cNon-interactive zero-knowledge proof of knowledge and chosen ciphertext attack\u201d, in proc. Crypto\u2019 91, pp. 433\u2013444, 1991.","DOI":"10.1007\/3-540-46766-1_35"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T10:22:10Z","timestamp":1556965330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}