Joao Paulo Pimentao
ABSTRACT
This paper presents the Split and Merge method, an approach to provide secure communication over the Internet using software agents. Instead of relying exclusively on the traditional approaches of ciphering the message at the source and then sending it over a communication channel, the Split and Merge method focuses on denying access to the message itself. This is achieved by splitting the message in parts and sending them to the destination through different routes, in an ad-hoc network of agents. The method is detailed in the paper and the current implementation using multi agent systems is presented. The solutions found to deal with error detection and correction (loss of message fragments, message integrity and node misbehavior) are then discussed and further research directions are presented.
References
- {1} Singh, S., The Code Book - The Secret History of Codes and Code Breaking. Popular Science. 1999, London: Fourth Estate.Google Scholar
- {2} R.L. Rivest, A.S. and L.M. Adleman, "A method for obtaining digital signatures and public-key cryptosystems". Communications of the ACM, 1978. 2(21): p. 120-126. Google ScholarDigital Library
- {3} Webopedia, "Moore's law". 1998, http://www.webopedia. com/TERM/M/Moores_Law.html.Google Scholar
- {4} Mann, C.C., "The End of Moore's Law?" 2000, Technology Review, http://technologyreview.com/articles/mann0500.asp.Google Scholar
- {5} NCIX, Counterintelligence News & Developments, Volume 2, June 1998 - "Hidden in Plain Sight-Steganography". 1998, Office of the National Counterintelligence Executive.Google Scholar
- {6} Judge, J.C., "Steganography: Past, Present, Future". 2001, SANS - SysAdmin, Audit, Network, Security - http://www.sans.org/rr/steg/steganography4.php.Google Scholar
- {7} Reiter, M.K. and A.D. Rubin, "Crowds: Anonymity for Web Transactions". 1997, DIMACS: New Jersey, USA. p. 21.Google Scholar
- {8} Goldschlag, D., M. Reed, and P. Syverson, "Onion Routing for Anonymous and Private Internet Connections". Communications of the ACM, 1999. 42(2). Google ScholarDigital Library
- {9} Bosselaers, A., "Comparative performance of hash functions", http://www.esat.kuleuven.ac.be/~bosselae/fast.Google Scholar
- {10} Barreto, P., "The Hashing Function Lounge". 2000, http:// planeta.terra.com.br/informatica/paulobarreto/hflounge.html.Google Scholar
- {11} Gambetta, D., "Can We Trust Trust?", in Trust: Making and Breaking Cooperative Relations, electronic edition, D. Gambetta, Editor. 2000, Department of Sociology, University of Oxford, http://www.sociology.ox.ac.uk/papers/gambetta213- 237.pdf. Oxford. p. 213-237.Google Scholar
- {12} Granovetter, M., "Economic Action and Social Structure: The Problem of Embeddedness". American Journal of Sociology, 1985. 91(November): p. 481-510.Google Scholar
- {13} Willmott, S., et al., "Agentcities Network Architecture Recommendation". 2002, Agentcities Task Force.Google Scholar
- {14} Bellifemine, F., A. Poggi, and G. Rimassa. "JADE - A FIPA-compliant agent framework". in 4th International Conference and Exhibition on the Practical Application of Intelligent Agents and Multi-Agents. 1999. London, UK.Google Scholar
- {15} FIPA00061, "FIPA ACL Message Structure Specification"., in Foundation for Intelligent Physical Agents. 2000.Google Scholar
Index Terms
(auto-classified)A Multi-Agent System's Approach to Communication Security in the Web
Comments