Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A new family of authentication protocols
ACM SIGOPS Operating Systems Review
Systematic Design of Two-Party Authentication Protocols
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Proceedings of the 7th International Workshop on Security Protocols
Fast Checking of Individual Certificate Revocation on Small Systems
ACSAC '99 Proceedings of the 15th Annual Computer Security Applications Conference
Recognition in a Low-Power Environment
ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
Formalizing and analyzing sender invariance
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Cryptanalysis of a message recognition protocol by Mashatan and Stinson
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
A message recognition protocol based on standard assumptions
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
On message recognition protocols: recoverability and explicit confirmation
International Journal of Applied Cryptography
On the (im)possibility of perennial message recognition protocols without public-key cryptography
Proceedings of the 2011 ACM Symposium on Applied Computing
Proceedings of the second ACM workshop on Security and privacy in smartphones and mobile devices
Hi-index | 0.01 |
Entity recognition does not ask whether the message is from some entity X , just whether a message is from the same entity as a previous message. This turns turns out to be very useful for low-end devices. The current paper proposes a new protocol --- the "Jane Doe Protocol" ---, and provides a formal proof of its concrete security. The protocol neither employs asymmetric cryptography, nor a trusted third party, nor any key pre-distribution. It is suitable for light-weight cryptographic devices such as sensor network motes and RFID tags.