Errors in Computational Complexity Proofs for Protocols

DOI10.1007/11593447_34zbMath1154.68334OpenAlexW2133186418MaRDI QIDQ5451094

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

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

Related Items

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 ⋮ A security weakness in Abdalla et al.'s generic construction of a group key exchange protocol ⋮ Traceable Privacy of Recent Provably-Secure RFID Protocols ⋮ Cryptanalysis of simple three-party key exchange protocol (S-3PAKE) ⋮ Timed encryption with application to deniable key exchange ⋮ Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks ⋮ Chasing Diagrams in Cryptography ⋮ Automating Computational Proofs for Public-Key-Based Key Exchange

Uses Software

• HMQV