Especificação Formal de um Protocolo de Roteamento Anônimo para Redes Ad-Hoc
Resumo
Uma rede sem fio ad-hoc consiste num grupo de nós móveis que se comunicam entre si sem ajuda de uma infraestrutura fixa. Alguns nós podem ser maliciosos ameaçando a segurança e confidenciabilidade dos dados trocados. Usando caminhos anônimos para comunicação fornecemos segurança e privacidade contra a análise de tráfego. Nesse artigo, propomos um protocolo de roteamento anônimo que previne contra a análise de tráfego escondendo a fonte e o destino dos pacotes. Uma técnica de descrição formal (LOTOS) é usada para projetar especificações e validar o protocolo.
Referências
Bagatelli, R., Moura, D. F.C., and de Castro P. Pedroza, A. (2002). Especificação Formal de uma Arquitetura de Suporte à Descoberta de Serviços em Redes Móveis Ad Hoc. In V Workshop de Métodos Formais, WMF'2002, Gramado, RS, Brasil.
Berthold, O., Federrath, H., and Kôhntopp, M. (2000). Project “Anonymity and Unobservability in the Internet”. In In Computers Freedom and Privacy Conference, CFP’2000, Workshop on Freedom and Privacy by Design.
Chaum, D. L. (1981). Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24(2):84-90.
El-Khatib, K., Korba, L., Song, R., and Yee, G. (2003). Secure Dynamic Distributed Routing Algorithm for Wireless Ad Hoc Networks. In Proceedings in International Conference on Parallel Processing Workshops.
Fernandez, J. C., Garavel, H., Kerbrat, A., Mounier, L., Mateescu, R., and Sighireanu, M. (1996). CADP: A Protocol Validation and Verification Toolbox. volume 1102, pages 437-440, New Brunswick, NJ, USA. Springer-Verlag.
ISO/IFC (1988). Is 8807: Information Processing Systems - Open Systems Interconnection - LOTOS - A Formal Description Techniques Based on The Temporal Ordering of Observacional Behavior.
Jiang, S., Vaidya, N., and Zhao, W. (2001). A Dynamic Mix Method for Wireless Ad-Hoc Networks. Military Communications Conference, MILCOM 2001).
Johnson, D. B., Maltz, D. A., and Hu, Y.-C. (2003). The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR). In Work in progress, draft-ieif-manet-dsr. IEEE.
Kesdogan, D., Egner, J., and Buschkes, R. (1998). Stop-and-Go-Mixes Providing Probabilistic Security in an Open System. Information Hiding: Second International Workshop, 1525:83-98.
Kong, J. and Hong, X. (2003). ANODR: ANonymous on Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks. In Proceedings of the 4th ACM International Symposium on Mobile ad hoc Networking Computing. ACM Press.
Leduc, G. and Germeau, F. (2000). Verification of Security Protocols using LOTOS-Method and Application. Computer Communications, 23:1089-1103.
Pfitzmann, A. and Köhntopp, M. (2000). Anonymity, Unobservability and Pseudonymity - A Proposal of Terminology. volume 2009 of Lecture Notes in Computer Science, Berkeley, CA, USA. Springer-Verlag, Berlin, Germany.
Reed, M. G., Syverson, P. F., and Goldschlag, D. M. (1998). Anonymous Connections and Onion Routing. IEEE Journal on Special Areas in Communications, 16(4):482-494.
Berthold, O., Federrath, H., and Kôhntopp, M. (2000). Project “Anonymity and Unobservability in the Internet”. In In Computers Freedom and Privacy Conference, CFP’2000, Workshop on Freedom and Privacy by Design.
Chaum, D. L. (1981). Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24(2):84-90.
El-Khatib, K., Korba, L., Song, R., and Yee, G. (2003). Secure Dynamic Distributed Routing Algorithm for Wireless Ad Hoc Networks. In Proceedings in International Conference on Parallel Processing Workshops.
Fernandez, J. C., Garavel, H., Kerbrat, A., Mounier, L., Mateescu, R., and Sighireanu, M. (1996). CADP: A Protocol Validation and Verification Toolbox. volume 1102, pages 437-440, New Brunswick, NJ, USA. Springer-Verlag.
ISO/IFC (1988). Is 8807: Information Processing Systems - Open Systems Interconnection - LOTOS - A Formal Description Techniques Based on The Temporal Ordering of Observacional Behavior.
Jiang, S., Vaidya, N., and Zhao, W. (2001). A Dynamic Mix Method for Wireless Ad-Hoc Networks. Military Communications Conference, MILCOM 2001).
Johnson, D. B., Maltz, D. A., and Hu, Y.-C. (2003). The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR). In Work in progress, draft-ieif-manet-dsr. IEEE.
Kesdogan, D., Egner, J., and Buschkes, R. (1998). Stop-and-Go-Mixes Providing Probabilistic Security in an Open System. Information Hiding: Second International Workshop, 1525:83-98.
Kong, J. and Hong, X. (2003). ANODR: ANonymous on Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks. In Proceedings of the 4th ACM International Symposium on Mobile ad hoc Networking Computing. ACM Press.
Leduc, G. and Germeau, F. (2000). Verification of Security Protocols using LOTOS-Method and Application. Computer Communications, 23:1089-1103.
Pfitzmann, A. and Köhntopp, M. (2000). Anonymity, Unobservability and Pseudonymity - A Proposal of Terminology. volume 2009 of Lecture Notes in Computer Science, Berkeley, CA, USA. Springer-Verlag, Berlin, Germany.
Reed, M. G., Syverson, P. F., and Goldschlag, D. M. (1998). Anonymous Connections and Onion Routing. IEEE Journal on Special Areas in Communications, 16(4):482-494.
Publicado
10/05/2004
Como Citar
ARAUJO, Andréa Martins; PEDROZA, Aloysio de Castro P..
Especificação Formal de um Protocolo de Roteamento Anônimo para Redes Ad-Hoc. In: SIMPÓSIO BRASILEIRO DE SEGURANÇA DA INFORMAÇÃO E DE SISTEMAS COMPUTACIONAIS (SBSEG), 4. , 2004, Gramado.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2004
.
p. 164-175.
DOI: https://doi.org/10.5753/sbseg.2004.21235.
