Skip to main content

Mediating Hosts’ Malicious Character

  • Conference paper
EC2ND 2005
  • 330 Accesses

Abstract

Right now there isn’t any published solution to protect mobile agents against hosts’ attack. This is known as the problem of malicious hosts. To solve this problem, Minsky proposed an approach based on replication and vote. Within this approach, vote diverging information hosts are considered to be malicious. We consider such distinctive qualification as simple, straightforward and not flexible. Our paper relates malicious property to a more elaborated process. We claim that our process is cautious and flexible. In this process we: (1) Explore how to attach a trust or suspicious quality with a host. This attachment must be temporal. (2) Perform Vote among agents handing out information from trusted hosts only. Suspicious hosts’ information is dismissed. (3) Delegate the faculty to declare the malicious character to an adjudicator. The designation requires a dialogue and could be parameterized with a threshold. (4) Capture trusted hosts’ bizarre behavior and disclose it.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Oscar Esparza, Miguel Soriano, Jose L Munoz, and Jordi Forné Protocols for Malicious Host Revocation. “Information and Communications Security (ICICS’0303). Lecture Note in Computer Science Vol 2836, 2003, ISSN/ISBN 0302-9743.

    Google Scholar 

  2. Y. Minsky and Al. Cryptographic support for fault-Tolerant Distributed Computing, In seventh ACM SIGOPS European workshop 1996.

    Google Scholar 

  3. Uwe G. Wilhelm, Sebastian M. Staamann, and Levente Buttyan. A Pessimistic Approach to Trust in Mobile Agent Platforms 2000. CistSeer.IST. Scientific Literature Digital Library 2000.

    Google Scholar 

  4. Lugia perte and Kaisa Sere. Coordination among Mobile objects, Tucs Technical report NO 219, November 1998, ISBN 952-12-0332-3, ISSN 1239-1981.

    Google Scholar 

  5. Catherine Meadows. Detecting Attacks on Mobile Agents, 1997. CistSeer.IST. Scientific Literature Digital Library 1997.

    Google Scholar 

  6. Lora L. Kassab and Jeffrey Voas. Agent Trustworthiness, Ecoop workshops 1998:300.

    Google Scholar 

  7. Tomas Sander and Christian F. Tschudin. On software protection via function Hiding, submitted to the 2 International workshop on information Hiding.

    Google Scholar 

  8. Tomas Sander and Christian F. Tshudin. Towards mobile cryptography, IEEE symposium on security and privacy May 1998.

    Google Scholar 

  9. David Chess and AL. Itinerant Agents for mobile computing, IEEE personal communications Magazine, 2(5):34–39, October 1995.

    Article  Google Scholar 

  10. Fritz, Hohl. Time limited blackbox security: Protecting Mobile Agents from malicious Hosts, Springer verlag 1998. CistSeer.IST. Scientific Literature Digital Library.

    Google Scholar 

  11. Giovanni Vigna. Protecting Mobile Agents through Tracing, In proceeding of the 3rd ECOOP workshop on mobile objects systems, Jyvalskyla, Finland 1997.

    Google Scholar 

  12. O. Esparza, M Soriano, J.L, Munoz.and J. Forné. A protocol for detecting malicious hosts based on limiting the execution time of mobile agents. In IEEE symposium on computers and communications — ISCC’2003, 2003.

    Google Scholar 

  13. J. Zhou and D. Gollmann. An efficient non repudiation protocol. In proceeding of the 10th Computer Security fondations Workshop, pages 126–132. IEEE Computer Society Press, June 1997.

    Google Scholar 

  14. Y. Han. Investigation of non-repudiation protocols. In ACISP: Information security and privacy: Australasian Conference, Volume 1172 of lecture notes in Computer Science, pages 38–47 Springer-Verlag, 1996.

    Article  Google Scholar 

  15. P. Syverson. Weakly secret bit commitment: Application to lotteries and fair exchande. In proceeding of the 1998 IEEE Computer Security foundations Work-Shop (CSFW11), June 1998.

    Google Scholar 

  16. Olivier Markowitch, Yves Roggman. Probabilistic non-repudiation without trusted third party. Second Conference on security in communication networks (SCN9°), Amalfi, Italy, September 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag London Limited

About this paper

Cite this paper

Chihoub, M. (2006). Mediating Hosts’ Malicious Character. In: Blyth, A. (eds) EC2ND 2005. Springer, London. https://doi.org/10.1007/1-84628-352-3_23

Download citation

  • DOI: https://doi.org/10.1007/1-84628-352-3_23

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-311-6

  • Online ISBN: 978-1-84628-352-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics