Mobile agent security through multi-agent cryptographic protocols

Proceedings of the International Conference on Internet Computing

Volumn 2, Issue , 2003, Pages 462-468

  Tate, Stephen R ^a   Xu, Ke ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Cryptographic protocols; Internet security; Mobile agents

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; CRYPTOGRAPHY; DATA PRIVACY; ELECTRONIC COMMERCE; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION RETRIEVAL; NETWORK PROTOCOLS; SECURITY OF DATA;

DISTRIBUTED COMPUTING; INTERNET SECURITY; MOBILE AGENT SECURITY; MULTI-AGENT CRYPTOGRAPHIC PROTOCOLS;

MULTI AGENT SYSTEMS;

EID: 1842481962     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. J. M. Bradshaw, "An introduction to software agents," in Software Agents, J. M. Bradshaw, Ed., chapter 1, pp. 3-46. AAAI Press, 1997.
2. D. Chess, B. Grosof, C. Harrison, D. Levine, and C. Paris, "Itinerant agents for mobile computing," IEEE Personal Communications, vol. 2, no. 5, pp. 34-49, Oct. 1995.
3. Tomas Sander and Christian F. Tschudin, "Protecting mobile agents against malicious hosts," in Mobile Agents and Security, G. Vigna, Ed., vol. 1419 of Lecture Notes in Computer Science, pp. 379-386. Springer Verlag, 1998.
4. 1," in Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp. 554-566.
5. Christian Cachin, Jan Camenisch, Joe Kilian, and Joy Müller, "One-round secure computation and secure autonomous mobile agents," in Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP), U. Montanari, J. P. Rolim, and E. Welzl, Eds. 2000, vol. 1853 of Lecture Notes in Computer Science, pp. 512-523, Springer Verlag.
6. Joy Algesheimer, Christian Cachin, Jan Camenisch, and Günter Karjoth, "Cryptographic security for mobile code," in Proc. IEEE Symposium on Security and Privacy, May 2001, pp. 2-11.
7. Andrew Chi-Chih Yao, "How to generate and exchange secrets," in Proc. 27th IEEE Symposium on Foundations of Computer Science (FOCS), 1986, pp. 162-167.
8. Phillip Rogaway, The Round Complexity of Secure Protocols, Ph.D. thesis, Laboratory for Computer Science, MIT, April 1991.
9. Stephen R. Tate and Ke Xu, "On garbled circuits and constant round secure function evaluation," 2003, UNT CoPS Lab Technical report 2003-2. Available at http://cops.csci.unt.edu/.
10. Victor Shoup and Rosario Gennaro, "Securing threshold cryptosystems against chosen ciphertext attack," Journal of Cryptology, vol. 15, no. 2, pp. 75-96, Spring, 2002, A preliminary version appears in the proceedings of EuroCrypt'98.
11. Mihir Bellare and Silvio Micali, "Non-interactive oblivious transfer and applications," in Advances in Cryptology - Crypto'89 Proceedings, Gilles Brassard, Ed. 1989, vol. 435 of Lecture Notes in Computer Science, pp. 547-557, Springer Verlag.