Protocols with security proofs for mobile applications

DOI10.1007/978-3-540-27800-9_31MaRDI QIDQ5315274zbMATH OpenOpenAlexDBLPFDO

Authors Yiu Shing Terry Tin, Harikrishna Vasanta, Colin A. Boyd, Juan Manuel González Nieto

Publication date 7 September 2005

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

Full work available at URL https://doi.org/10.1007/b98755, https://eprints.qut.edu.au/24073/1/protocols_with_security_proofs_for_mobile_applicationsl.pdf

zbMATH Keywords

authenticatormobile securityProvable securitysecure key exchange

Mathematics Subject Classification ID

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

Recommendations

• Provably secure mobile key exchange: Applying the Canetti-Krawczyk approach
• Modular proofs for key exchange: rigorous optimizations in the Canetti-Krawczyk model
• scientific article; zbMATH DE number 3965967
• Efficient Anonymous Roaming and Its Security Analysis
• Key establishment protocols for secure mobile communications: A selective survey

Cited in

(6)

• Modular proofs for key exchange: rigorous optimizations in the Canetti-Krawczyk model
• Efficient Anonymous Roaming and Its Security Analysis
• scientific article; zbMATH DE number 5526621 (Why is no real title available?)
• Protocols using anonymous connections: Mobile applications
• Provably secure mobile key exchange: Applying the Canetti-Krawczyk approach
• On the Connection Between Signcryption and One-Pass Key Establishment

This page was built for publication: Protocols with security proofs for mobile applications

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