{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:06:16Z","timestamp":1778789176690,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540245735","type":"print"},{"value":"9783540305767","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_30","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"556-577","source":"Crossref","is-referenced-by-count":65,"title":["Entropic Security and the Encryption of High Entropy Messages"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[]},{"given":"Adam","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple Constructions of Almost k-Wise Independent Random Variables. In: FOCS 1990, pp. 544\u2013553 (1990)","DOI":"10.1109\/FSCS.1990.89575"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/rsa.3240050203","volume":"5","author":"N. Alon","year":"1994","unstructured":"Alon, N., Roichman, Y.: Random Cayley graphs and expanders. Random Structures & Algorithms\u00a05, 271\u2013284 (1994)","journal-title":"Random Structures & Algorithms"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. Bennett","year":"1988","unstructured":"Bennett, C., Brassard, G., Robert, J.: Privacy Amplification by Public Discussion. SIAM J. on Computing\u00a017(2), 210\u2013229 (1988)","journal-title":"SIAM J. on Computing"},{"issue":"6","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C. Bennett","year":"1995","unstructured":"Bennett, C., Brassard, G., Cr\u00e9peau, C., Maurer, U.: Generalized Privacy Amplification. IEEE Transactions on Information Theory\u00a041(6), 1915\u20131923 (1995)","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R.: Towards realizing random oracles: Hash functions that hide all partial information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 455\u2013469. Springer, Heidelberg (1997)"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly One-Way Probabilistic Hash Functions. In: Proc. 30th ACM Symp. on Theory of Computing, pp. 131\u2013140 (1998)","DOI":"10.1145\/276698.276721"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: Proc. IEEE Symp. on Foundations of Computer Science, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley series in telecommunication, p. 542 (1991)","DOI":"10.1002\/0471200611"},{"key":"30_CR9","unstructured":"Dodis, Y., Smith, A.: Entropic Security and the Encryption of High Entropy Messages. Full version of this paper, Available at IACR Cryptology ePrint Archive, report 2004\/219, at http:\/\/eprint.iacr.org\/2004\/219\/"},{"issue":"2","key":"30_CR10","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS\u00a028(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"issue":"1-2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-002-0169-0","volume":"11","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Vadhan, S., Wigderson, A.: On Interactive Proofs with a Laconic Prover. Computational Complexity\u00a011(1-2), 1\u201353 (2002)","journal-title":"Computational Complexity"},{"issue":"4","key":"30_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1","volume":"11","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Wigderson, A.: Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Structures and Algorithms\u00a011(4), 315\u2013343 (1997)","journal-title":"Random Structures and Algorithms"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L., Luby, M.: A Pseudorandom generator from any one-way function. In: Proc. 21st ACM Symp. on Theory of Computing (1989)","DOI":"10.1145\/73007.73009"},{"key":"30_CR14","unstructured":"Herzog, J.: Computational Soundness for Standard Assumptions of Formal Cryptography. Ph.D. Thesis, Massachusetts Institute of Technology (May 2004)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Zuckerman, D.: How to Recycle Random Bits. In: Proc. 30th IEEE Symp. on Foundations of Computer Science (1989)","DOI":"10.1109\/SFCS.1989.63486"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 129\u2013139. Springer, Heidelberg (1994)"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"issue":"1","key":"30_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U. Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. J. Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"J. Cryptology"},{"issue":"3","key":"30_CR19","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: Secret Key Agreement by Public Discussion. IEEE Trans. on Info. Theory\u00a039(3), 733\u2013742 (1993)","journal-title":"IEEE Trans. on Info. Theory"},{"issue":"4","key":"30_CR20","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput.\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"30_CR21","first-page":"43","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is Linear in Space. JCSS\u00a052(1), 43\u201352 (1996)","journal-title":"JCSS"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In: Proc. IEEE Symp. on Security and Privacy, pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Tight bounds for depth-two superconcentrators. In: Proc. 38th IEEE Symp. on Foundations of Computer Science, pp. 585\u2013594 (1997)","DOI":"10.1109\/SFCS.1997.646148"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-46035-7_9","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"A.Y. Russell","year":"2002","unstructured":"Russell, A.Y., Wang, H.: How to fool an unbounded adversary with a short key. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, p. 133. Springer, Heidelberg (2002)"},{"key":"30_CR25","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"Shannon, C.: Communication Theory of Secrecy systems. Bell Systems Technical J.\u00a028, 656\u2013715 (1949); Note: The material in this paper appeared originally in a confidential report \u2018A Mathematical Theory of Cryptography\u2019, dated September 1, 1945, which has now been declassified","journal-title":"Bell Systems Technical J."}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:16:16Z","timestamp":1740240976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}