{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:09Z","timestamp":1747104189294},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540420705"},{"type":"electronic","value":"9783540449874"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44987-6_15","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T13:46:47Z","timestamp":1186840007000},"page":"229-243","source":"Crossref","is-referenced-by-count":20,"title":["The Bit Security of Paillier\u2019s Encryption Scheme and Its Applications"],"prefix":"10.1007","author":[{"given":"Dario","family":"Catalano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Howgrave-Graham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,15]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich and C. Schnorr. RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Computing, 17(2):194\u2013209, April 1988.","journal-title":"SIAM J. Computing"},{"key":"15_CR2","unstructured":"J.C. Benaloh. Verifiable Secret-Ballot Elections. Ph.D. Thesis, Yale University, 1988."},{"key":"15_CR3","series-title":"Lect Notes Comput Sci","first-page":"289","volume-title":"An efficient probabilistic public-key encryption scheme which hides all partial information","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Goldwasser. An efficient probabilistic public-key encryption scheme which hides all partial information. Proc. of Crypto '84, LNCS vol. 196, pages 289\u2013302"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing, Vol. 13, No. 4:850\u2013864, 1984","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s001459910008","volume":"13","author":"R. Fischlin","year":"2000","unstructured":"R. Fischlin and C.P. Schnorr. Stronger Security Proofs for RSA and Rabin Bits. J. of Cryptology, 13(2):221\u2013244, Spring 2000.","journal-title":"J. of Cryptology"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin A hard-core predicate for all one-way functions. Proc. 21 st ACM Symposium on Theory of Computing, 1989","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"15_CR7","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, 28(2):270\u2013299, April 1984.","journal-title":"JCSS"},{"key":"15_CR8","first-page":"376","volume":"47","author":"J. Hastad","year":"1993","unstructured":"J. Hastad, A. W. Schrift and A. Shamir. The Discrete Logarithm Modulo a Composite Hides O(n) Bits. JCSS Vol. 47, pages 376\u2013404, 1993.","journal-title":"JCSS"},{"key":"15_CR9","series-title":"Lect Notes Comput Sci","first-page":"308","volume-title":"Advances in Cryptology-Eurocrypt '97","author":"T. Okamoto","year":"1997","unstructured":"T. Okamoto and S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring In Advances in Cryptology-Eurocrypt '97, LNCS vol. 1233, Springer, 1997, pages 308\u2013318."},{"key":"15_CR10","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Advances in Cryptology-Eurocrypt '99","author":"P. Paillier","year":"1997","unstructured":"P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology-Eurocrypt '99, LNCS vol. 1592, Springer, 1997, pages 223\u2013238."},{"key":"15_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0055737","volume-title":"Advances in Cryptology-CRYPTO '98","author":"S. Patel","year":"1998","unstructured":"S. Patel and G. S. Sundaram. An Efficient Discrete Log Pseudo Random Generator. In Advances in Cryptology-CRYPTO '98, LNCS vol. 1492, Springer, 1998, pages 304\u2013315."},{"key":"15_CR12","unstructured":"M. Rabin. Digital Signatures and Public Key Encryptions as Intractable as Factorization. MITT echnical Report no. 212, 1979"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir and L. Adelman. A Method for Obtaining Digital Signature and Public Key Cryptosystems. Comm. of ACM, 21 (1978), pp. 120\u2013126","journal-title":"Comm. of ACM"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"A. Yao. Theory and Applications of Trapdoor Functions. IEEE FOCS, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44987-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:23:21Z","timestamp":1556753001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44987-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540420705","9783540449874"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44987-6_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}