{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:11Z","timestamp":1725565391437},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144950"},{"type":"electronic","value":"9783642144967"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14496-7_6","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T07:51:35Z","timestamp":1284105095000},"page":"56-73","source":"Crossref","is-referenced-by-count":2,"title":["On the Security of Pseudorandomized Information-Theoretically Secure Schemes"],"prefix":"10.1007","author":[{"given":"Koji","family":"Nuida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0022-0000(91)90038-7","volume":"42","author":"E. Bach","year":"1991","unstructured":"Bach, E.: Realistic analysis of some randomized algorithms. Journal of Computer and System Sciences\u00a042, 30\u201353 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-85093-9_17","volume-title":"Information Theoretic Security","author":"O. Billet","year":"2008","unstructured":"Billet, O., Phan, D.H.: Efficient traitor tracing from collusion secure codes. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol.\u00a05155, pp. 171\u2013182. Springer, Heidelberg (2008)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-540-74208-1_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I. Binder","year":"2007","unstructured":"Binder, I., Braverman, M.: Derandomization of Euclidean random walks. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 353\u2013365. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of 1979 National Computer Conference. AFIPS Proceedings, vol.\u00a048, pp. 313\u2013317 (1979)","key":"6_CR4","DOI":"10.1109\/MARK.1979.8817296"},{"key":"6_CR5","first-page":"425","volume-title":"Proceedings of 25th FOCS","author":"M. Blum","year":"1984","unstructured":"Blum, M.: Independent unbiased coin flips from a correlated biased source: A finite state Markov chain. In: Proceedings of 25th FOCS, pp. 425\u2013433. IEEE, Los Alamitos (1984)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory\u00a044, 1897\u20131905 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70936-7_1","volume-title":"Theory of Cryptography","author":"C. Bosley","year":"2007","unstructured":"Bosley, C., Dodis, Y.: Does privacy require true randomness? In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 1\u201320. Springer, Heidelberg (2007)"},{"key":"6_CR8","first-page":"74","volume-title":"Proceedings of 48th FOCS","author":"Q. Cheng","year":"2007","unstructured":"Cheng, Q.: Derandomization of sparse cyclotomic integer zero testing. In: Proceedings of 48th FOCS, pp. 74\u201380. IEEE, Los Alamitos (2007)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B. Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 257\u2013270. Springer, Heidelberg (1994)"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal of Computing\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"6_CR11","first-page":"711","volume-title":"Proceedings of STOC 2006","author":"B. Dubrov","year":"2006","unstructured":"Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: Proceedings of STOC 2006, pp. 711\u2013720. ACM, New York (2006)"},{"key":"6_CR12","first-page":"196","volume-title":"Proceedings of 45th FOCS","author":"Y. Dodis","year":"2004","unstructured":"Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: Proceedings of 45th FOCS, pp. 196\u2013205. IEEE, Los Alamitos (2004)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-71677-8_28","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"R.R. Farashahi","year":"2007","unstructured":"Farashahi, R.R., Schoenmakers, B., Sidorenko, A.: Efficient pseudorandom generators based on the DDH assumption. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 426\u2013441. Springer, Heidelberg (2007)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 480\u2013491. Springer, Heidelberg (1994)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-24676-3_26","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y. Ishai","year":"2004","unstructured":"Ishai, Y., Kushilevits, E.: On the hardness of information-theoretic multiparty computation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 439\u2013455. Springer, Heidelberg (2004)"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/18.841170","volume":"46","author":"A. Juels","year":"2000","unstructured":"Juels, A., Jakobsson, M., Shriver, E., Hillyer, B.K.: How to turn loaded dice into fair coins. IEEE Transactions on Information Theory\u00a046(3), 911\u2013921 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/11538462_30","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"E. Kaplan","year":"2005","unstructured":"Kaplan, E., Naor, M., Reingold, O.: Derandomized constructions of k-wise (Almost) independent permutations. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 354\u2013365. Springer, Heidelberg (2005)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/3-540-46035-7_30","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"A. Kiayias","year":"2002","unstructured":"Kiayias, A., Yung, M.: Traitor tracing with constant transmission rate. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 450\u2013465. Springer, Heidelberg (2002)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BFb0052244","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"U. Maurer","year":"1997","unstructured":"Maurer, U., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 307\u2013321. Springer, Heidelberg (1997)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/3-540-38424-3_31","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"J.L. McInnes","year":"1991","unstructured":"McInnes, J.L., Pinkas, B.: On the impossibility of private key cryptography with weakly random keys. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 421\u2013435. Springer, Heidelberg (1991)"},{"key":"6_CR21","first-page":"36","volume":"12","author":"J. Neumann Von","year":"1951","unstructured":"Von Neumann, J.: Various techniques for use in connection with random digits. National Bureau of Standards, Applied Mathematics Series\u00a012, 36\u201338 (1951)","journal-title":"National Bureau of Standards, Applied Mathematics Series"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF01275488","volume":"3","author":"R. Peralta","year":"1993","unstructured":"Peralta, R., Shoup, V.: Primality testing with fewer random bits. Computational Complexity\u00a03, 355\u2013367 (1993)","journal-title":"Computational Complexity"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-45146-4_5","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Renner","year":"2003","unstructured":"Renner, R., Wolf, S.: Unconditional authenticity and privacy from an arbitrary weak secret. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 78\u201395. Springer, Heidelberg (2003)"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M. Santha","year":"1986","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences\u00a033, 75\u201387 (1986)","journal-title":"Journal of Computer and System Sciences"},{"issue":"11","key":"6_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1980","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022(11), 612\u2013613 (1980)","journal-title":"Communications of the ACM"},{"key":"6_CR26","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"Shannon, C.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028, 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"6_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1346330.1346335","volume":"55","author":"G. Tardos","year":"2008","unstructured":"Tardos, G.: Optimal probabilistic fingerprint codes. Journal of the ACM\u00a055(2), 1\u201324 (2008)","journal-title":"Journal of the ACM"},{"key":"6_CR28","first-page":"417","volume-title":"Proceedings of 26th FOCS","author":"U.V. Vazirani","year":"1985","unstructured":"Vazirani, U.V., Vazirani, V.V.: Random polynomial time is equal to slightly-random polynomial time. In: Proceedings of 26th FOCS, pp. 417\u2013428. IEEE, Los Alamitos (1985)"},{"issue":"4\/5","key":"6_CR29","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01940870","volume":"16","author":"D. Zuckerman","year":"1996","unstructured":"Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica\u00a016(4\/5), 367\u2013391 (1996)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14496-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:28:08Z","timestamp":1619771288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14496-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144950","9783642144967"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14496-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}