{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:24:30Z","timestamp":1767338670607},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205920"},{"type":"electronic","value":"9783540400615"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40061-5_2","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:06:00Z","timestamp":1283727960000},"page":"19-36","source":"Crossref","is-referenced-by-count":8,"title":["Some RSA-Based Encryption Schemes with Tight Security Reduction"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","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. 26\u201345. Springer, Heidelberg (1998)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-44647-8_17","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D.: Simplified OAEP for RSA and Rabin Functions. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 275\u2013291. Springer, Heidelberg (2001)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.: Paillier\u2019s cryptosystem revisited. In: The 8th ACM conference on Computer and Communication Security, pp. 206\u2013214 (2001)","DOI":"10.1145\/501983.502012"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-36178-2_19","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"D. Catalano","year":"2002","unstructured":"Catalano, D., Nguyen, P., Stern, J.: The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 299\u2013310. Springer, Heidelberg (2002)"},{"key":"2_CR5","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)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A Practical Public-Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attacks. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"E. Fujisaki","year":"2001","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is Secure under the RSA Assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 260\u2013274. Springer, Heidelberg (2001)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-36288-6_21","volume-title":"Public Key Cryptography - PKC 2003","author":"D. Galindo","year":"2002","unstructured":"Galindo, D., Mollev\u00ed, S., Morillo, P., Villar, J.: A Practical Public Key Cryptosystem from Paillier and Rabin Schemes. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 279\u2013291. Springer, Heidelberg (2002)"},{"key":"2_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Itoh, T., Takeuchi, M.: Public Key Cryptosystem using a Reciprocal Number with the Same Intractability as Factoring a Large Number. In: CRYPTOLOGIA, XII, pp. 225\u2013233 (1988)","DOI":"10.1080\/0161-118891862972"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Takagi, T.: Some RSA-based Encryption Schemes with Tight Security Reduction. A long version of this paper, IACR ePrint archive, 2003\/157 (2003), available from: http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-540-40061-5_2"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44586-2_3","volume-title":"Public Key Cryptography","author":"K. Kurosawa","year":"2001","unstructured":"Kurosawa, K., Ogata, W., Matsuo, T., Makishima, S.: IND-CCA Public Key Schemes Equivalent to Factoring n=pq. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 36\u201347. Springer, Heidelberg (2001)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A New Public-Key Cryptosystem as Secure as Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-48910-X_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"D. Pointcheval","year":"1999","unstructured":"Pointcheval, D.: New Public Key Cryptosystems Based on the Dependent-RSA Problems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 239\u2013254. Springer, Heidelberg (1999)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45664-3_1","volume-title":"Public Key Cryptography","author":"K. Sakurai","year":"2002","unstructured":"Sakurai, K., Takagi, T.: New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 1\u201316. Springer, Heidelberg (2002)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44647-8_15","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"V. Shoup","year":"2001","unstructured":"Shoup, V.: OAEP Reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 239\u2013259. Springer, Heidelberg (2001)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/BFb0052249","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"T. Takagi","year":"1997","unstructured":"Takagi, T.: Fast RSA-Type Cryptosystems using N-adic Expansion. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 372\u2013384. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40061-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T21:20:31Z","timestamp":1559596831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40061-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205920","9783540400615"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40061-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}