A formalization of off-line guessing for security protocol analysis

DOI10.1007/978-3-540-32275-7_24MaRDI QIDQ5705935zbMATH OpenOpenAlexFDO

Authors Paul Hankes Drielsma, Sebastian Mödersheim, Luca Viganò

Publication date 10 November 2005

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

Full work available at URL https://doi.org/10.1007/b106931

Mathematics Subject Classification ID

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

Recommendations

• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
• A Calculus to Detect Guessing Attacks
• Analysing password protocol security against off-line dictionary attacks
• Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
• Off-line password-guessing attacks on the generalized key agreement and password authentication protocol

Cited in

(8)

• Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
• Automated verification of selected equivalences for security protocols
• Analysing password protocol security against off-line dictionary attacks
• A Calculus to Detect Guessing Attacks
• Towards a quantitative analysis of security protocols
• Modeling and reasoning about an attacker with cryptanalytical capabilities
• Formal analysis of PIN block attacks
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks

This page was built for publication: A formalization of off-line guessing for security protocol analysis

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