{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:22Z","timestamp":1725488602233},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_39","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"388-391","source":"Crossref","is-referenced-by-count":6,"title":["A Primitive for Proving the Security of Every Bit and about Universal Hash Functions & Hard Core Bits"],"prefix":"10.1007","author":[{"given":"Eike","family":"Kiltz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"D. Boneh and R. Venkatesan. Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. Proc. of CRYPTO 1996, pages 129\u2013142, 1996.","DOI":"10.1007\/3-540-68697-5_11"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Goldmann and Russell. Spectral bounds on general hard core predicates. In Proc. of STACS, pages 614\u2013625, 2000.","DOI":"10.1007\/3-540-46541-3_51"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. Proc. ofSTOC, pages 25\u201332, 1989.","DOI":"10.1145\/73007.73010"},{"key":"39_CR4","unstructured":"Johan H\u00e5stad and Mats N\u00e4slund. The security of all RSA and discrete log bits. ECCC Report TR99-037, pages 1\u201348, 1999."},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"E. Kiltz. A useful primitive to prove security of every bit and about hard core predicates and universal hash functions (full version). Manuscript, 2001.","DOI":"10.1007\/3-540-44669-9_39"},{"key":"39_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-49264-X_29","volume-title":"Universal hash functions & hard core bits","author":"M. N\u00e4slund","year":"1995","unstructured":"M. N\u00e4slund. Universal hash functions & hard core bits. Lecture Notes in Computer Science, 921:356\u2013366, 1995."},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Mats N\u00e4slund. All bits in ax + b mod p are hard (extended abstract). In Proc. of CRYPTO\u2019 96, pages 114\u2013128, 1996.","DOI":"10.1007\/3-540-68697-5_10"},{"key":"39_CR8","unstructured":"M. I. Gonz\u00e1lez Vasco and M. N\u00e4slund. A survey of hard core functions. Preprint, 2000 (to appear)."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:13:07Z","timestamp":1556748787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}