{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T12:25:31Z","timestamp":1752668731222},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003243"},{"type":"electronic","value":"9783540362883"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_21","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T20:45:01Z","timestamp":1180903501000},"page":"279-291","source":"Crossref","is-referenced-by-count":7,"title":["A Practical Public Key Cryptosystem from Paillier and Rabin Schemes"],"prefix":"10.1007","author":[{"given":"David","family":"Galindo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e1","family":"Mart\u00fdn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paz","family":"Morillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge L.","family":"Villar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"21_CR1","unstructured":"M. Abdalla, M. Bellare and P. Rogaway. DHAES: An Encryption Scheme Based on the Diffle-Hellman Problem. Submission to IEEE P1363a. (1998) 280"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. ACM CCS 93, ACM Press (1993) 280","DOI":"10.1145\/168588.168596"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-44647-8_17","volume-title":"CRYPTO\u2019 01","author":"D. Boneh","year":"2001","unstructured":"D. Boneh. Simplified OAEP for the RSA and Rabin Functions. CRYPTO\u2019 01, LNCS 2139 275\u2013291(2001). 288"},{"key":"21_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"CRYPTO\u2019 97","author":"R. Canetti","year":"1997","unstructured":"R. Canetti. Towards realizing random oracles: Hash functions that hide all partial information. CRYPTO\u2019 97, LNCS 1294 455\u2013469 (1997). 280"},{"key":"21_CR5","unstructured":"D. Catalano, R. Gennaro, N. Howgrave-Graham and P.Q. Nguyen. Paillier\u2019s Cryptosystem Revisited. ACM CCS\u2019 2001 ACM Press (2001). 279, 280, 281, 283, 289"},{"key":"21_CR6","series-title":"Lect Notes Comput Sci","volume-title":"To appear at Proceedings of ASIACRYPT\u20192002","author":"D. Catalano","year":"2002","unstructured":"D. Catalano, P.Q. Nguyen and J. Stern. The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm. To appear at Proceedings of ASIACRYPT\u20192002. LNCS 2501 (2002). 280, 283, 287, 290"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"EUROCRYPT\u2019 96","author":"D. Coppersmith","year":"1996","unstructured":"D. Coppersmith. Finding a small root of a univariate modular equation. EUROCRYPT\u2019 96, LNCS 1070 155\u2013165 (1996). 289"},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"CRYPTO\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. CRYPTO\u2019 98, LNCS 1462 13\u201325 (1998). 280"},{"key":"21_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"EUROCRYPT\u2019 2002","author":"R. Cramer","year":"2002","unstructured":"R. Cramer and V. Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. EUROCRYPT\u2019 2002, LNCS 2332 45\u201364 (2002). 280"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"O. Goldreich. Foundation of Cryptography-Basic Tools. Cambridge University Press (2001). 282","DOI":"10.1017\/CBO9780511546891"},{"key":"21_CR11","unstructured":"S. Goldwasser and M. Bellare. Lecture Notes on Cryptography. http:\/\/www-cse.ucsd.edu\/users\/mihir 283"},{"issue":"7","key":"21_CR12","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1109\/18.796413","volume":"45","author":"G. Gong","year":"1999","unstructured":"G. Gong and L. Harn. Public-key cryptosystems based on cubic finite field extensions. IEEE Transactions on Information Theory 45(7) 2601\u20132605 (1999) 284","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Golwasser","year":"1984","unstructured":"S. Golwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences 28 270\u2013299 (1984). 290","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"M. Joye and J. J. Quisquater. Cryptanalysis of RSA-type cryptosystems: a visit. Network Threats, DIMACS Series in Discr. Math. ant Th. Comp. Sci., AMS 21\u201331( 1998).","DOI":"10.1090\/dimacs\/038\/03"},{"key":"21_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/3-540-44586-2_3","volume-title":"PKC\u2019 01","author":"K. Kurosawa","year":"2001","unstructured":"K. Kurosawa, W. Ogata, T. Matsuo and S. Makishima. IND-CCA Public Key Schemes Equivalent to Factoring n = pq. PKC\u2019 01, LNCS 1992 36\u201347 (2001). 288"},{"key":"21_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45401-2","volume-title":"PKC\u2019 01","author":"S. M\u00fceller","year":"2001","unstructured":"S. M\u00fceller. On the Security of a Williams Based Public Key Encryption Scheme. PKC\u2019 01, LNCS 1992 1\u201318 (2001) 280"},{"key":"21_CR17","series-title":"Lect Notes Comput Sci","first-page":"81","volume-title":"ICISC\u20192001","author":"M. Nishioka","year":"2001","unstructured":"M. Nishioka, H. Satoh and K. Sakurai. Public Key Cryptosystems Based on a Modular Squaring. ICISC\u20192001, LNCS 2288 81\u2013102 (2001) 288"},{"key":"21_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"EUROCRYPT-98","author":"T. Okamoto","year":"1998","unstructured":"T. Okamoto and S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring. EUROCRYPT-98, LNCS 1403 308\u2013318 (1998) 279, 281"},{"key":"21_CR19","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"EUROCRYPT\u2019 99","author":"P. Paillier","year":"1999","unstructured":"P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. EUROCRYPT\u2019 99, LNCS 1592 223\u2013238 (1999). 280, 281, 283"},{"key":"21_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/BFb0028491","volume-title":"ICICS\u2019 97","author":"J. Patarin","year":"1997","unstructured":"J. Patarin and L. Goubin. Trapdoor One-Way Permutations and Multivariate Polynomials. Extended version of the paper published at ICICS\u2019 97, LNCS 1334 356\u2013368. 281, 284"},{"key":"21_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-46588-1_10","volume-title":"Chosen-Ciphertext Security for any One-Way Cryptosystem","author":"D. Pointcheval","year":"2000","unstructured":"D. Pointcheval. Chosen-Ciphertext Security for any One-Way Cryptosystem. Proc. PKC\u2019 2000 LNCS 1751 129\u2013146 (2000). 280, 281, 288"},{"key":"21_CR22","unstructured":"M.O. Rabin. Digitalized signatures and public key functions as intractable as factorisation. MIT\/LCS\/TR-212 MIT Laboratory for Computer Science (1979) 279, 281, 282"},{"key":"21_CR23","series-title":"Lect Notes Comput Sci","volume-title":"PKC 2002","author":"K. Sakurai","year":"2002","unstructured":"K. Sakurai and T. Takagi. New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive. PKC 2002, LNCS 2274 (2002). 283, 287"},{"key":"21_CR24","unstructured":"H. C.A. van Tilborg. A Professional Reference and Interactive Tutorial. Kluwer Academic Publishers SECS 528 (1999). 283, 285"},{"issue":"6","key":"21_CR25","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"IT-26","author":"H. C. Williams","year":"1980","unstructured":"Williams H. C. A modification of the RSA Public-Key Encryption Procedure. IEEE Trans. Inf. Theory Vol. IT-26, No.6, 726\u2013729 (1980). 279, 281","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:56:20Z","timestamp":1556470580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}