Automated verification of group key agreement protocols

Conference item

We advance the state-of-the-art in automated symbolic cryptographic protocol analysis by providing the first algorithm that can handle Diffie-Hellman exponentiation, bilinear pairing, and AC-operators. Our support for AC-operators enables protocol specifications to use multisets, natural numbers, and finite maps. We implement the algorithm in the TAMARIN prover and provide the first symbolic correctness proofs for group key agreement protocols that use Diffie-Hellman or bilinear pairing, loops, and recursion, while at the same time supporting advanced security properties, such as perfect forward secrecy and eCK-security. We automatically verify a set of protocols, including the STR, group Joux, and GDH protocols, thereby demonstrating the effectiveness of our approach.

Authors: Schmidt, B; Sasse, R; Cremers, C; Basin, D

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: IEEE
• Host title: 2014 IEEE Symposium on Security and Privacy
• Journal: 2014 IEEE Symposium on Security and Privacy
• Pages: 179-194
• Publication date: 2014-11-20
• DOI: 10.1109/SP.2014.19
• ISSN: 1081-6011
• ISBN: 9781479946860
• Keywords: SBTMR