{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:14:39Z","timestamp":1763201679681,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207273"},{"type":"electronic","value":"9783642207280"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20728-0_13","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T09:45:24Z","timestamp":1304588724000},"page":"138-142","source":"Crossref","is-referenced-by-count":22,"title":["Some Notions of Entropy for Cryptography"],"prefix":"10.1007","author":[{"given":"Leonid","family":"Reyzin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-45198-3_18","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B. Barak","year":"2003","unstructured":"Barak, B., Shaltiel, R., Wigderson, A.: Computational Analogues of Entropy. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 200\u2013215. Springer, Heidelberg (2003)"},{"key":"13_CR2","first-page":"785","volume-title":"STOC","author":"N. Chandran","year":"2010","unstructured":"Chandran, N., Kanukurthi, B., Ostrovsky, R., Reyzin, L.: Privacy amplification with asymptotically optimal entropy loss. In: Schulman, L.J. (ed.) STOC, pp. 785\u2013794. ACM Press, New York (2010), Full version available from \n                  \n                    http:\/\/www.cs.bu.edu\/fac\/reyzin\/"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y. Dodis","year":"2007","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM Journal on Computing\u00a038(1), 97\u2013139 (2007); arXiv:cs\/0602007","journal-title":"SIAM Journal on Computing"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: Ravi [Rav08], pp. 293\u2013302 (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"13_CR5","unstructured":"Fuller, B., Reyzin, L.: Computational entropy and information leakage (2011), Available from \n                  \n                    http:\/\/www.cs.bu.edu\/fac\/reyzin"},{"key":"13_CR6","volume-title":"STOC","author":"C. Gentry","year":"2011","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Vadhan, S. (ed.) STOC. ACM, New York (2011)"},{"issue":"4","key":"13_CR7","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.: Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-72540-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"C.-Y. Hsiao","year":"2007","unstructured":"Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 169\u2013186. Springer, Heidelberg (2007)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-01001-9_12","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"B. Kanukurthi","year":"2009","unstructured":"Kanukurthi, B., Reyzin, L.: Key Agreement from Close Secrets over Unsecured Channels. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 206\u2013223. Springer, Heidelberg (2009), Full version available at \n                  \n                    http:\/\/eprint.iacr.org\/2008\/494"},{"issue":"1","key":"13_CR10","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. Journal of Computer and System Sciences\u00a052(1), 43\u201353 (1996)","journal-title":"Journal of Computer and System Sciences"},{"volume-title":"49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008","year":"2008","key":"13_CR11","unstructured":"Ravi, R. (ed.): 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, USA, October 25-28. IEEE Computer Society, Los Alamitos (2008)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Tulsiani, M., Vadhan, S.P.: Dense subsets of pseudorandom sets. In: Ravi [Rav08], pp. 76\u201385 (2008)","DOI":"10.1109\/FOCS.2008.38"},{"key":"13_CR13","unstructured":"Renner, R., Wolf, S.: Smooth R\u00e9nyi entropy and applications. In: Proceedings of IEEE International Symposium on Information Theory, p. 233 (June 2004)"},{"key":"13_CR14","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":"R.S. 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.\u00a03788, pp. 199\u2013216. Springer, Heidelberg (2005)"},{"key":"13_CR15","first-page":"80","volume-title":"23rd Annual Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science, November 3-5, pp. 80\u201391. IEEE, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20728-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:32:30Z","timestamp":1578533550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20728-0_13"}},"subtitle":["(Invited Talk)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207273","9783642207280"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20728-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}