Errors in Computational Complexity Proofs for Protocols

DOI10.1007/11593447_34MaRDI QIDQ5451094zbMATH OpenOpenAlexFDO

Authors Kim-Kwang Raymond Choo, Yvonne Hitchcock, Colin A. Boyd

Publication date 18 March 2008

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

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

Mathematics Subject Classification ID

Network protocols (68M12) Analysis of algorithms and problem complexity (68Q25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 2086169
• scientific article; zbMATH DE number 1405886
• scientific article; zbMATH DE number 1405638
• How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
• scientific article; zbMATH DE number 1849111

Cited in

(11)

• Communication errors in the \(\pi\)-calculus are undecidable
• Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
• Traceable Privacy of Recent Provably-Secure RFID Protocols
• Timed encryption with application to deniable key exchange
• Automating Computational Proofs for Public-Key-Based Key Exchange
• Chasing diagrams in cryptography
• A security weakness in Abdalla et al.'s generic construction of a group key exchange protocol
• Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode
• Security weakness in a three-party pairing-based protocol for password authenticated key exchange
• On security analysis of an after-the-fact leakage resilient key exchange protocol
• Cryptanalysis of simple three-party key exchange protocol (S-3PAKE)

Describes a project that uses

Uses Software

• HMQV

This page was built for publication: Errors in Computational Complexity Proofs for Protocols

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