Tackling Adaptive Corruptions in Multicast Encryption Protocols
作者： Saurabh Panjwani
DOI: 10.1007/978-3-540-70936-7_2
关键词:
摘要: We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, who corrupt protocol participants during execution). Our shows if the scheme in is semantically secure, and cycles are absent, then adaptive corruptions achievable via reduction factor of O(n ċ (2n)l), with n l being (respectively) size depth key graph generated any execution. Since, most practical interest, graphs (measured as longest chain ciphertexts form Ɛk1 (k2), Ɛk2 (k3), Ɛk3 (k4), ...) much smaller than their (the total number keys), this gives us powerful tool argue about such protocols, without resorting non-standard techniques (like non-committing encryption). We apply our analysis multicast show variant Logical Key Hierarchy (LKH) secure (its quasi-polynomially related underlying scheme).
springer.com
sci-hub.st 参考文章(23)
Daniele Micciancio, Bogdan Warinschi, Soundness of Formal Encryption in the Presence of Active Adversaries theory of cryptography conference. pp. 133- 151 ,(2004) , 10.1007/978-3-540-24638-1_8
Daniele Micciancio, Saurabh Panjwani, Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption Automata, Languages and Programming. pp. 70- 82 ,(2006) , 10.1007/11787006_7
Aggelos Kiayias, Moti Yung, Self Protecting Pirates and Black-Box Traitor Tracing international cryptology conference. pp. 63- 79 ,(2001) , 10.1007/3-540-44647-8_4
A. Datta, A. Derek, J.C. Mitchell, B. Warinschi, Computationally sound compositional logic for key exchange protocols ieee computer security foundations symposium. pp. 321- 334 ,(2006) , 10.1109/CSFW.2006.9
Donald Beaver, Stuart Haber, Cryptographic protocols provably secure against dynamic adversaries theory and application of cryptographic techniques. pp. 307- 323 ,(1992) , 10.1007/3-540-47555-9_26
Jesper Buus Nielsen, Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case international cryptology conference. pp. 111- 126 ,(2002) , 10.1007/3-540-45708-9_8
Matthew Hennessy, Robin Milner, On Observing Nondeterminism and Concurrency international colloquium on automata, languages and programming. pp. 299- 309 ,(1980) , 10.1007/3-540-10003-2_79
Ran Canetti, Jonathan Herzog, Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols Theory of Cryptography. pp. 380- 403 ,(2006) , 10.1007/11681878_20
Chung Kei Wong, M. Gouda, S.S. Lam, Secure group communications using key graphs IEEE ACM Transactions on Networking. ,vol. 8, pp. 16- 30 ,(2000) , 10.1109/90.836475
Martín Abadi, Bogdan Warinschi, Security analysis of cryptographically controlled access to XML documents symposium on principles of database systems. pp. 108- 117 ,(2005) , 10.1145/1065167.1065182