{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:41Z","timestamp":1766281001989,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_31","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"421-435","source":"Crossref","is-referenced-by-count":24,"title":["On the Impossibility of Private Key Cryptography with Weakly Random Keys"],"prefix":"10.1007","author":[{"given":"James L.","family":"McInnes","sequence":"first","affiliation":[]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"M. Blum, \u201cIndependent unbiased coin flips from a correlated biased source: A finite state Markov chain\u201d, 25th IEEE Sympos. Found. of Comput. Sci., pp. 425\u2013433. 1984.","DOI":"10.1109\/SFCS.1984.715944"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"B. Chor and O. Goldreich. \u201cUnbiased bits from weak sources of randomness and probabilistic communication complexity\u201d, SIAM J. Comput., Vol. 17, No. 2, pp. 230\u2013261. April 1988.","journal-title":"SIAM J. Comput."},{"key":"31_CR3","unstructured":"J. L. McInnes, \u201cCryptography using weak sources of randomness\u201d, Technical Report 194\/87, Dept. of Computer Science, University of Toronto. 1987."},{"key":"31_CR4","first-page":"36","volume":"12","author":"J. Neumann von","year":"1951","unstructured":"J. von Neumann, \u201cVarious techniques used in connection with random digits\u201d (notes by G. E. Forsythe), Applied Math Series, Vol. 12, pp. 36\u201338, 1951; National Bureau of Standards, Washington D.C., reprinted in \u201cCollected Works\u201d, Vol. 5, pp. 768\u2013770, Pergamon, New York, 1963.","journal-title":"Applied Math Series"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. E. Shannon","year":"1949","unstructured":"C. E. Shannon, \u201cCommunication theory of secrecy systems\u201d, Bell Sys. Tech. J., 28, pp. 656\u2013715. 1949.","journal-title":"Bell Sys. Tech. J."},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M. Santha","year":"1986","unstructured":"M. Santha and U. V. Vazirani, \u201cGenerating quasi-random sequences from semirandom sources\u201d, J. Comput. System Sci., 33, pp. 75\u201387. 1986.","journal-title":"J. Comput. System Sci."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"U. V. Vazirani, \u201cTowards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources\u201d, Proc. 17th Annual Symposium on Theory of Computing, pp. 366\u2013378. 1985.","DOI":"10.1145\/22145.22186"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"U. V. Vazirani and V. V. Vazirani, \u201cRandom polynomial time is equal to slightly random polynomial time\u201d, Proc. 26th Annual Symposium of Foundations of Computer Science, pp. 417\u2013428. 1985.","DOI":"10.1109\/SFCS.1985.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:10:54Z","timestamp":1737609054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_31","relation":{},"subject":[]}}