{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:34:45Z","timestamp":1648967685702},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T00:00:00Z","timestamp":1308268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s11432-011-4269-9","type":"journal-article","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T22:06:31Z","timestamp":1308348391000},"page":"1827-1836","source":"Crossref","is-referenced-by-count":6,"title":["Paillier\u2019s trapdoor function hides \u0398(n) bits"],"prefix":"10.1007","volume":"54","author":[{"given":"Dong","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KeWei","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,17]]},"reference":[{"key":"4269_CR1","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum M, Micali S. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J Comput, 1984, 13: 850\u2013864","journal-title":"SIAM J Comput"},{"key":"4269_CR2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi W, Chor B, Goldreich O, et al. RSA and rabin functions: certain parts are as hard as the whole. SIAM J Comput, 1988, 17:194\u2013209","journal-title":"SIAM J Comput"},{"key":"4269_CR3","first-page":"25","volume-title":"Proceedings of the 21st ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1989","unstructured":"Goldreich O, Levin L. A hard-core predicate for all one-way functions. In: Johnson D S, ed. Proceedings of the 21st ACM Symposium on Theory of Computing. New York: ACM, 1989. 25\u201332"},{"key":"4269_CR4","first-page":"80","volume-title":"Proceedings of 23rd IEEE Symposium on Fundations of Computer Science","author":"A. C. Yao","year":"1982","unstructured":"Yao A C. Theory and applications of trapdoor functions. In: Pippenger N, ed. Proceedings of 23rd IEEE Symposium on Fundations of Computer Science. Washington D C: IEEE Computer Society, 1982. 80\u201391"},{"key":"4269_CR5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0217021","volume":"17","author":"D. L. Long","year":"1988","unstructured":"Long D L, Wigderson A. The discrete log hides O(log n) bits. SIAM J Comput, 1988, 17: 363\u2013372","journal-title":"SIAM J Comput"},{"key":"4269_CR6","series-title":"LNCS","first-page":"66","volume-title":"Proceedings of Advances in Cryptography \u2014 Eurocrypt\u201985","author":"R. Peralta","year":"1986","unstructured":"Peralta R. Simultaneous security of bits in the discrete log. In: Proceedings of Advances in Cryptography \u2014 Eurocrypt\u201985. LNCS, Vol 219. Berlin: Springer-Verlag, 1986. 66\u201372"},{"key":"4269_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s00145-002-0038-7","volume":"16","author":"O. Goldreich","year":"2003","unstructured":"Goldreich O, Rosen V. On the security of modular exponentiation with application to the construction of pseudorandom generators. J Cryptol, 2003, 16: 71\u201393","journal-title":"J Cryptol"},{"key":"4269_CR8","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/0022-0000(93)90038-X","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"H\u00e5stad J, Schrift A W, Shamir A. The discrete logarithm modulo a composite Hides O(n) bits. J Comput Syst Sci, 1993, 47: 376\u2013404","journal-title":"J Comput Syst Sci"},{"key":"4269_CR9","series-title":"LNCS","first-page":"223","volume-title":"Proceedings of Advances in Cryptography \u2014 Eurocrypt\u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier P. Public-key cryptosystems based on composite degree residuosity class. In: Proceedings of Advances in Cryptography \u2014 Eurocrypt\u201999. LNCS, Vol 1592. Berlin: Springer-Verlag, 1999. 223\u2013238"},{"key":"4269_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00145-002-0112-1","volume":"15","author":"D. Catalano","year":"2002","unstructured":"Catalano D, Gennaro R, Howgrave G N. Paillier\u2019s trapdoor function hides up to O(n) bits. J Cryptol, 2002, 15: 251\u2013269","journal-title":"J Cryptol"},{"key":"4269_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/CBO9780511546891.002","volume-title":"Foundation of Cryptography-Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich O. Foundation of Cryptography-Basic Tools. Cambridge: Cambridge University Press, 2001. 1\u201378"},{"key":"4269_CR12","series-title":"LNCS","first-page":"388","volume-title":"Proceedings of the 13th International Symposium on Fundamentals of Computation Theory, FCT 2001","author":"E. Kiltz","year":"2001","unstructured":"Kiltz E. A primitive for proving the security of every bit and about universal hash functions & hard core bits, full version. In: Proceedings of the 13th International Symposium on Fundamentals of Computation Theory, FCT 2001. LNCS, Vol 2138. Berlin: Springer-Verlag, 2001. 388\u2013391"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4269-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4269-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4269-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:36:12Z","timestamp":1559388972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4269-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,17]]},"references-count":12,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["4269"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4269-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,17]]}}}