{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:21:26Z","timestamp":1744755686992},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679073"},{"type":"electronic","value":"9783540445982"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_23","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"359-375","source":"Crossref","is-referenced-by-count":37,"title":["The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search"],"prefix":"10.1007","author":[{"given":"Anand","family":"Desai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"23_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Cryptology-Crypto\u2019 98","author":"W. Aiello","year":"1998","unstructured":"W. Aiello, M. Bellare, G. Di Crescenzo and R. Venkatesan, \u201cSecurity amplification by composition: The case of doubly-iterated, ideal ciphers,\u201d Advances in Cryptology-Crypto\u2019 98, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998."},{"doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, E. Jokipii and P. Rogaway, \u201cA concrete security treatment of symmetric encryption,\u201d Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.","key":"23_CR2","DOI":"10.1109\/SFCS.1997.646128"},{"key":"23_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto\u2019 94","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, J. Kilian and P. Rogaway, \u201cThe security of cipher block chaining,\u201d Advances in Cryptology-Crypto\u2019 94, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994."},{"doi-asserted-by":"crossref","unstructured":"M. Bellare and C. Namprempre, \u201cAuthenticated encryption: Relations among notions and analysis of the generic composition paradigm,\u201d Report 2000\/025, Cryptology ePrint Archive, http:\/\/eprint.iacr.org\/ , May 2000.","key":"23_CR4","DOI":"10.1007\/3-540-44448-3_41"},{"doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cRandom oracles are practical: A paradigm for designing efficient protocols,\u201d Proceedings of the 1st Annual Conference on Computer and Communications Security, ACM, 1993.","key":"23_CR5","DOI":"10.1145\/168588.168596"},{"key":"23_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Eurocrypt\u2019 94","author":"M. Bellare","year":"1994","unstructured":"M. Bellare and P. Rogaway, \u201cOptimal asymmetric encryption,\u201d Advances in Cryptology-Eurocrypt\u2019 94, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994"},{"key":"23_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48519-8_17","volume-title":"Fast Software Encryption\u2019 99","author":"M. Bellare","year":"1999","unstructured":"M. Bellare and P. Rogaway, \u201cOn the construction of variable-input-length ciphers,\u201d Fast Software Encryption\u2019 99, Lecture Notes in Computer Science Vol. 1636, L. Knudsen ed., Springer-Verlag, 1999."},{"unstructured":"M. Bellare and P. Rogaway, \u201cEncode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography,\u201d Manuscript, December 1998, available from authors.","key":"23_CR8"},{"unstructured":"D. Blichenbacher and A. Desai, \u201cA construction of super-pseudorandom cipher,\u201d Manuscript, May 1999, available from authors.","key":"23_CR9"},{"key":"23_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto\u2019 99","author":"V. Boyko","year":"1999","unstructured":"V. Boyko, \u201cOn the security properties of OAEP as an all-or-nothing transform, \u201d Advances in Cryptology-Crypto\u2019 99, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., Springer-Verlag, 1999."},{"unstructured":"A. Desai, \u201cThe security of all-or-nothing encryption,\u201d Full version of this paper, available via: http:\/\/www-cse.ucsd.edu\/users\/adesai\/ .","key":"23_CR11"},{"key":"23_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology-Eurocrypt\u2019 00","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz and A. Sahai, \u201cExposure-Resilient Cryptography: Constructions for the All-Or-Nothing Transform without Random Oracles,\u201d Advances in Cryptology-Eurocrypt\u2019 00, Lecture Notes in Computer Science Vol. 1807, B. Preneel ed., Springer-Verlag, 2000."},{"doi-asserted-by":"crossref","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic encryption,\u201d J. of Computer and System Sciences, Vol. 28, April 1984, pp. 270\u2013299.","key":"23_CR13","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"23_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48519-8_8","volume-title":"Fast Software Encryption\u2019 99","author":"M. Jakobsson","year":"1999","unstructured":"M. Jakobsson, J. Stern and M. Yung, \u201cScramble All, Encrypt Small,\u201d Fast Software Encryption\u2019 99, Lecture Notes in Computer Science Vol. 1636, L. Knudsen ed., Springer-Verlag, 1999."},{"unstructured":"D. Johnson, S. Matyas, and M. Peyravian, \u201cEncryption of long blocks using a short-block encryption procedure,\u201d Submission to IEEE P1363a, available via: http:\/\/grouper.ieee.org\/groups\/1363\/contributions\/peyrav.ps , Nov. 1996.","key":"23_CR15"},{"key":"23_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/b75241","volume-title":"Fast Software Encryption\u2019 00","author":"J. Katz","year":"2000","unstructured":"J. Katz and M. Yung, \u201cUnforgeable Encryption and Adaptively Secure Modes of Operation,\u201d Fast Software Encryption\u2019 00, Lecture Notes in Computer Science Vol. ??, B. Schneier ed., Springer-Verlag, 2000."},{"key":"23_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68697-5_20","volume-title":"Advances in Cryptology-Crypto\u2019 96","author":"J. Kilian","year":"1996","unstructured":"J. Kilian and P. Rogaway, \u201cHow to protect DES against exhaustive key search,\u201d Advances in Cryptology-Crypto\u2019 96, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996."},{"unstructured":"National Bureau of Standards, NBS FIPS PUB 81, \u201cDES modes of operation,\u201d U.S Department of Commerce, 1980.","key":"23_CR18"},{"key":"23_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto\u2019 85","author":"J.-J. Quisquater","year":"1985","unstructured":"J.-J. Quisquater, Y. Desmedt and M. Davio, \u201cThe importance of \u201cgood\u201d key scheduling schemes (how to make a secure DES scheme with = 48 bit keys),\u201d Advances in Cryptology-Crypto\u2019 85, Lecture Notes in Computer Science Vol. 218, H. Williams ed., Springer-Verlag, 1985."},{"key":"23_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052348","volume-title":"Software Encryption\u2019 97","author":"R. Rivest","year":"1997","unstructured":"R. Rivest, \u201cAll-or-nothing encryption and the package transform,\u201d Fast Software Encryption\u2019 97, Lecture Notes in Computer Science Vol. 1267, E. Biham ed., Springer-Verlag, 1997."},{"issue":"4","key":"23_CR21","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"C. Shannon, \u201cCommunication theory of secrecy systems,\u201d Bell Systems Technical Journal, Vol. 28, No. 4, 1949, pp. 656\u2013715.","journal-title":"Bell Systems Technical Journal"},{"unstructured":"D. Stinson, \u201cSomething about all-or-nothing (transforms),\u201d Manuscript. Available from: http:\/\/www.cacr.math.uwaterloo.ca\/dstinson\/ , June 1999.","key":"23_CR22"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:34:14Z","timestamp":1556382854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}