Interconectando Clusters com Transparência em Rede de Sensores Sem Fio Segura
Resumo
Uma rede de sensores sem fio é uma coleção de dispositivos limitados em poder de processamento e alcance de transmissão, com baixa disponibilidade de memória e de energia. Devido a estas limitações, a maioria das soluções de segurança de redes cabeadas não se aplicam diretamente neste tipo de ambiente. Este artigo apresenta um protocolo híbrido que trata do esquema de gerenciamento de chaves e da interconexão transparente de clusters. Também é tratado o problema de captura de nós, oferecendo uma solução para a proteção da chave de grupo. Simulações mostram que aumentando o número de sensores na rede, o desempenho da comunicação entre dois clusters quaisquer permanece o mesmo.
Referências
Arazi, B., Elhanany, I., Arazi, O. e Qi, H. (2005) “Revisiting Public-Key Cryptography for Wireless Sensor Networks”. IEEE Computer, Vol. 38, Num. 11. Novembro.
Basagni, S., Herrín, K., Bruschi, D. e Rosti, E. (2001) “Secure Pebblenets”. In Proc. of the ACM Int. Symp. On Mobile Ad Hoc Networking and computing, ACM Press, New York. pp 156-163.
Bechler, M., Hof, H. J., Kraft, D., Pählke, F. e Wolf, L. (2004) “A cluster-based security architecture for ad hoc networks”. IEEE INFOCOM.
Blaß, E.-O. e Zitterbart, M. (2005) “Efficient Implementation of Elliptic Curve Cryptography for Wireless Sensor Networks”. Institute of Telematics, University of Karlsruhe. http://doc.tm.uka.de/tr/TM-2005-1.pdf, Março.
Du, W., Wang, R. e Ning, P. (2005) “An Efficient Scheme for Authenticating Public Keys in Sensor Networks”. MobiHoc’05. Illinois. USA. Maio.
Eschenauer, L. e Gligor, V. D. (2002) “A key-management scheme for distributed sensor networks”. In Proc. of the 9th ACM Conf. On Computer and Communications Security, pp. 41-47. Novembro.
Fokine, K. (2002) “Key management in ad hoc networks”. Master Thesis. http://www.ep.liu.se/exjobb/isy/2002/3322/. Setembro.
Ganesan, P., Venugopalan, R. Peddabachagari, P., Dean, A., Mueller, F. e Sichitiu, M. (2003) “Analyzing and Modeling Encryption Overhead for Sensor Network Nodes”. Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, pp. 151-159.
Gura, N., Patel, A., Wander, A., Eberle, H. e Chang-Shantz, S. (2004) “Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs”. CHES’2004. Workshop on Cryptographic Hardware and Embedded Systems. Springer-Verlag. Agosto.
Hu, F. e Sharma, N. K. (2005) “Security considerations in ad hoc sensor networks”. Ad Hoc Networks 3. pp. 69-89.
Hubaux, J., Buttyan, L., e Capkun, S. (2001) “The quest for security in mobile ad hoc networks”. In Proc. ACM Symp. On Mobile Ad Hoc Networking and Computing (MobiHOC).
Kamal, A. B. M. (2004) “Adaptive Secure Routing in Ad Hoc Mobile Network”. Master of Science Thesis. Royal Institute of Technology. Sweden. Novembro.
Lenstra, A. K. e Verheul, E. R. (2001) “Selecting Cryptographic Key Sizes”. Journal of Cryptology: the Journal of the International Association for Cryptologic Research, 14(4): 255-293.
Malan, D. J., Welsh, M. e Smith, M.D. (2004) “A Public-Key Infrastructure for Key Distribuition in TinyOS Based Elliptic Curve Cryptography”. First IEEE International Conference on Sensor and Ad Hoc Communications and Networks.
Okabe, N., Sakane, S., Miyazawa, K., Kamada, K., Inoue, A. e Ishiyama, M. (2005) “Security Architecture for Networks using Ipsec and KINK”. SAINT’2005. International Symposium on Applications and the Internet. IEEE. Computer Society.
Perkins, C. e Belding-Royer, E. (2003) “Ad hoc on-demand distance vector (AODV) routing”. IETF Request for Comments, RFC 3561. Julho.
Perrig, A., Szewczyk, R., Wen, V., Culler, D. E., e Tygar, J. D. (2001) “SPINS: security protocols for sensor networks”. In Proc. of the Seventh Annual Int. Conf. on Mobile Computing and Networking, pp 189-199.
Schneier, B. (1996) “Applied Cryptography: Protocols, Algorithms and Source code in C”. John Wiley & Sons, Inc. New York.
Shoup, V. (2000) "Practical threshold signatures". EUROCRYPT´00 pp. 207–220.
Stallings, W. (1999) “Cryptography and Network Security: Principles and Practice”. Second edition. Prentice Hall, Inc. New Jersey.
Zapata, M. G., e Asokan, N. (2002) “Securing ad hoc routing protocols”. Proc. ACM Workshop on Wireless Security (WiSe), ACM Press, pp. 1-10.
Zhou, L. e Haas, Z. J. (1999) “Securing ad hoc networks”. IEEE Networkd Magazine, 13(6), pp 24-30. Novembro/Dezembro.
Basagni, S., Herrín, K., Bruschi, D. e Rosti, E. (2001) “Secure Pebblenets”. In Proc. of the ACM Int. Symp. On Mobile Ad Hoc Networking and computing, ACM Press, New York. pp 156-163.
Bechler, M., Hof, H. J., Kraft, D., Pählke, F. e Wolf, L. (2004) “A cluster-based security architecture for ad hoc networks”. IEEE INFOCOM.
Blaß, E.-O. e Zitterbart, M. (2005) “Efficient Implementation of Elliptic Curve Cryptography for Wireless Sensor Networks”. Institute of Telematics, University of Karlsruhe. http://doc.tm.uka.de/tr/TM-2005-1.pdf, Março.
Du, W., Wang, R. e Ning, P. (2005) “An Efficient Scheme for Authenticating Public Keys in Sensor Networks”. MobiHoc’05. Illinois. USA. Maio.
Eschenauer, L. e Gligor, V. D. (2002) “A key-management scheme for distributed sensor networks”. In Proc. of the 9th ACM Conf. On Computer and Communications Security, pp. 41-47. Novembro.
Fokine, K. (2002) “Key management in ad hoc networks”. Master Thesis. http://www.ep.liu.se/exjobb/isy/2002/3322/. Setembro.
Ganesan, P., Venugopalan, R. Peddabachagari, P., Dean, A., Mueller, F. e Sichitiu, M. (2003) “Analyzing and Modeling Encryption Overhead for Sensor Network Nodes”. Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, pp. 151-159.
Gura, N., Patel, A., Wander, A., Eberle, H. e Chang-Shantz, S. (2004) “Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs”. CHES’2004. Workshop on Cryptographic Hardware and Embedded Systems. Springer-Verlag. Agosto.
Hu, F. e Sharma, N. K. (2005) “Security considerations in ad hoc sensor networks”. Ad Hoc Networks 3. pp. 69-89.
Hubaux, J., Buttyan, L., e Capkun, S. (2001) “The quest for security in mobile ad hoc networks”. In Proc. ACM Symp. On Mobile Ad Hoc Networking and Computing (MobiHOC).
Kamal, A. B. M. (2004) “Adaptive Secure Routing in Ad Hoc Mobile Network”. Master of Science Thesis. Royal Institute of Technology. Sweden. Novembro.
Lenstra, A. K. e Verheul, E. R. (2001) “Selecting Cryptographic Key Sizes”. Journal of Cryptology: the Journal of the International Association for Cryptologic Research, 14(4): 255-293.
Malan, D. J., Welsh, M. e Smith, M.D. (2004) “A Public-Key Infrastructure for Key Distribuition in TinyOS Based Elliptic Curve Cryptography”. First IEEE International Conference on Sensor and Ad Hoc Communications and Networks.
Okabe, N., Sakane, S., Miyazawa, K., Kamada, K., Inoue, A. e Ishiyama, M. (2005) “Security Architecture for Networks using Ipsec and KINK”. SAINT’2005. International Symposium on Applications and the Internet. IEEE. Computer Society.
Perkins, C. e Belding-Royer, E. (2003) “Ad hoc on-demand distance vector (AODV) routing”. IETF Request for Comments, RFC 3561. Julho.
Perrig, A., Szewczyk, R., Wen, V., Culler, D. E., e Tygar, J. D. (2001) “SPINS: security protocols for sensor networks”. In Proc. of the Seventh Annual Int. Conf. on Mobile Computing and Networking, pp 189-199.
Schneier, B. (1996) “Applied Cryptography: Protocols, Algorithms and Source code in C”. John Wiley & Sons, Inc. New York.
Shoup, V. (2000) "Practical threshold signatures". EUROCRYPT´00 pp. 207–220.
Stallings, W. (1999) “Cryptography and Network Security: Principles and Practice”. Second edition. Prentice Hall, Inc. New Jersey.
Zapata, M. G., e Asokan, N. (2002) “Securing ad hoc routing protocols”. Proc. ACM Workshop on Wireless Security (WiSe), ACM Press, pp. 1-10.
Zhou, L. e Haas, Z. J. (1999) “Securing ad hoc networks”. IEEE Networkd Magazine, 13(6), pp 24-30. Novembro/Dezembro.
Publicado
28/08/2006
Como Citar
MENEZES, Alexandre Gava; WESTPHALL, Carlos Becker.
Interconectando Clusters com Transparência em Rede de Sensores Sem Fio Segura. In: SIMPÓSIO BRASILEIRO DE SEGURANÇA DA INFORMAÇÃO E DE SISTEMAS COMPUTACIONAIS (SBSEG), 6. , 2006, Santos.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2006
.
p. 1-16.
DOI: https://doi.org/10.5753/sbseg.2006.20935.
