A New Message Recognition Protocol for Ad Hoc Pervasive Networks

Authors:
Atefeh Mashatan;Douglas R. Stinson
Affiliations:
Cryptography, Security, and Privacy Research Group David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada N2L 3G1;Cryptography, Security, and Privacy Research Group David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada N2L 3G1
Venue:
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Year:
2008

Citing 5
Cited 5

A new family of authentication protocols

ACM SIGOPS Operating Systems Review
Multiround Unconditionally Secure Authentication

Designs, Codes and Cryptography
Recognition in a Low-Power Environment

ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
Interactive two-channel message authentication based on Interactive-Collision Resistant hash functions

International Journal of Information Security
Almost optimal hash sequence traversal

FC'02 Proceedings of the 6th international conference on Financial cryptography

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a message recognition protocol which is suitable for ad hoc pervasive networks without the use of hash chains. Hence, we no longer require the devices to save values of a hash chain in their memories. This relaxes the memory requirements. Moreover, we do not need to fix the total number of times the protocol can be executed which implies a desired flexibility in this regard. Furthermore, our protocol is secure without having to consider families of assumptions that depend on the number of sessions the protocol is executed. Hence, the security does not weaken as the protocol is executed over time. Last but not least, we provide a practical procedure for resynchronization in case of any adversarial disruption or communication failure.