Gopirajan. P.V, S. Rajesh


Message validation is one of the most effective ways to thwart unauthorized and corrupted messages from being forwarded in wireless sensor networks (WSNs). For this reason, many message validation schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems.

Most of them, however, have the limitations of high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks.

To address these issues, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial: when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial.


Hop-by-hop validation; symmetric-key cryptosystem; public-key cryptosystem; source privacy; simulation; wireless sensor networks (WSNs); distributed algorithm; decentralized control;


F. Ye, H. Lou, S. Lu, and L. Zhang, “Statistical en-route filtering of injected false data in sensor networks,” in IEEE INFOCOM, March 2004.

S. Zhu, S. Setia, S. Jajodia, and P. Ning, “An interleaved hop-by-hop validation scheme for filtering false data in sensor networks,” in IEEE Symposium on Security and Privacy, 2004.

C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, “Perfectly-secure key distribution for dynamic conferences,” in Advances in Cryptology - Crypto’92, ser. Lecture Notes in Computer Science Volume 740, 1992, pp. 471–486.

W. Zhang, N. Subramanian, and G. Wang, “Lightweight and compromise-resilient message validation in sensor networks,” in IEEE INFOCOM, Phoenix, AZ., April 15-17 2008.

A. Perrig, R. Canetti, J. Tygar, and D. Song, “Efficient validation and signing of multicast streams over lossy channels,” in IEEE Symposium on Security and Privacy, May 2000.

M. Albrecht, C. Gentry, S. Halevi, and J. Katz, “Attacking crypto-graphic schemes based on ”perturbation polynomials”,” Cryptology ePrint Archive, Report 2009/098, 2009, http://eprint.iacr.org/.

R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications. of the Assoc. of Comp. Mach., vol. 21, no. 2, pp. 120–126, 1978.

T. A. ElGamal, “A public-key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469–472, 1985.

H. Wang, S. Sheng, C. Tan, and Q. Li, “Comparing symmetric-key and public-key based security schemes in sensor networks: A case study of user access control,” in IEEE ICDCS, Beijing, China, 2008, pp. 11–18.

D. Pointcheval and J. Stern, “Security proofs for signature schemes,” in Advances in Cryptology - EUROCRYPT, ser. Lecture Notes in Computer Science Volume 1070, 1996, pp. 387–398.

D. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,” Communications of the ACM, vol. 24, no. 2, pp. 84–88, February 1981.

“The dinning cryptographer problem: Unconditional sender and recipient untraceability,” Journal of Cryptology, vol. 1, no. 1, pp. 65–75, 1988.

A. Pfitzmann and M. Hansen, “Anonymity, unlinkability, unobservabil-ity, pseudonymity, and identity management a proposal for terminol-ogy,” http://dud.inf.tu-dresden.de/literatur/Anon Terminology v0.31.pdf, Feb. 15 2008.

A. Pfitzmann and M. Waidner, “Networks without user observability design options.” in Advances in Cryptology - EUROCRYPT, ser. Lecture Notes in Computer Science Volume 219, 1985

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.