An algebraic approach to the verification of a class of Diffie-Hellman protocols

DOI10.1007/S10207-007-0013-2MaRDI QIDQ3435341zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Rob Delicata, S. A. Schneider

Publication date 26 April 2007

Published in International Journal of Information Security (Search for Journal in Brave)

Full work available at URL http://epubs.surrey.ac.uk/7236/2/ijis07.pdf

zbMATH Keywords

protocol verificationDiffie-Hellman protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Algebraic Intruder Deductions
• Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
• Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 3965967

Cites work

• scientific article; zbMATH DE number 1583949 (Why is no real title available?)
• scientific article; zbMATH DE number 1088239 (Why is no real title available?)
• scientific article; zbMATH DE number 2081072 (Why is no real title available?)
• scientific article; zbMATH DE number 1759313 (Why is no real title available?)
• scientific article; zbMATH DE number 1406789 (Why is no real title available?)
• Automata, Languages and Programming
• New directions in cryptography
• Protocols for authentification and key establishment

Cited in

(3)

• Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• An algebraic framework for Diffie-Hellman assumptions

This page was built for publication: An algebraic approach to the verification of a class of Diffie-Hellman protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3435341)