{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:37:46Z","timestamp":1765960666971},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162794"},{"type":"electronic","value":"9783642162800"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16280-0_10","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T11:53:05Z","timestamp":1286970785000},"page":"144-165","source":"Crossref","is-referenced-by-count":12,"title":["Distinguishing Distributions Using Chernoff Information"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Baign\u00e8res","sequence":"first","affiliation":[]},{"given":"Pouyan","family":"Sepehrdad","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-39200-9_18","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"L.V. Ahn","year":"2003","unstructured":"Ahn, L.V., Blum, M., Hopper, N.J., Langford, J.: CAPTCHA: Using Hard AI Problems for Security. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 294\u2013311. Springer, Heidelberg (2003)"},{"unstructured":"Baign\u00e8res, T.: Quantitative Security of Block Ciphers: Designs and Cryptanalysis Tools. PhD thesis, EPFL (2008)","key":"10_CR2"},{"unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: Electronic Colloquium on Computational Complexity (2001)","key":"10_CR3"},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does Parallel Repetition Lower the Error in Computationally Sound Protocols. In: Proceedings of the Thirty-Eighth Annual IEEE Symposium on Foundations of Computer Science, pp. 374\u2013383 (1997)","key":"10_CR4","DOI":"10.1109\/SFCS.1997.646126"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00630563","volume":"4","author":"E. Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential Cryptanalysis of DES-like Cryptosystems. Journal of Cryptology\u00a04(1), 3\u201372 (1991)","journal-title":"Journal of Cryptology"},{"unstructured":"Blondeau, C., G\u00e9rard, B.: On the Data Complexity of Statistical Attacks Against Block Ciphers. In: Cryptology ePrint (2009)","key":"10_CR6"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The Decision Diffie-Hellman Problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness Amplification of Weakly Verifiable Puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"10_CR9","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970593","volume-title":"Sequential Analysis and Optimal Design","author":"H. Chernoff","year":"1972","unstructured":"Chernoff, H.: Sequential Analysis and Optimal Design. CBMS-NSF Regional Conference Series in Applied Mathematics, vol.\u00a08. SIAM, Philadelphia (1972)"},{"issue":"2","key":"10_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 on Computing\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-540-85363-3_29","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"K. Chung","year":"2008","unstructured":"Chung, K., Vadhan, S.: Tight Bounds for Hashing Block Sources. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 357\u2013370. Springer, Heidelberg (2008)"},{"key":"10_CR12","series-title":"Wiley Series in Telecommunications","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, Chichester (1991)"},{"doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pfitzmann, B.: Sequential Iteration of Interactive Arguments and an Efficient Zero-knowledge Argument for NP. Technical report, BRICS Report Series, Department of Computer Science, University of Aarhus (1997)","key":"10_CR13","DOI":"10.7146\/brics.v4i50.19271"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00493-002-0001-0","volume":"22","author":"U. Feige","year":"2001","unstructured":"Feige, U., Verbitsky, O.: Error Reduction by Parallel Repetition - A Negative Result. Combinatorica\u00a022, 461\u2013478 (2001)","journal-title":"Combinatorica"},{"key":"10_CR15","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12521-2","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudo-randomness","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudo-randomness. Algorithms and Combinatorics. Springer, Heidelberg (1999)"},{"issue":"301","key":"10_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association\u00a058(301), 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-74143-5_28","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"R. Impagliazzo","year":"2007","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-Type Direct Product Theorems. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 500\u2013516. Springer, Heidelberg (2007)"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-008-9029-7","volume":"22","author":"R. Impagliazzo","year":"2009","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-Type Direct Product Theorems. Journal of Cryptology\u00a022(1), 75\u201392 (2009)","journal-title":"Journal of Cryptology"},{"key":"10_CR19","first-page":"12","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random Generation from One-way Functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 12\u201324. ACM Press, New York (1989)"},{"doi-asserted-by":"crossref","unstructured":"Juta, C.S.: Almost Optimal Bounds for Direct Product Threshold Theorem. Technical report, ECCC (2010)","key":"10_CR20","DOI":"10.1007\/978-3-642-11799-2_3"},{"key":"10_CR21","volume-title":"Theory of Cryptography Conference","author":"C.S. Jutla","year":"2010","unstructured":"Jutla, C.S.: Almost Optimal Bounds for Direct Product Threshold Theorem. In: Theory of Cryptography Conference. Springer, Heidelberg (2010)"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S. Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On Information and Sufficiency. The Annals of Mathematical Statistics\u00a022(1), 79\u201386 (1951)","journal-title":"The Annals of Mathematical Statistics"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-46416-6_2","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"X. Lai","year":"1991","unstructured":"Lai, X., Massey, J.L., Murphy, S.: Markov Ciphers and Differential Cryptanalysis. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 17\u201338. Springer, Heidelberg (1991)"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal of Computing\u00a017, 373\u2013386 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"M. Matsui","year":"1994","unstructured":"Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 386\u2013397. Springer, Heidelberg (1994)"},{"key":"10_CR26","first-page":"134","volume-title":"IEEE Conference Compurt Vision and Pattern Recognition","author":"G. Mori","year":"2003","unstructured":"Mori, G., Malik, J.: Recognising Objects in Adversarial Clutter: Breaking a Visual CAPTCHA. In: IEEE Conference Compurt Vision and Pattern Recognition, pp. 134\u2013141. IEEE CS Press, Los Alamitos (2003)"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-70936-7_5","volume-title":"Theory of Cryptography","author":"K. Pietrzak","year":"2007","unstructured":"Pietrzak, K., Wikstr\u00f6m, D.: Parallel Repetition of Computationally Sound Protocols Revisited. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 86\u2013102. Springer, Heidelberg (2007)"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM Journal on Computing\u00a027, 763\u2013803 (1998)","journal-title":"SIAM Journal on Computing"},{"unstructured":"R\u00e9nyi, A.: On Measures of Information and Entropy. In: Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability, pp. 547\u2013561 (1960)","key":"10_CR29"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MSP.2009.84","volume":"7","author":"J. Yan","year":"2009","unstructured":"Yan, J., Salah, A.: CAPTCHA Security: A Case Study. Journal of IEEE Security and Privacy\u00a07, 22\u201328 (2009)","journal-title":"Journal of IEEE Security and Privacy"},{"issue":"4-5","key":"10_CR31","doi-asserted-by":"publisher","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","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16280-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T12:16:43Z","timestamp":1559737003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16280-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162794","9783642162800"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16280-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}