A Calculus to Detect Guessing Attacks

DOI10.1007/978-3-642-04474-8_5zbMATH Open1307.94055OpenAlexW2142819718MaRDI QIDQ3399200FDOQ3399200

Authors: Bogdan Groza, M. Minea 

Publication date: 29 September 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04474-8_5

Recommendations

• Logic for Programming, Artificial Intelligence, and Reasoning
• Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
• Foundations of Software Science and Computation Structures
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
• Weakening the perfect encryption assumption in Dolev-Yao adversaries

Mathematics Subject Classification ID

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

Cites Work

• Analysing password protocol security against off-line dictionary attacks
• Foundations of Software Science and Computation Structures
• Logic for Programming, Artificial Intelligence, and Reasoning

Cited In (1)

• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: A Calculus to Detect Guessing Attacks

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