Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete

DOI10.1016/J.TCS.2013.09.015zbMath1359.94564DBLPjournals/tcs/AdaoMV14OpenAlexW2129038350WikidataQ59196633 ScholiaQ59196633MaRDI QIDQ2453106

Luca Viganò, Pedro Adão, Paulo Mateus

Publication date: 6 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.015

zbMATH Keywords

verificationcomplexitysecurityprotocolsguessing

Mathematics Subject Classification ID

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

Uses Software

• OFMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakening the perfect encryption assumption in Dolev-Yao adversaries
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• On the Security of Ping-Pong Protocols
• On the security of public key protocols
• Global Computing
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete