{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T17:49:34Z","timestamp":1769017774784,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540629757","type":"print"},{"value":"9783540690535","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_14","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:24:05Z","timestamp":1186363445000},"page":"193-208","source":"Crossref","is-referenced-by-count":17,"title":["Smooth Entropy and R\u00e9nyi Entropy"],"prefix":"10.1007","author":[{"given":"Christian","family":"Cachin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00191318","volume":"5","author":"C. H. Bennett","year":"1992","unstructured":"C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, \u201cExperimental quantum cryptography,\u201d Journal of Cryptology, vol. 5, no. 1, pp. 3\u201328, 1992.","journal-title":"Journal of Cryptology"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C. H. Bennett","year":"1995","unstructured":"C. H. Bennett, G. Brassard, C. Cr\u00e9peau, and U. M. Maurer, \u201cGeneralized privacy amplification,\u201d IEEE Transactions on Information Theory, vol. 41, pp. 1915\u20131923, Nov. 1995.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-39799-X_37","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 85","author":"C. H. Bennett","year":"1986","unstructured":"C. H. Bennett, G. Brassard, and J.-M. Robert, \u201cHow to reduce your enemy\u2019s information,\u201d in Advances in Cryptology \u2014 CRYPTO\u2019 85 (H. C. Williams, ed.), vol. 218 of Lecture Notes in Computer Science, pp. 468\u2013476, Springer-Verlag, 1986."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"C. H. Bennett, G. Brassard, and J.-M. Robert, \u201cPrivacy amplification by public discussion,\u201d SIAM Journal on Computing, vol. 17, pp. 210\u2013229, Apr. 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/235666.235669","volume":"27","author":"G. Brassard","year":"1996","unstructured":"G. Brassard and C. Cr\u00e9peau, \u201c25 years of quantum cryptography,\u201d SIGACT News, vol. 27, no. 3, pp. 13\u201324, 1996.","journal-title":"SIGACT News"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e9peau, \u201cOblivious transfers and privacy amplification.\u201d Proceedings of EUROCRYPT\u2019 97, 1997.","DOI":"10.1007\/3-540-69053-0_23"},{"key":"14_CR7","unstructured":"C. Cachin and U. Maurer, \u201cSmoothing probability distributions and smooth entropy.\u201d Preprint (abstract to appear in Proceedings of International Symposium on Information Theory, ISIT 97), 1997."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman, \u201cUniversal classes of hash functions,\u201d Journal of Computer and System Sciences, vol. 18, pp. 143\u2013154, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. M. Cover","year":"1991","unstructured":"T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, \u201cEfficient cryptographic protocols based on noisy channels.\u201d Proceedings of EUROCRYPT\u2019 97, 1997.","DOI":"10.1007\/3-540-69053-0_21"},{"key":"14_CR11","series-title":"Tech. Rep.","volume-title":"Construction of a pseudorandom generator from any one-way function","author":"J. H\u00e5stad","year":"1991","unstructured":"J. H\u00e5stad, R. Impagliazzo, L. A. Levin, and M. Luby, \u201cConstruction of a pseudorandom generator from any one-way function,\u201d Tech. Rep. 91-068, International Computer Science Institute (ICSI), Berkeley, 1991."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. A. Levin, and M. Luby, \u201cPseudo-random generation from one-way functions,\u201d in Proc. 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 12\u201324, 1989.","DOI":"10.1145\/73007.73009"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"M. Kharitonov, \u201cCryptographic hardness of distribution-specific learning,\u201d in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 372\u2013381, 1993.","DOI":"10.1145\/167088.167197"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"M. Luby, Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.","DOI":"10.1515\/9780691206844"},{"key":"14_CR15","series-title":"Tech. Rep.","volume-title":"Pairwise independence and derandomization","author":"M. Luby","year":"1995","unstructured":"M. Luby and A. Wigderson, \u201cPairwise independence and derandomization,\u201d Tech. Rep. 95-035, International Computer Science Institute (ICSI), Berkeley, 1995."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U. M. Maurer","year":"1993","unstructured":"U. M. Maurer, \u201cSecret key agreement by public discussion from common information,\u201d IEEE Transactions on Information Theory, vol. 39, pp. 733\u2013742, May 1993.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"N. Nisan, \u201cExtracting randomness: How and why \u2014 a survey,\u201d in Proc. 11th Annual IEEE Conference on Computational Complexity, 1996.","DOI":"10.1109\/CCC.1996.507667"},{"key":"14_CR18","first-page":"547","volume":"1","author":"A. R\u00e9nyi","year":"1961","unstructured":"A. R\u00e9nyi, \u201cOn measures of entropy and information,\u201d in Proc. 4th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, (Berkeley), pp. 547\u2013561, Univ. of Calif. Press, 1961.","journal-title":"Proc. 4th Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/18.412679","volume":"41","author":"S. Vembu","year":"1995","unstructured":"S. Vembu and S. Verd\u00fa, \u201cGenerating random bits from an arbitrary source: Fundamental limits,\u201d IEEE Transactions on Information Theory, vol. 41, pp. 1322\u20131332, Sept. 1995.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01940870","volume":"16","author":"D. Zuckerman","year":"1996","unstructured":"D. Zuckerman, \u201cSimulating BPP using a general weak random source,\u201d Algorithmica, vol. 16, pp. 367\u2013391, 1996. Preliminary version presented at 32nd FOCS (1991).","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T16:53:58Z","timestamp":1587833638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1997]]}}}