{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:29:51Z","timestamp":1759336191968,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493007"},{"type":"electronic","value":"9783662493014"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49301-4_31","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T15:15:43Z","timestamp":1458314143000},"page":"497-517","source":"Crossref","is-referenced-by-count":2,"title":["Clever Arbiters Versus Malicious Adversaries"],"prefix":"10.1007","author":[{"given":"Serge","family":"Vaudenay","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,18]]},"reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (Im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-642-14623-7_36","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"M Bellare","year":"2010","unstructured":"Bellare, M., Cash, D.: Pseudorandom functions and permutations provably secure against related-key attacks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 666\u2013684. Springer, Heidelberg (2010)"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-39200-9_31","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Kohno, T.: A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 491\u2013506. Springer, Heidelberg (2003)"},{"key":"31_CR4","unstructured":"Bernstein, D.J.: Private communication (2010)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/3-540-48285-7_34","volume-title":"Advances in Cryptology - EUROCRYPT 1993","author":"E Biham","year":"1994","unstructured":"Biham, E.: New types of cryptanalytic attacks using related keys. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 398\u2013409. Springer, Heidelberg (1994)"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00203965","volume":"7","author":"E Biham","year":"1994","unstructured":"Biham, E.: New types of cryptanalytic attacks using related keys. J. Cryptol. 7, 229\u2013246 (1994)","journal-title":"J. Cryptol."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0020-0190(02)00269-7","volume":"84","author":"E Biham","year":"2002","unstructured":"Biham, E.: How to decrypt or even substitute DES-encrypted messages in 228 steps. Inf. Process. Lett. 84, 117\u2013124 (2002)","journal-title":"Inf. Process. Lett."},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36492-7_6","volume-title":"Selected Areas in Cryptography","author":"J Black","year":"2003","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Encryption-scheme security in the presence of key-dependent messages. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595. Springer, Heidelberg (2003)"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23(4), 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36492-7_17","volume-title":"Selected Areas in Cryptography","author":"S Chow","year":"2003","unstructured":"Chow, S., Eisen, P., Johnson, H., Van Oorschot, P.C.: White-box cryptography and an AES implementation. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595. Springer, Heidelberg (2003)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-44993-5_1","volume-title":"Digital Rights Management","author":"S Chow","year":"2003","unstructured":"Chow, S., Eisen, P., Johnson, H., van Oorschot, P.C.: A white-box DES implementation for DRM applications. In: Feigenbaum, J. (ed.) DRM 2002. LNCS, vol. 2696, pp. 1\u201315. Springer, Heidelberg (2003)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT\u201322","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory IT\u201322, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: Proceedings of the 23rd ACM Symposium on Theory of Computing, New Orleans, pp. 542\u2013552. ACM Press (1991)","DOI":"10.1145\/103418.103474"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. Comput. 30, 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT\u201331","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory IT\u201331, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-21702-9_8","volume-title":"Fast Software Encryption","author":"MR Albrecht","year":"2011","unstructured":"Albrecht, M.R., Farshim, P., Paterson, K.G., Watson, G.J.: On cipher-dependent related-key attacks in the ideal-cipher model. In: Joux, A. (ed.) FSE 2011. LNCS, vol. 6733, pp. 128\u2013145. Springer, Heidelberg (2011)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-11799-2_16","volume-title":"Theory of Cryptography","author":"D Goldenberg","year":"2010","unstructured":"Goldenberg, D., Liskov, M.: On related-secret pseudorandomness. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 255\u2013272. Springer, Heidelberg (2010)"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-00457-5_13","volume-title":"Theory of Cryptography","author":"I Haitner","year":"2009","unstructured":"Haitner, I., Holenstein, T.: On the (Im)Possibility of key dependent encryption. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 202\u2013219. Springer, Heidelberg (2009)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Halevi, S., Krawczyk, H.: Security under key-dependent inputs. In: 14th ACM Conference on Computer and Communications Security, Alexandria, pp. 466\u2013475. ACM Press (2007)","DOI":"10.1145\/1315245.1315303"},{"key":"31_CR20","unstructured":"Harris, D.G.: Generic ciphers are more vulnerable to related-key attacks than previously thought. In: Presented at WCC 2009 (2009)"},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10623-010-9451-3","volume":"59","author":"DG Harris","year":"2011","unstructured":"Harris, D.G.: Critique of the related-key attack concept. Des. Codes Crypt. 59, 159\u2013168 (2011)","journal-title":"Des. Codes Crypt."},{"key":"31_CR22","doi-asserted-by":"publisher","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. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"31_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-70936-7_12","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2007","unstructured":"Hofheinz, D., Malone-Lee, J., Stam, M.: Obfuscation for cryptographic purposes. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 214\u2013232. Springer, Heidelberg (2007)"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Structure in Complexity Theory Conference SCT 1995, Minneapolis, pp. 134\u2013147. IEEE (1995)","DOI":"10.1109\/SCT.1995.514853"},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - AUSCRYPT 1992","author":"LR Knudsen","year":"1993","unstructured":"Knudsen, L.R.: Cryptanalysis of LOKI 91. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718. Springer, Heidelberg (1993)"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-25937-4_23","volume-title":"Fast Software Encryption","author":"S Lucks","year":"2004","unstructured":"Lucks, S.: Ciphers secure against related-key attacks. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 359\u2013370. Springer, Heidelberg (2004)"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Proceedings of the 22nd ACM Symposium on Theory of Computing, Baltimore, pp. 427\u2013437. ACM Press (1990)","DOI":"10.1145\/100216.100273"},{"key":"31_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11761679_20","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"K Pietrzak","year":"2006","unstructured":"Pietrzak, K.: Composition implies adaptive security in minicrypt. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 328\u2013338. Springer, Heidelberg (2006)"},{"key":"31_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-46766-1_19","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"S Rudich","year":"1992","unstructured":"Rudich, S.: The use of interaction in public cryptosystems. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 242\u2013251. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","The New Codebreakers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49301-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T20:58:40Z","timestamp":1748811520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49301-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493007","9783662493014"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49301-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}