Random polynomial-time attacks and Dolev-Yao models

MaRDI QIDQ5446172zbMATH OpenFDO

Authors Mathieu Baudet

Publication date 6 March 2008

zbMATH Keywords

security protocols

Mathematics Subject Classification ID

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

Recommendations

• A computational interpretation of Dolev-Yao adversaries
• Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
• Limits of the cryptographic realization of Dolev-Yao-style XOR
• Global Computing
• scientific article; zbMATH DE number 7297874

Cited in

(7)

• Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
• Polynomial-time targeted attacks on coin tossing for any number of corruptions
• scientific article; zbMATH DE number 1487486 (Why is no real title available?)
• Global Computing
• A computational interpretation of Dolev-Yao adversaries
• Weakening the perfect encryption assumption in Dolev-Yao adversaries
• Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes

This page was built for publication: Random polynomial-time attacks and Dolev-Yao models

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