{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:15:29Z","timestamp":1748751329462,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_32","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"392-403","source":"Crossref","is-referenced-by-count":0,"title":["How to Smooth Entropy?"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Skorski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"32_CR1","unstructured":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K., Standaert, F.-X., Yu, Y.: Leftover hash lemma, revisited. Cryptology ePrint Archive, Report 2011\/088 (2011). http:\/\/eprint.iacr.org\/"},{"key":"32_CR2","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). http:\/\/dx.doi.org\/10.1007\/978-3-642-04766-4_13"},{"key":"32_CR3","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":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-69053-0_14","volume-title":"Advances in Cryptology - EUROCRYPT 1997","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":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-74735-2_4","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"M Dichtl","year":"2007","unstructured":"Dichtl, M., Goli\u0107, J.D.: High-speed true random number generation with logic gates only. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 45\u201362. Springer, Heidelberg (2007)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-55220-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"Y Dodis","year":"2014","unstructured":"Dodis, Y., Pietrzak, K., Wichs, D.: Key derivation without entropy waste. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 93\u2013110. Springer, Heidelberg (2014)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Hastad, 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":"32_CR8","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). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.35.3930","journal-title":"SIAM J. Comput."},{"key":"32_CR9","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)"},{"issue":"4","key":"32_CR10","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1109\/TIT.2011.2110230","volume":"57","author":"T Holenstein","year":"2011","unstructured":"Holenstein, T., Renner, R.: On the randomness of independent experiments. IEEE Trans. Inf. Theory 57(4), 1865\u20131871 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"32_CR11","unstructured":"Lacharme, P., R\u00f6ck, A., Strubel, V., Videau, M.: The linux pseudorandom number generator revisited. Cryptology ePrint Archive, Report 2012\/251 (2012). http:\/\/eprint.iacr.org\/"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"475","DOI":"10.2307\/1427172","volume":"21","author":"BD McKay","year":"1989","unstructured":"McKay, B.D.: On Littlewood\u2019s estimate for the binomial distribution. Adv. Appl. Probab. 21(2), 475\u2013478 (1989)","journal-title":"Adv. Appl. Probab."},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-30576-7_22","volume-title":"Theory of Cryptography","author":"RS Renner","year":"2005","unstructured":"Renner, R.S., K\u00f6nig, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 407\u2013425. Springer, Heidelberg (2005). http:\/\/dx.doi.org\/10.1007\/978-3-540-30576-7_22"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Renner, R., Wolf, S.: Smooth Renyi entropy and applications. In: ISIT 2004, Chicago, Illinois, USA, p. 232 (2004)","DOI":"10.1109\/ISIT.2004.1365269"},{"key":"32_CR15","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)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Skorski, M.: How much randomness can be extracted from memoryless shannon entropy sources. In: WISA 2015 (2015)","DOI":"10.1007\/978-3-319-31875-2_7"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Schoenmakers, B., Tjoelker, J., Tuyls, P., Verbitskiy, E.: Smooth Renyi entropy of ergodic quantum information sources. In: 2007 IEEE International Symposium on Information Theory. ISIT 2007, pp. 256\u2013260 (2007)","DOI":"10.1109\/ISIT.2007.4557235"},{"key":"32_CR18","unstructured":"Tomamichel, M.: A framework for non-asymptotic quantum information theory. Ph.D. thesis, ETH Zurich (2012)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Watanabe, S., Hayashi, M.: Non-asymptotic analysis of privacy amplification via Renyi entropy and inf-spectral entropy. In: 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2715\u20132719 (2013)","DOI":"10.1109\/ISIT.2013.6620720"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:19:17Z","timestamp":1748744357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}