{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T17:09:45Z","timestamp":1769274585377,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319272382","type":"print"},{"value":"9783319272399","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27239-9_16","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T17:19:50Z","timestamp":1449595190000},"page":"257-274","source":"Crossref","is-referenced-by-count":12,"title":["Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Sk\u00f3rski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,8]]},"reference":[{"key":"16_CR1","unstructured":"A proposal for: Functionality classes for random number generators1, Technical report AIS 30, Bonn, Germany, September 2011. http:\/\/tinyurl.com\/bkwt2wf"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Acharya, J., Orlitsky, A., Suresh, A.T., Tyagi, H.: The complexity of estimating renyi entropy, CoRR abs\/1408.1000 (2014)","DOI":"10.1137\/1.9781611973730.124"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22792-9_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"B Barak","year":"2011","unstructured":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K., Standaert, F.-X., Yu, Y.: Leftover hash lemma, revisited. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 1\u201320. Springer, Heidelberg (2011)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Barker, E.B., Kelsey, J.M.: Sp 800\u201390a recommendation for random number generation using deterministic random bit generators, Technical report, Gaithersburg, MD, United States (2012)","DOI":"10.6028\/NIST.SP.800-90a"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-04766-4_13","volume-title":"Identity and Privacy in the Internet Age","author":"J Bouda","year":"2009","unstructured":"Bouda, J., Krhovjak, J., Matyas, V., Svenda, P.: Towards true random number generation in mobile environments. In: J\u00f8sang, A., Maseng, T., Knapskog, S.J. (eds.) NordSec 2009. LNCS, vol. 5838, pp. 179\u2013189. Springer, Heidelberg (2009)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11545262_11","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"M Bucci","year":"2005","unstructured":"Bucci, M., Luzzi, R.: Design of testable random bit generators. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 147\u2013156. Springer, Heidelberg (2005)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-45238-6_14","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"B Barak","year":"2003","unstructured":"Barak, B., Shaltiel, R., Tromer, E.: True random number generators secure in a changing environment. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 166\u2013180. Springer, Heidelberg (2003)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-69053-0_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"C Cachin","year":"1997","unstructured":"Cachin, C.: Smooth entropy and r\u00e9nyi entropy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 193\u2013208. Springer, Heidelberg (1997)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-49162-7_3","volume-title":"Public Key Cryptography","author":"J-S Coron","year":"1999","unstructured":"Coron, J.-S.: On the security of random sources. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, p. 29. Springer, Heidelberg (1999)"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"JL Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Pointcheval, D., Ruhault, S., Vergniaud, D., Wichs, D.: Security analysis of pseudo-random number generators with input: \/dev\/random is not robust. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, pp. 647\u2013658. ACM, New York (2013)","DOI":"10.1145\/2508859.2516653"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36594-2_1","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2013","unstructured":"Dodis, Y., Yu, Y.: Overcoming weak expectations. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 1\u201322. Springer, Heidelberg (2013)"},{"issue":"2","key":"16_CR13","first-page":"07","volume":"9","author":"A Hoorfar","year":"2008","unstructured":"Hoorfar, A., Hassani, M.: Inequalities on the lambert w function and hyperpower function. J. Inequal. Pure Appl. Math. 9(2), 07\u201315 (2008)","journal-title":"J. Inequal. Pure Appl. Math."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Hstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Proceedings of the 20TH STOC, pp. 12\u201324 (1988)","DOI":"10.1145\/73007.73009"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J Hastad","year":"1999","unstructured":"Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11681878_23","volume-title":"Theory of Cryptography","author":"T Holenstein","year":"2006","unstructured":"Holenstein, T.: Pseudorandom generators from one-way functions: a simple construction for any hardness. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 443\u2013461. Springer, Heidelberg (2006)"},{"key":"16_CR17","unstructured":"Holenstein, T.: On the randomness of repeated experiment"},{"key":"16_CR18","volume-title":"Online Entropy Estimation for Non-Binary Sources and Applications on iPhone","author":"C Lauradoux","year":"2011","unstructured":"Lauradoux, C., Ponge, J., R\u00f6ck, A.: Online Entropy Estimation for Non-Binary Sources and Applications on iPhone. Rapport de recherche, Inria (2011)"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00193563","volume":"5","author":"U Maurer","year":"1992","unstructured":"Maurer, U.: A universal statistical test for random bit generators. J. Cryptology 5, 89\u2013105 (1992)","journal-title":"J. Cryptology"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43\u201352 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"2000","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math. 13, 2000 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Renner, R., Wolf, S.: Smooth renyi entropy and applications. In: Proceedings of the International Symposium on Information Theory, ISIT 2004, p. 232. IEEE (2004)","DOI":"10.1109\/ISIT.2004.1365269"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11593447_11","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"RS Renner","year":"2005","unstructured":"Renner, R.S., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 199\u2013216. Springer, Heidelberg (2005)"},{"issue":"3","key":"16_CR24","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-22012-8_2","volume-title":"Automata, Languages and Programming","author":"R Shaltiel","year":"2011","unstructured":"Shaltiel, R.: An introduction to randomness extractors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 21\u201341. Springer, Heidelberg (2011)"},{"key":"16_CR26","first-page":"250","volume":"2015","author":"J Shikata","year":"2015","unstructured":"Shikata, J.: Design and analysis of information-theoretically secure authentication codes with non-uniformly random keys. IACR Cryptology ePrint Arch. 2015, 250 (2015)","journal-title":"IACR Cryptology ePrint Arch."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Voris, J., Saxena, N., Halevi, T.: Accelerometers and randomness: perfect together. In: Proceedings of the Fourth ACM Conference on Wireless Network Security, WiSec 2011, pp. 115\u2013126. ACM, New York (2011)","DOI":"10.1145\/1998412.1998433"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27239-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T17:51:09Z","timestamp":1748713869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27239-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272382","9783319272399"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27239-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}