Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption

DOI10.1145/1380572.1380573zbMath1367.94304OpenAlexW1980456975WikidataQ122170141 ScholiaQ122170141MaRDI QIDQ5277813

Michaël Rusinowitch, Mathieu Turuani, Ralf Küsters, Yannick Chevalier

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1380572.1380573

zbMATH Keywords

complexityprotocolsDolev-Yao modelalgebraic propertiesDiffie-Hellman exponentiation

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

State space reduction in the Maude-NRL protocol analyzer ⋮ Satisfiability of general intruder constraints with and without a set constructor

This page was built for publication: Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption