SR3: secure resilient reputation-based routing
- 106 Downloads
In this paper, we propose SR3 (which means secure resilient reputation-based routing), a secure and resilient algorithm for convergecast routing in wireless sensor networks. SR3 uses lightweight cryptographic primitives to achieve data confidentiality and unforgeability. Security of SR3 has been proven formally using two verification tools: CryptoVerif and Scyther. We made simulations to show the resiliency of SR3 against various scenarios, where we mixed selective forwarding, blackhole, wormhole, and Sybil attacks. We compared our solution to several routing algorithms of the literature. Our results show that the resiliency accomplished by SR3 is drastically better than the one achieved by those protocols, especially when the network is sparse. Moreover, unlike previous solutions, SR3 self-adapts after compromised nodes suddenly change their behavior.
KeywordsWireless sensor networks Routing Security Resiliency
The authors are grateful to Bruno Blanchet for his meticulous reading of the paper and his numerous suggestions.
- 1.Accettura, N., Grieco, L., Boggia, G., & Camarda, P. (2011). Performance analysis of the RPL routing protocol. In 2011 IEEE international conference on mechatronics (ICM) (pp. 767–772).Google Scholar
- 2.Aleliunas, R., Karp, R., Lipton, R., Lovasz, L., & Rackoff, C. (1979). Random walks, universal traversal sequences, and the complexity of maze problems. In 20th annual symposium on foundations of computer science (pp. 218–223).Google Scholar
- 3.Altisen, K., Devismes, S., Jamet, R., & Lafourcade, P. (2013). SR3: Secure resilient reputation-based routing. In 2013 IEEE international conference on distributed computing in sensor systems (DCOSS) (pp. 258–265). doi: 10.1109/DCOSS.2013.33.
- 4.Altisen, K., Devismes, S., Jamet, R., & Lafourcade, P. (2013). SR3 supplementary material. http://www-verimag.imag.fr/~devismes/SR3/.
- 5.Bellare, M.: Symmetric encryption. https://cseweb.ucsd.edu/~mihir/cse207/w-se.pdf.
- 6.Bellare, M. (2006). New proofs for nmac and hmac: Security without collision-resistance. https://cseweb.ucsd.edu/~mihir/papers/hmac-new.html. An extended abstract of this paper appeared in C. Dwork (ed.) Advances in cryptology—Crypto 2006, proceedings, Lecture Notes in Computer Science (Vol. 4117). Berlin: Springer.
- 7.Bellare, M., Canetti, R., & Krawczyk, H. (1996). Keying hash functions for message authentication. In Proceedings of the 16th annual international cryptology conference on advances in cryptology, CRYPTO ’96 (pp. 1–15). London: Springer. http://dl.acm.org/citation.cfm?id=646761.706031.
- 10.Bellare, M., & Rogaway, P. (1993). Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM conference on Computer and communications security (pp. 62–73).Google Scholar
- 11.Bellare, M., & Rogaway, P. (2000). Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography. In T. Okamoto (Ed.), Advances in cryptology—ASIACRYPT 2000, 6th international conference on the theory and application of cryptology and information security, Kyoto, Japan, December 3–7, 2000, proceedings. Lecture Notes in Computer Science (Vol. 1976, pp. 317–330). Berlin: Springer. doi: 10.1007/3-540-44448-3_24.Google Scholar
- 13.Bogdanov, A., Khovratovich, D., & Rechberger, C. (2011). Biclique cryptanalysis of the full aes. In Advances in cryptology–ASIACRYPT 2011 (pp. 344–371). Berlin: Springer.Google Scholar
- 15.Cremers, C. J. (2008). The scyther tool: Verification, falsification, and analysis of security protocols. In Computer aided verification (pp. 414–418). Berlin: Springer.Google Scholar
- 17.Ehrsam, W., Meyer, C., Smith, J., & Tuchman, W. (1978). Message verification and transmission error detection by block chaining. http://www.google.com/patents/US4074066. US Patent 4,074,066
- 19.Erdene-Ochir, O., Kountouris, A., Minier, M., & Valois, F. (2011). Enhancing resiliency against routing layer attacks in wireless sensor networks: Gradient-based routing in focus. International Journal on Advances in Networks and Services, 4(1 and 2), 38–54.Google Scholar
- 21.Erdene-Ochir, O., Minier, M., Valois, F., & Kountouris, A. (2010). Resiliency of wireless sensor networks: Definitions and analyses. In 2010 IEEE 17th international conference on telecommunications (ICT) (pp. 828–835).Google Scholar
- 22.Erdene-Ochir, O., Minier, M., Valois, F., & Kountouris, A. (2010). Toward resilient routing in wireless sensor networks: Gradient-based routing in focus. In Proceedings of the 2010 fourth international conference on sensor technologies and applications, SENSORCOMM ’10 (pp. 478–483).Google Scholar
- 23.Heurtefeux, K., Erdene-Ochir, O., Mohsin, N., & Menouar, H. (2015). Enhancing RPL resilience against routing layer insider attacks. In L. Barolli, M. Takizawa, F. Xhafa, T. Enokido, & J. H. Park (Eds.), 29th IEEE international conference on advanced information networking and applications, AINA 2015, Gwangju, South Korea, March 24–27, 2015 (pp. 802–807). Washington: IEEE Computer Society.Google Scholar
- 25.Katz, J., & Yung, M. (2001). Unforgeable encryption and chosen ciphertext secure modes of operation. In G. Goos, J. Hartmanis, J. van Leeuwen, & B. Schneier (Eds.), Fast software encryption, Lecture Notes in Computer Science (Vol. 1978, pp. 284–299). Berlin: Springer. doi: 10.1007/3-540-44706-7_20.CrossRefGoogle Scholar
- 28.Lowe, G. (1997). A hierarchy of authentication specifications. In Computer security foundations workshop, 1997. Proceedings., 10th (pp. 31–43). IEEE.Google Scholar
- 29.Miller, V. S. (1986). Use of elliptic curves in cryptography. In Advances in cryptology CRYPTO 85 proceedings (Vol. 218, pp. 417–426).Google Scholar
- 30.Papadimitratos, P., & Haas, Z. (2002). Secure routing for mobile ad hoc networks. In Proceedings of the SCS commnication networks and distributed systems modeling and simulation conference (CNDS) (pp. 193–204).Google Scholar
- 32.Rackoff, C., & Simon, D. R. (1991). Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum (Ed.), Advances in cryptology–CRYPTO ’91, 11th annual international cryptology conference, Santa Barbara, California, USA, August 11–15, 1991, proceedings. Lecture Notes in Computer Science (Vol. 576, pp. 433–444). Berlin: Springer. doi: 10.1007/3-540-46766-1_35.Google Scholar
- 33.Schurgers, C., & Srivastava, M. (2001). Energy efficient routing in wireless sensor networks. In Proceedings of MILCOM 2001 (pp. 357–361).Google Scholar
- 34.Sinalgo: Simulator for network algorithms. http://www.disco.ethz.ch/projects/sinalgo/. Distributed Computing Group at ETH Zurich.