{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:21:15Z","timestamp":1753600875287,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662464939"},{"type":"electronic","value":"9783662464946"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46494-6_6","type":"book-chapter","created":{"date-parts":[[2015,3,10]],"date-time":"2015-03-10T01:17:58Z","timestamp":1425950278000},"page":"110-133","source":"Crossref","is-referenced-by-count":12,"title":["On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation"],"prefix":"10.1007","author":[{"given":"Chun","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abed, F., List, E., Lucks, S., Wenzel, J.: Differential cryptanalysis of round-reduced simon and speck. In: Fast Software Encryption 2014. LNCS. Springer, Heidelberg (2014) (to appear)","DOI":"10.1007\/978-3-662-46706-0_27"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-40041-4_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E. Andreeva","year":"2013","unstructured":"Andreeva, E., Bogdanov, A., Dodis, Y., Mennink, B., Steinberger, J.P.: On the indifferentiability of key-alternating ciphers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 531\u2013550. Springer, Heidelberg (2013)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-662-43933-3_18","volume-title":"Fast Software Encryption","author":"E. Andreeva","year":"2014","unstructured":"Andreeva, E., Bogdanov, A., Mennink, B.: Towards understanding the known-key security of block ciphers. In: Moriai, S. (ed.) FSE 2013. LNCS, vol.\u00a08424, pp. 348\u2013366. Springer, Heidelberg (2014)"},{"key":"6_CR4","unstructured":"Aysum, A., Gulcan, E., Schaumont, P.: Simon says, break the area records for symmetric key block ciphers on fpgas. Tech. rep., Cryptology ePrint Archive, Report 2014\/237 (2014), http:\/\/eprint.iacr.org"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Barbosa, M., Farshim, P.: The related-key analysis of feistel constructions. In: Fast Software Encryption 2014. LNCS. Springer, Heidelberg (2014) (to appear)","DOI":"10.1007\/978-3-662-46706-0_14"},{"key":"6_CR6","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The simon and speck families of lightweight block ciphers"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-43933-3_1","volume-title":"Fast Software Encryption","author":"A. Biryukov","year":"2014","unstructured":"Biryukov, A., Nikoli\u0107, I.: Complementing feistel ciphers. In: Moriai, S. (ed.) FSE 2013. LNCS, vol.\u00a08424, pp. 3\u201318. Springer, Heidelberg (2014)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Roy, A., Velichkov, V.: Differential analysis of block ciphers simon and speck. In: Fast Software Encryption 2014. LNCS. Springer, Heidelberg (2014) (to appear)","DOI":"10.1007\/978-3-662-46706-0_28"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11799313_21","volume-title":"Fast Software Encryption","author":"J.A. Black","year":"2006","unstructured":"Black, J.A.: The ideal-cipher model, revisited: An uninstantiable blockcipher-based hash function. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 328\u2013340. Springer, Heidelberg (2006)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-13858-4_20","volume-title":"Fast Software Encryption","author":"C. Bouillaguet","year":"2010","unstructured":"Bouillaguet, C., Dunkelman, O., Leurent, G., Fouque, P.-A.: Another look at complementation properties. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol.\u00a06147, pp. 347\u2013364. Springer, Heidelberg (2010)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Boura, C., Naya-Plasencia, M., Suder, V.: Scrutinizing and improving impossible differential attacks: Applications to CLEFIA, Camellia, LBlock and SIMON. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, PART I. LNCS, vol.\u00a08873, pp. 179\u2013199. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-45611-8_10"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J.-S. Coron","year":"2005","unstructured":"Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-damg\u00e5rd revisited: How to construct a hash function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 430\u2013448. Springer, Heidelberg (2005)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85174-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J.-S. Coron","year":"2008","unstructured":"Coron, J.-S., Patarin, J., Seurin, Y.: The random oracle model and the ideal cipher model are equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 1\u201320. Springer, Heidelberg (2008)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-642-38348-9_39","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"G. Demay","year":"2013","unstructured":"Demay, G., Ga\u017ei, P., Hirt, M., Maurer, U.: Resource-restricted indifferentiability. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 664\u2013683. Springer, Heidelberg (2013)"},{"key":"6_CR16","unstructured":"Guo, C., Lin, D.: On the indifferentiability of key-alternating feistel ciphers with no key derivation. Cryptology ePrint Archive, Report 2014\/786 (2014), http:\/\/eprint.iacr.org\/"},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1993636.1993650","volume-title":"Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC 2011","author":"T. Holenstein","year":"2011","unstructured":"Holenstein, T., K\u00fcnzler, R., Tessaro, S.: The equivalence of the random oracle model and the ideal cipher model, revisited. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 89\u201398. ACM, New York (2011)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-42033-7_23","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"R. Lampe","year":"2013","unstructured":"Lampe, R., Seurin, Y.: How to construct an ideal cipher from a small set of public permutations. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol.\u00a08269, pp. 444\u2013463. Springer, Heidelberg (2013)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Lampe, R., Seurin, Y.: Security analysis of key-alternating feistel ciphers. In: Fast Software Encryption 2014. LNCS. Springer, Heidelberg (2014) (to appear)","DOI":"10.1007\/978-3-662-46706-0_13"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","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 Journal on Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-28914-9_16","volume-title":"Theory of Cryptography","author":"A. Mandal","year":"2012","unstructured":"Mandal, A., Patarin, J., Seurin, Y.: On the public indifferentiability and correlation intractability of the 6-round feistel construction. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 285\u2013302. Springer, Heidelberg (2012)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-39200-9_34","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"U. Maurer","year":"2003","unstructured":"Maurer, U., Pietrzak, K.: The security of many-round luby-rackoff pseudo-random permutations. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 544\u2013561. Springer, Heidelberg (2003)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U.M. Maurer","year":"2004","unstructured":"Maurer, U.M., Renner, R.S., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-54303-1_131","volume-title":"EUROCODE \u201990","author":"J. Patarin","year":"1991","unstructured":"Patarin, J.: Pseudorandom permutations based on the D.E.S. scheme. In: Charpin, P., Cohen, G. (eds.) EUROCODE 1990. LNCS, vol.\u00a0514, pp. 193\u2013204. Springer, Heidelberg (1991)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-28628-8_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Patarin","year":"2004","unstructured":"Patarin, J.: Security of random feistel schemes with 5 or more rounds. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 106\u2013122. Springer, Heidelberg (2004)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-20465-4_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"T. Ristenpart","year":"2011","unstructured":"Ristenpart, T., Shacham, H., Shrimpton, T.: Careful with composition: Limitations of the indifferentiability framework. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 487\u2013506. Springer, Heidelberg (2011)"},{"key":"6_CR27","unstructured":"Seurin, Y.: Primitives et protocoles cryptographiques \u00e0s\u00e9curit\u00e9 prouv\u00e9e. Ph.D. thesis, PhD thesis, Universit\u00e9 de Versailles Saint-Quentin-en-Yvelines, France (2009)"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Sun, S., Hu, L., Wang, P., Qiao, K., Ma, X., Song, L.: Automatic security evaluation and (Related-key) differential characteristic search: Application to SIMON, PRESENT, lBlock, DES(L) and other bit-oriented block ciphers. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, PART I. LNCS, vol.\u00a08873, pp. 158\u2013178. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-45611-8_9"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46494-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T19:40:30Z","timestamp":1651434030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46494-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464939","9783662464946"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46494-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}