{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:06:33Z","timestamp":1649203593113},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,6,15]],"date-time":"2014-06-15T00:00:00Z","timestamp":1402790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s12095-014-0101-x","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T06:35:01Z","timestamp":1403159701000},"page":"279-311","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting iterated attacks in the context of decorrelation theory"],"prefix":"10.1007","volume":"6","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","published-online":{"date-parts":[[2014,6,15]]},"reference":[{"key":"101_CR1","unstructured":"Alon, N., Goldreich, O., Mansour, Y.: Almost k-wise independence versus k-wise independence. Electr. Colloq. Comput. Complex. (ECCC) 9(048) (2002)"},{"key":"101_CR2","volume-title":"ASIACRYPT\u201906, Lecture Notes in Computer Science, vol. 4284","author":"T Baign\u00e8res","year":"2006","unstructured":"Baign\u00e8res, T., Finiasz, M.: KFC\u2014the krazy feistel cipher. In: Lai, X., Chen, K. (eds.) ASIACRYPT\u201906, Lecture Notes in Computer Science, vol. 4284. Springer, Berlin (2006)"},{"key":"101_CR3","first-page":"76","volume-title":"SAC\u201906, Lecture Notes in Computer Science, vol. 4356","author":"T Baign\u00e8res","year":"2007","unstructured":"Baign\u00e8res, T., Finiasz, M.: Dial C for cipher. In: Biham, E., Youssef, A.M. (eds.) SAC\u201906, Lecture Notes in Computer Science, vol. 4356, pp 76\u201395. Springer, Berlin (2007)"},{"key":"101_CR4","first-page":"65","volume-title":"SAC\u201905, Lecture Notes in Computer Science, vol. 3897","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.E. (eds.) SAC\u201905, Lecture Notes in Computer Science, vol. 3897, pp 65\u201381. Springer, Berlin (2006)"},{"key":"101_CR5","first-page":"528","volume-title":"INDOCRYPT\u201912, Lecture Notes in Computer Science, vol. 7668","author":"A Bay","year":"2012","unstructured":"Bay, A., Mashatan, A., Vaudenay, S.: Resistance against adaptive plaintext-ciphertext iterated distinguishers. In: Galbraith, S.D., Nandi, M. (eds.) INDOCRYPT\u201912, Lecture Notes in Computer Science, vol. 7668, pp 528\u2013544. Springer, Berlin (2012)"},{"key":"101_CR6","first-page":"741","volume-title":"CRYPTO\u201912, Lecture Notes in Computer Science, vol. 7417","author":"A Bay","year":"2012","unstructured":"Bay, A., Mashatan, A., Vaudenay, S.: Resistance against iterated attacks by Decorrelation revisited. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO\u201912, Lecture Notes in Computer Science, vol. 7417, pp 741\u2013757. Springer, Berlin (2012)"},{"issue":"2","key":"101_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18 (2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"101_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"L Carter","year":"1981","unstructured":"Carter, L., Wegman, M.N.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22 (3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"101_CR9","first-page":"356","volume-title":"EUROCRYPT\u201994, Lecture Notes in Computer Science, vol. 950","author":"F Chabaud","year":"1995","unstructured":"Chabaud, F., Vaudenay, S.: Links between differential and linear cryptoanalysis. In: Santis, A.D. (ed.) EUROCRYPT\u201994, Lecture Notes in Computer Science, vol. 950, pp 356\u2013365. Springer, Berlin (1995)"},{"key":"101_CR10","first-page":"262","volume-title":"INDOCRYPT\u201900, Lecture Notes in Computer Science, vol. 1977","author":"DH Cheon","year":"2000","unstructured":"Cheon, D.H., Lee, S., Lim, J.I., Lee, S.J.: New block cipher DONUT using pairwise perfect decorrelation. In: Roy, B.K., Okamoto, E. (eds.) INDOCRYPT\u201900, Lecture Notes in Computer Science, vol. 1977, pp 262\u2013270. Springer, Berlin (2000)"},{"key":"101_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. JASA 58, 13\u201330 (1963)","journal-title":"JASA"},{"key":"101_CR12","first-page":"17","volume-title":"CRYPTO\u201994, Lecture Notes in Computer Science, vol. 839","author":"SK Langford","year":"1994","unstructured":"Langford, S.K., Hellman, M.E.: Differential-linear cryptanalysis. In: Desmedt, Y. (ed.) CRYPTO\u201994, Lecture Notes in Computer Science, vol. 839, pp 17\u201325. Springer, Berlin (1994)"},{"issue":"4","key":"101_CR13","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15 (4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"101_CR14","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: Pseudo-random permutation generators and cryptographic composition. In: Hartmanis, J. (ed.) STOC\u201986, pp. 356\u2013363. ACM (1986)","DOI":"10.1145\/12130.12167"},{"issue":"2","key":"101_CR15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17 (2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"101_CR16","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. In: Ortiz, H. (ed.) STOC\u201990, pp. 213\u2013223. ACM (1990)","DOI":"10.1145\/100216.100244"},{"key":"101_CR17","first-page":"378","volume-title":"EUROCRYPT\u201991, Lecture Notes in Computer Science, vol. 547","author":"K Nyberg","year":"1991","unstructured":"Nyberg, K.: Perfect nonlinear S-boxes. In: Davies, D.W. (ed.) EUROCRYPT\u201991, Lecture Notes in Computer Science, vol. 547, pp 378\u2013386. Springer, Berlin (1991)"},{"key":"101_CR18","first-page":"254","volume-title":"CARDIS\u201998, Lecture Notes in Computer Science, vol. 1820","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, JJ, Schneier, B (eds.) CARDIS\u201998, Lecture Notes in Computer Science, vol. 1820, pp 254\u2013264. Springer, Berlin (2000)"},{"key":"101_CR19","first-page":"249","volume-title":"STACS\u201998, Lecture Notes in Computer Science, vol. 1373","author":"S Vaudenay","year":"1998","unstructured":"Vaudenay, S.: Provable security for block ciphers by decorrelation. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS\u201998, Lecture Notes in Computer Science, vol. 1373, pp 249\u2013275. Springer, Berlin (1998)"},{"key":"101_CR20","first-page":"1","volume-title":"SAC\u201998, Lecture Notes in Computer Science, vol. 1556","author":"S Vaudenay","year":"1999","unstructured":"Vaudenay, S.: Feistel ciphers with L2-decorrelation. In: Tavares, S.E., Meijer, H. (eds.) SAC\u201998, Lecture Notes in Computer Science, vol. 1556, pp 1\u201314. Springer, Berlin (1999)"},{"key":"101_CR21","first-page":"8","volume-title":"ASIACRYPT\u201999, Lecture Notes in Computer Science, vol. 1716","author":"S Vaudenay","year":"1999","unstructured":"Vaudenay, S.: On the Lai-Massey scheme. In: Lam, K.Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT\u201999, Lecture Notes in Computer Science, vol. 1716, pp 8\u201319. Springer, Berlin (1999)"},{"key":"101_CR22","first-page":"255","volume-title":"EUROCRYPT\u201999, Lecture Notes in Computer Science, vol. 1592","author":"S Vaudenay","year":"1999","unstructured":"Vaudenay, S.: Resistance against general iterated attacks. In: Stern, J. (ed.) EUROCRYPT\u201999, Lecture Notes in Computer Science, vol. 1592, pp 255\u2013271. Springer, Berlin (1999)"},{"key":"101_CR23","first-page":"49","volume-title":"SAC\u201999, Lecture Notes in Computer Science, vol. 1758","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\u201999, Lecture Notes in Computer Science, vol. 1758, pp 49\u201361. Springer, Berlin (2000)"},{"key":"101_CR24","first-page":"1","volume-title":"ICISC\u201999, Lecture Notes in Computer Science, vol. 1787","author":"S Vaudenay","year":"2000","unstructured":"Vaudenay, S.: On probable security for conventional cryptography. In: Song, J. (ed.) ICISC\u201999, Lecture Notes in Computer Science, vol. 1787, pp 1\u201316. Springer, Berlin (2000)"},{"issue":"4","key":"101_CR25","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00145-003-0220-6","volume":"16","author":"S Vaudenay","year":"2003","unstructured":"Vaudenay, S.: Decorrelation: a theory for block cipher security. J. Cryptol. 16 (4), 249\u2013286 (2003)","journal-title":"J. Cryptol."},{"key":"101_CR26","first-page":"156","volume-title":"FSE\u201999, Lecture Notes in Computer Science, vol. 1636","author":"D Wagner","year":"1999","unstructured":"Wagner, D.: The boomerang attack. In: Knudsen, L.R. (ed.) FSE\u201999, Lecture Notes in Computer Science, vol. 1636, pp 156\u2013170. Springer, Berlin (1999)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-014-0101-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-014-0101-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-014-0101-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T14:19:45Z","timestamp":1565533185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-014-0101-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,15]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["101"],"URL":"https:\/\/doi.org\/10.1007\/s12095-014-0101-x","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,15]]}}}