The ephemeral pairing problem

DOI10.1007/978-3-540-27809-2_22MaRDI QIDQ4680926zbMATH OpenOpenAlexFDO

Authors Jaap-Henk Hoepman

Publication date 13 June 2005

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Secure Communications over Insecure Channels Based on Short Authenticated Strings
• Authenticating ad hoc networks by comparison of short digests
• Robust self-keying mobile ad hoc networks
• Pairwise key agreement protocols based on the Weil pairing
• Foundations of Security Analysis and Design II

Cited in

(4)

• Authenticating ad hoc networks by comparison of short digests
• Some security topics with possible applications for pairing-based cryptography. (Abstract)
• Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1
• Practical unconditionally secure two-channel message authentication

This page was built for publication: The ephemeral pairing problem

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