Strong password-only authenticated key exchange
ACM SIGCOMM Computer Communication Review
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys
Proceedings of the 5th International Workshop on Security Protocols
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Proceedings of the 7th International Workshop on Security Protocols
Encrypted Key Exchange: Password-Based Protocols SecureAgainst Dictionary Attacks
SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Authenticated key exchange secure against dictionary attacks
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Provably secure password-authenticated key exchange using Diffie-Hellman
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A framework for password-based authenticated key exchange
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Location privacy in wireless personal area networks
WiSe '06 Proceedings of the 5th ACM workshop on Wireless security
Authenticating ad hoc networks by comparison of short digests
Information and Computation
Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Self-authorized public key management for home networks
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
The candidate key protocol for generating secret shared keys from similar sensor data streams
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Multi-channel key agreement using encrypted public key exchange
Proceedings of the 15th international conference on Security protocols
Authentication protocols based on low-bandwidth unspoofable channels: A comparative survey
Journal of Computer Security
Improved pairing protocol for bluetooth
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Body sensor network key distribution using human interactive channels
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Re-identifying anonymous nodes
LoCA'06 Proceedings of the Second international conference on Location- and Context-Awareness
Noisy tags: a pretty good key exchange protocol for RFID tags
CARDIS'06 Proceedings of the 7th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Secure communications over insecure channels based on short authenticated strings
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Efficient mutual data authentication using manually authenticated strings
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
KALwEN: a new practical and interoperable key management scheme for body sensor networks
Security and Communication Networks
Hi-index | 0.00 |
The ephemeral pairing problem requires two or more specific physical nodes in a wireless broadcast network, that do not yet know each other, to establish a short-term relationship between them. Such short-lived pairings occur, for example, when one pays at a check-out using a wireless wallet. This problem is equivalent to the ephemeral key exchange problem, where one needs to establish a high-entropy shared session key between two nodes given only a low bandwidth authentic (or private) communication channel between the pair, and a high bandwidth shared broadcast channel. We study this problem for truly anonymous broadcast networks, discuss certain impossible scenarios and present several protocols depending on the type of communication channel between the nodes.