{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:52:19Z","timestamp":1725699139087},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642320088"},{"type":"electronic","value":"9783642320095"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-32009-5_43","type":"book-chapter","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T02:40:28Z","timestamp":1344220828000},"page":"741-757","source":"Crossref","is-referenced-by-count":2,"title":["Resistance against Iterated Attacks by Decorrelation Revisited"],"prefix":"10.1007","author":[{"given":"Asl\u0131","family":"Bay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atefeh","family":"Mashatan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Alon, N., Goldreich, O., Mansour, Y.: Almost k-wise independence versus k-wise independence. Electronic Colloquium on Computational Complexity (ECCC) 9(048) (2002)"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-74462-7_7","volume-title":"Selected Areas in Cryptography","author":"T Baign\u00e8res","year":"2007","unstructured":"Baign\u00e8res, T., Finiasz, M.: Dial \n                  \n                    \n                  \n                  \n$${\\sf C}$$\n\n                 for Cipher. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol. 4356, pp. 76\u201395. Springer, Heidelberg (2007)"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11935230_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"T Baign\u00e8res","year":"2006","unstructured":"Baign\u00e8res, T., Finiasz, M.: \n                  \n                    \n                  \n                  \n$$\\sf {KFC}$$\n\n                 - The Krazy Feistel Cipher. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 380\u2013395. Springer, Heidelberg (2006)"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11693383_5","volume-title":"Selected Areas in Cryptography","author":"T Baign\u00e8res","year":"2006","unstructured":"Baign\u00e8res, T., Vaudenay, S.: Proving the Security of AES Substitution-Permutation Network. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 65\u201381. Springer, Heidelberg (2006)"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/BFb0053450","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 1994","author":"F Chabaud","year":"1995","unstructured":"Chabaud, F., Vaudenay, S.: Links between Differential and Linear Cryptanalysis. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356\u2013365. Springer, Heidelberg (1995)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Carter, L., Wegman, M.N.: Universal Classes of Hash Functions. Journal of Computer and System Sciences 18(2), 143\u2013154 (1979)","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Carter, L., Wegman, M.N.: New Hash Functions and Their Use in Authentication and Set Equality. Journal of Computer and System Sciences 22(3), 265\u2013279 (1981)","DOI":"10.1016\/0022-0000(81)90033-7"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Hoeffding, W.: Probability Inequalities For Sums of Bounded Random Variables (1962)","DOI":"10.2307\/2282952"},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/3-540-39799-X_34","volume-title":"Advances in Cryptology","author":"M Luby","year":"1986","unstructured":"Luby, M., Rackoff, C.: How to Construct Pseudo-random Permutations from Pseudo-random Functions. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, p. 447. Springer, Heidelberg (1986)"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: Pseudo-random Permutation Generators and Cryptographic Composition. In: Hartmanis, J. (ed.) STOC, pp. 356\u2013363. ACM (1986)","DOI":"10.1145\/12130.12167"},{"key":"43_CR11","unstructured":"Luby, M.: A Simple Parallel Alogarithm for the Maxial Independent Set Problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. In: Ortiz, H. (ed.) STOC, pp. 213\u2013223. ACM (1990)","DOI":"10.1145\/100216.100244"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-46416-6_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT \u201991","author":"K Nyberg","year":"1991","unstructured":"Nyberg, K.: Perfect Nonlinear S-Boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378\u2013386. Springer, Heidelberg (1991)"},{"key":"43_CR14","series-title":"LNCS","first-page":"254","volume-title":"CARDIS 1998","author":"G Poupard","year":"2000","unstructured":"Poupard, G., Vaudenay, S.: Decorrelated Fast Cipher: An AES Candidate Well Suited for Low Cost Smart Card applications. In: Quisquater, J.-J., Schneier, B. (eds.) CARDIS 1998. LNCS, vol. 1820, pp. 254\u2013264. Springer, Heidelberg (2000)"},{"key":"43_CR15","series-title":"LNCS","first-page":"1","volume-title":"SAC 1998","author":"S Vaudenay","year":"1999","unstructured":"Vaudenay, S.: Feistel Ciphers with L\n                  \n                    \n                  \n                  \n$${_2}$$\n\n                -Decorrelation. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 1\u201314. Springer, Heidelberg (1999)"},{"key":"43_CR16","series-title":"LNCS","first-page":"249","volume-title":"STACS 1998","author":"S Vaudenay","year":"1998","unstructured":"Vaudenay, S.: Provable Security for Block Ciphers by Decorrelation. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 249\u2013275. Springer, Heidelberg (1998)"},{"key":"43_CR17","series-title":"LNCS","first-page":"1","volume-title":"ICISC 1999","author":"S Vaudenay","year":"2000","unstructured":"Vaudenay, S.: On Probable Security for Conventional Cryptography. In: Song, J.S. (ed.) ICISC 1999. LNCS, vol. 1787, pp. 1\u201316. Springer, Heidelberg (2000)"},{"key":"43_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-48910-X_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT \u201999","author":"S Vaudenay","year":"1999","unstructured":"Vaudenay, S.: Resistance Against General Iterated Attacks. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 255\u2013271. Springer, Heidelberg (1999)"},{"key":"43_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-46513-8_4","volume-title":"Selected Areas in Cryptography","author":"S Vaudenay","year":"2000","unstructured":"Vaudenay, S.: Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol. 1758, pp. 49\u201361. Springer, Heidelberg (2000)"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: Decorrelation: A Theory for Block Cipher Security. J. Cryptology 16(4), 249\u2013286 (2003)","DOI":"10.1007\/s00145-003-0220-6"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32009-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T19:10:26Z","timestamp":1557169826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32009-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320088","9783642320095"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32009-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}