A Calculus to Detect Guessing Attacks

DOI10.1007/978-3-642-04474-8_5MaRDI QIDQ3399200zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

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)