A new message recognition protocol with self-recoverability for ad hoc pervasive networks

3Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, which was proposed by Lucks et al., more closely and note its inability to recover in case of a certain adversarial disruption. Our paper saves this well-studied protocol from its unrecoverable state when such adversarial disruption occurs. We propose a new message recognition protocol, which is based on the Jane Doe protocol, and incorporate the resynchronization technique within the protocol itself. That is, without having to provide a separate resynchronization procedure, we overcome the recoverability problem of the Jane Doe protocol. Moreover, we enumerate all possible attacks against the new protocol and show that none of the attacks can occur. We further prove the security of the new protocol and its ability to self-recover once the disruption has stopped. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Goldberg, I., Mashatan, A., & Stinson, D. R. (2009). A new message recognition protocol with self-recoverability for ad hoc pervasive networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5536 LNCS, pp. 219–237). https://doi.org/10.1007/978-3-642-01957-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free