{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:43:16Z","timestamp":1725529396337},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642004674"},{"type":"electronic","value":"9783642004681"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00468-1_2","type":"book-chapter","created":{"date-parts":[[2009,3,11]],"date-time":"2009-03-11T14:54:35Z","timestamp":1236783275000},"page":"15-33","source":"Crossref","is-referenced-by-count":8,"title":["The Security of All Bits Using List Decoding"],"prefix":"10.1007","author":[{"given":"Paz","family":"Morillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"R\u00e0fols","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving Hard-Core Predicates Using List Decoding. In: Proc. of the 44th Symposium on Foundations of Computer Science (2003)","DOI":"10.1109\/SFCS.2003.1238189"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J.Comp.\u00a017(2) (1988)","DOI":"10.1137\/0217013"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Catalano, D., Gennaro, R., Howgrave-Graham, N.: Paillier\u2019s Trapdoor Function Hides up to O(n) Bits. J.Cryptology\u00a015(4) (2002)","DOI":"10.1007\/s00145-002-0112-1"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Mansour, Y.: Learning Decision Trees Using the Fourier Spectrum. In: Proc. of the 23rd Annual ACM Symposium on Theory of Computing (1991)","DOI":"10.1145\/103418.103466"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Muthukrishnan, S., Strauss, M.: Improved time bounds for near-optimal sparse Fourier representation via sampling. In: Proc. of SPIE Wavelets XI (2005)","DOI":"10.1117\/12.615931"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proc. of the 21st Annual ACM Symposium on Theory of Computing (1989)","DOI":"10.1145\/73007.73010"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Rubinfeld, R., Sudan, M.: Learning Polynomials with Queries: The Highly Noisy Case. SIAM J. Discrete Math.\u00a013(4) (2000)","DOI":"10.1137\/S0895480198344540"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., N\u00e4slund, M.: The security of all RSA and discrete log bits. J. ACM\u00a051(2) (2004)","DOI":"10.1145\/972639.972642"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-68697-5_10","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. N\u00e4slund","year":"1996","unstructured":"N\u00e4slund, M.: All Bits ax+b mod p are Hard. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 114\u2013128. Springer, Heidelberg (1996)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00468-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:12:59Z","timestamp":1558195979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00468-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004674","9783642004681"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00468-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}