Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Coordination Model for Agents based on Secure Spaces

  • Conference paper
  • First Online:
Coordinatio Languages and Models (COORDINATION 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1594))

Included in the following conference series:

  • 228 Accesses

Abstract

Shared space coordination models such as Linda are ill-suited for structuring applications composed of erroneous or insecure components. This paper presents the Secure Object Space model. In this model, a data element can he locked with a key and is only visible to a process that presents a matching key to unlock the element. We give a precise semantics for Secure Object Space operations and discuss an implementation in Java for a mobile agent system. An implementation of the semantics that employs encryption is also outlined for use in untrusted environments.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. M. Ahadi. Secrecy by Typing in Security Protocols. Theoretical aspects of Computer Syftware, September 1998.

    Google ScholarĀ 

  2. M. Abadi and A. D. Gordon, A calculus for cryptographic protocols: The Spicalculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, ZĆ¼rich, April 1997, 1997.

    Google ScholarĀ 

  3. R. M. Amadio, I. Castellani: and D. Sangiorgi. On hisimulations for the asynchronous Ļ€-calculus. In U. Montanari and V. Sassone, editors, CONCURā€™ 96, volume 1119 of LNCS, pages 147ā€“162. Springer-Verlag, Berlin, 1996.

    Google ScholarĀ 

  4. G. Boudol. Asynchrony and the Ļ€-calculus (note). Rapport de Recherche 1702, INRIA Sofia-rlntipolis, May 1992.

    Google ScholarĀ 

  5. L. Cardelli. Abstractions for mobile computations. Manuscript: Microsoft Research, 1998.

    Google ScholarĀ 

  6. L. Cardelli and A. D. Gordon. Mobile ambients. In Proc, of Foundations of Software Science and Computation Structures (FoSSaCS), ETAPSā€™98, LNCS 1378, Mar. 1998.

    ChapterĀ  Google ScholarĀ 

  7. N. Carriero, D. Gelernter; and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent, Systems, volume 924 of LNCS: pages 66ā€“76. Springer-Verlag, Berlin, 1995.

    Google ScholarĀ 

  8. P. Ciancarini. Distribued Programming with Logic Tuple Spxes. Technical Report UBLCS-93-7, The Technical University of Berlin, April 1993.

    Google ScholarĀ 

  9. P. Ciancarini and D. Rassi. Jada: Coordination and Communication for Java Agents. In J. Vitek and C. Tschudin, editors, Mobile Agent Systems: Towards the Programmable Internet, volume 1222 of LNCS, 1997.

    Google ScholarĀ 

  10. L. Dami. Type Inference and Subtyping in Higher-Order Generative Communication. In D. Tsichritzis, editor, Object Applications. University of Geneva, 1996.

    Google ScholarĀ 

  11. R. DeiYicola, G. Ferrari, and R. Pugliese. Coordinating Mobile Agents via Blackboards and Access Rights. In Proc. 2nd Int. Conf on Coordination Models and Languages, volume 1282 of LNCS, September 1997.

    ChapterĀ  Google ScholarĀ 

  12. C. Fournet, G. Gonthier, J. Levy, L. Maranget, and D. Remy, A calculus of mobile agents. In CONCURS6. 1996.

    Google ScholarĀ 

  13. D. Gelernter. Multiple Tuple Spaces in Linda. In E. Odijk, M. Rem, and J. Syre, editors, Proc. Conf. on Parallel Architectures and Languages Europe (PARLE 89), volume 365 of LNCS. Springer-Verlag, Berlin: 1989.

    Google ScholarĀ 

  14. K. Honda and M. Tokoro. On asynchronous communication semantics. In M. Tokoro, O. Nierstrasz, and P. Wegner, editors, Object-Based Concurrent Computing. LNCS 612, pages 21ā€“51, 1992.

    Google ScholarĀ 

  15. S. Hupfer. Melinda: Linda with multiple tuple spaces. Technical Report RR YALEU/DCS/R-766, Dept. of Computer Science, Yale University. New Haven, CT: 1990.

    Google ScholarĀ 

  16. R. Jellinghaus. Eiffel Linda: an Object Oriented Linda Dialect. ACM Sigplan, Notices, 25(12), December 1990.

    Google ScholarĀ 

  17. G. Matos and J. Purtilo. Reconfiguration of hierarchical tuple spaces: Experiments with Linda-polylith. Technical report, University of Maryland.

    Google ScholarĀ 

  18. S. Matsouka and S. Kawai. Using Tuple Space Communication in Distributed Object Oriented Languages. In Proc. ACM Object Oriented Programming, Systems, Languages and Applications (OOPSLA 88), 1988.

    Google ScholarĀ 

  19. J.-H. Morin and D. Konstantas. Hypernews: A MEDIA application for the commercialization of an electronic newspaper. In Proceedings of SACā€™ 98 ā€” The 1998 ACM Symposium on Applied Computing, Mlarriott Marquis, Atlanta: Georgia, U.S.A, Feb. 27ā€“Mar. 1 1998.

    Google ScholarĀ 

  20. N. B. of Standards. The Data Encryption Standard. Technical Report Publication 46, Federal Information Processing Standards, January 1977.

    Google ScholarĀ 

  21. A. Polze. The Object Space Approach: Decoupled Communication in C++. In Proc. Technology of Object-Oriented Languages and Systems (TOOLS 93), 1993.

    Google ScholarĀ 

  22. R. Rivest, A. Shamir, and L. Aldeman. 4 Method for Obtaining Digital Signatures and Public-Key Cryptosystems. CACM, 21(2): 1978.

    Google ScholarĀ 

  23. Sun McroSystems. JavaSpaces Specification. Technical report, Sun Microsystems Inc., July 1998.

    Google ScholarĀ 

  24. D. Tennenhouse. Active networks. In USENIX, editor, 2nd Symposium on Operating Systems Design and Implementation (OSDIā€™ 96), October 28ā€“31, 1996. Seattle, WA, 1996.

    Google ScholarĀ 

  25. R. Tolksdorf. Alice ā€” Basic Model and Subtyping Agents. Technical Report 1993/7, The Technical University of Berlin, 1993.

    Google ScholarĀ 

  26. R. Tolksdorf. Coordinating Java Agents with Multiple Coordination Languages on the Berlinda Platform. In IEEE Workshops on Enabling Technologies: Infiastructure for Collaborative Enterprises (WETICE), 1997.

    Google ScholarĀ 

  27. R. Tolksdorf. Laura: rl Service-Based Coordination Language. Science of Computer ā€” Programming: 31, 1998.

    Google ScholarĀ 

  28. J. Vitek and C. Bryce. Secure WIohile Code: The JavaSeal experiment. In submitted for publication, 1999.

    Google ScholarĀ 

  29. J. Vitek, C. Bryce, and W. Binder. Designing JavaSeal: or How tto make Java safe for agents. In D. Tsichritcis, editor, Electronic Commerce Objects. University of Geneva, 1998.

    Google ScholarĀ 

  30. J. Vitek and G. Castagna. A calculus of secure mobile computations. In Proceedings of the IEEE Workshop on Internet Programming Languages, (WIPL). Chicago, Ill., 1998.

    Google ScholarĀ 

  31. B. S. Yee. A sanctuary for mobile agents. Technical Report CS97-537; UC San Diego: Department of Computer Science and Engineering, Apr. 1997.

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bryce, C., Oriola, M., Vitck, J. (1999). A Coordination Model for Agents based on Secure Spaces. In: Ciancarini, P., Wolf, A.L. (eds) Coordinatio Languages and Models. COORDINATION 1999. Lecture Notes in Computer Science, vol 1594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48919-3_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48919-3_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65836-8

  • Online ISBN: 978-3-540-48919-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics