Proving Group Protocols Secure Against Eavesdroppers

DOI10.1007/978-3-540-71070-7_9zbMath1165.68320OpenAlexW1885651180MaRDI QIDQ3541693

Steve Kremer, Antoine Mercier, Ralf Treinen

Publication date: 27 November 2008

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Proving Group Protocols Secure Against Eavesdroppers

Cites Work

• Attacking group protocols by refuting incorrect inductive conjectures
• Termination of rewriting
• Visibly Tree Automata with Memory and Constraints
• Proving Group Protocols Secure Against Eavesdroppers
• On the Automatic Analysis of Recursive Security Protocols with XOR
• On the security of public key protocols
• Round-Optimal Contributory Conference Key Agreement
• Advances in Cryptology - CRYPTO 2003
• Tree Automata with Memory, Visibility and Structural Constraints
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Proving Group Protocols Secure Against Eavesdroppers