Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks

DOI10.1007/s10817-005-9017-7zbMath1107.68041OpenAlexW2027656737MaRDI QIDQ861696

Florent Jacquemard, Stéphanie Delaune

Publication date: 30 January 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00578855/document

zbMATH Keywords

cryptographic protocolsprotocol insecurity problem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete ⋮ Composition of password-based protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Termination of rewriting
• Tree automata with one memory set constraints and cryptographic protocols
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• On the security of public key protocols
• Mobile values, new names, and secure communication
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Automatic recognition of tractability in inference relations
• Automata, Languages and Programming

This page was built for publication: Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks