Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Iolus: a framework for scalable secure multicasting
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Induction = I-axiomatization + first-order consistency
Information and Computation - Special issue on RTA-98
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Using encryption for authentication in large networks of computers
Communications of the ACM
Formalizing GDOI group key management requirements in NPATRL
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Alloy: a lightweight object modelling notation
ACM Transactions on Software Engineering and Methodology (TOSEM)
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Key Distribution and Rekeying Framework with Totally Ordered Multicast Protocols
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
Some attacks upon authenticated group key agreement protocols
Journal of Computer Security - Special issue on CSFW14
New directions in cryptography
IEEE Transactions on Information Theory
Key agreement in ad hoc networks
Computer Communications
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
Formal methods for cryptographic protocol analysis: emerging issues and trends
IEEE Journal on Selected Areas in Communications
The Importance of Non-theorems and Counterexamples in Program Verification
Verified Software: Theories, Tools, Experiments
Active attacking multicast key management protocol using alloy
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Verifying multicast-based security protocols using the inductive method
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
This paper describes the modelling of a two multicast group key management protocols in a firstorder inductive model, and the discovery of previously unknown attacks on them by the automated inductive counterexample finder Coral. These kinds of protocols had not been analysed in a scenario with an active intruder before. Coral proved to be a suitable tool for a job because, unlike most automated tools for discovering attacks, it deals directly with an open-ended model where the number of agents and the roles they play are unbounded. Additionally, Coral's model allows us to reason explicitly about lists of terms in a message, which proved to be essential for modelling the second protocol. In the course of the case studies, we also discuss other issues surrounding multicast protocol analysis, including identifying the goals of the protocol with respect to the intended trust model, modelling of the control conditions, which are considerably more complex than for standard two and three party protocols, and effective searching of the state space generated by the model, which has a much larger branching rate than for standard protocols.