{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:39:31Z","timestamp":1743057571877,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137075"},{"type":"electronic","value":"9783642137082"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13708-2_1","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T07:56:06Z","timestamp":1277279766000},"page":"1-18","source":"Crossref","is-referenced-by-count":7,"title":["On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption"],"prefix":"10.1007","author":[{"given":"Aur\u00e9lie","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Jean-S\u00e9bastien","family":"Coron","sequence":"additional","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Vergnaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-45022-X_42","volume-title":"Automata, Languages and Programming","author":"O. Baudron","year":"2000","unstructured":"Baudron, O., Pointcheval, D., Stern, J.: Extended notions of security for multicast public key cryptosystems. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 499\u2013511. Springer, Heidelberg (2000)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, A., Coron, J.-S., Naccache, D., Tibouchi, M., Vergnaud, D.: On the broadcast and validity-checking security of pkcs#1 v1.5 encryption. Full version of this paper. Cryptology ePrint Archive, Report 2010\/135, \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-13708-2_1"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting: Security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 259\u2013274. Springer, Heidelberg (2000)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","first-page":"549","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. 549\u2013570. Springer, Heidelberg (1998)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D. Bleichenbacher","year":"1998","unstructured":"Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the rsa encryption standard. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. Journal of Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"Journal of Cryptology"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/3-540-39799-X_40","volume-title":"Advances in Cryptology","author":"Y. Desmedt","year":"1986","unstructured":"Desmedt, Y., Odlyzko, A.M.: A chosen text attack on the rsa cryptosystem and some discrete logarithm schemes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 516\u2013522. Springer, Heidelberg (1986)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45539-6_25","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"J.-S. Coron","year":"2000","unstructured":"Coron, J.-S., Naccache, D., Joye, M., Paillier, P.: New attacks on pkcs#1 v1.5 encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 369\u2013381. Springer, Heidelberg (2000)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-45708-9_15","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.-S. Coron","year":"2002","unstructured":"Coron, J.-S., Naccache, D., Joye, M., Paillier, P.: Universal Padding Schemes for rsa. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 226\u2013241. Springer, Heidelberg (2002)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00145-002-0204-y","volume":"17","author":"E. Fujisaki","year":"2004","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: rsa-oaep is secure under the rsa assumption. Journal of Cryptology\u00a017(2), 81\u2013104 (2004)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J. H\u00e5stad","year":"1988","unstructured":"H\u00e5stad, J.: Solving simultaneous modular equations of low degree. siam Journal on Computing\u00a017(2), 336\u2013341 (1988)","journal-title":"siam Journal on Computing"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Cryptography and Coding","author":"N. Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 131\u2013142. Springer, Heidelberg (1997)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11935230_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"E. Jochemsz","year":"2006","unstructured":"Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking rsa variants. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 267\u2013282. Springer, Heidelberg (2006)"},{"key":"1_CR15","unstructured":"Kaliski, B.: pkcs#1: rsa Encryption Standard, Version 1.5, rsa Laboratories (November 1993)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kaliski, B.: pkcs#1: rsa Encryption Standard, Version 2.0, rsa Laboratories (September 1998)","DOI":"10.17487\/rfc2313"},{"key":"1_CR17","unstructured":"Kaliski, B.: rsa Laboratories, personal communication (October 2009)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e0sz, L.: Factoring polynomials with rational coefficients. Math. Annalen\u00a0261, 513\u2013534 (1982)","journal-title":"Math. Annalen"},{"key":"1_CR19","series-title":"Advanced courses in mathematics","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-7643-7394-6_4","volume-title":"Contemporary cryptology","author":"D. Pointcheval","year":"2005","unstructured":"Pointcheval, D.: Provable security for public-key schemes. In: Contemporary cryptology. Advanced courses in mathematics, pp. 133\u2013190. Birkh\u00e4user, Basel (2005)"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the acm\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the acm"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13708-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:09:35Z","timestamp":1558278575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13708-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137075","9783642137082"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13708-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}