{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:55Z","timestamp":1725494455479},"publisher-location":"New York, NY","reference-count":18,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387973173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_12","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"113-127","source":"Crossref","is-referenced-by-count":4,"title":["Sparse Pseudorandom Distributions"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., and Micali, S., \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-Random Bits\u201d, SIAM Jour. on Computing, Vol. 13, 1984, pp. 850\u2013864.","journal-title":"SIAM Jour. on Computing"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. \u201c. Chemoff","year":"1952","unstructured":"Chemoff, H., \u201cA measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations\u201d, Annals of Mathematical Statistics, Vol. 23, 1952, pp. 493\u2013507.","journal-title":"Annals of Mathematical Statistics"},{"key":"12_CR3","unstructured":"Feige, U., M.Sc. Thesis. Weizmann Institute, 1987."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Fortnow, L., \u201cThe Complexity of Perfect Zero-Knowledge\u201d, Proc. of 19th STOC, 1987, pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., S. Goldwasser, and S. Micali, \u201cHow to Construct Random Functions\u201d, Jour. of ACM, Vol. 33, No. 4, 1986, pp. 792\u2013807.","journal-title":"Jour. of ACM"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Krawczyk, H. and Luby, M., \u201cOn the Existence of Pseudorandom Generators\u201d, Proc. of the 29th IEEE Symp. on Foundation of Computer Science, 1988, pp. 12\u201324.","DOI":"10.1109\/SFCS.1988.21917"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., S. Micali, and A. Wigderson, \u201cProofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design\u201d, Proc. 27th FOCS, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., S. Micali, and C. Rackoff, \u201cKnowledge Complexity of Interactive Proofs\u201d, Proc. 17th STOC, 1985, pp. 291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., S. Micali, and C. Rackoff, \u201cKnowledge Complexity of Interactive Proofs\u201d, SIAM Jour. on Computing, Vol. 18, 1989, pp. 186\u2013208.","journal-title":"SIAM Jour. on Computing"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. \u201c. Hoeffding","year":"1963","unstructured":"Hoeffding W., \u201cProbability Inequalities for Sums of Bounded Random Variables\u201d, Journal of the American Statistical Association, Vol. 58, 1963, pp. 13\u201330.","journal-title":"Journal of the American Statistical Association"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., L.A., Levin and M.G. Luby, \u201cPseudo-Random Generation from One-Way Functions\u201d, Proc. 21st STOC, 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"L.A. Levin, \u201cOne-Way Function and Pseudorandom Generators\u201d, Combinatorica, Vol. 7, No. 4, 1987, pp. 357\u2013363.","journal-title":"Combinatorica"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"L. A. Levin, \u201cHomogeneous Measures and Polynomial Time Invariants\u201d, Proc. of the 29th IEEE Symp. on Foundation of Computer Science, 1988, pp. 36\u201341.","DOI":"10.1109\/SFCS.1988.21919"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Rackoff, \u201cHow to Construct Pseudorandom Permutations From Pseudorandom Functions\u201d, SIAM Jour. on Computing, Vol. 17, 1988, pp. 373\u2013386.","journal-title":"SIAM Jour. on Computing"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Nissan, N. and Wigderson, A., \u201cHardness vs. Randomness\u201d, Proc. of the 29th IEEE Symp. on Foundation of Computer Science, 1988, pp. 2\u201311.","DOI":"10.1109\/SFCS.1988.21916"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Oren, Y., \u201cOn the Cunning Power of Cheating Verifiers: Some Observations About Zero-Knowledge Proofs\u201d, Proc. of the 28th IEEE Symp. on Foundation of Computer Science, 1987, pp. 462\u2013471.","DOI":"10.1109\/SFCS.1987.43"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Tompa, M, and H. Woll, \u201cRandom Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information\u201d, Proc. of the 28th IEEE Symp. on Foundation of Computer Science, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C., \u201cTheory and Applications of Trapdoor Functions\u201d, Proc. of the 23rd IEEE Symp. on Foundation of Computer Science, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:28:02Z","timestamp":1619501282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_12","relation":{},"subject":[]}}