James Riely
ABSTRACT
We present a partially-typed semantics for Dπ, a distributed π-calculus. The semantics is designed for mobile agents in open distributed systems in which some sites may harbor malicious intentions. Nonetheless, the semantics guarantees traditional type-safety properties at "good" locations by using a mixture of static and dynamic type-checking. We show how the semantics can be extended to allow trust between sites, improving performance and expressiveness without compromising type-safety.
- 1.M. Abadi. Secrecy by typing in security protocols. In Proceedings of TACS97, volume 1218 of Lecture Notes in Computer Science, pages 611-637. Springer-Verlag, 1997. Google Scholar
- 2.M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, To appear. Available as SRC Research Report 149 (1998).Google Scholar
- 3.R. Amadio and S. Prasad. Localities and failures. In Proc. 14th Foundations of Software Technology and Theoretical Computer Science, volume 880 of Lecture Notes in Computer Science. Springer-Verlag, 1994. Google ScholarDigital Library
- 4.Roberto Amadio. An asynchronous model of locality, failure, and process mobility. In COORDINATION '97, volume 1282 of Lecture Notes in Computer Science. Springer-Verlag, 1997. Google ScholarDigital Library
- 5.L. CardeUi and A. D. Gordon. Mobile ambients. In Maurice Nivat, editor, Proc. FOSSACS'98, International Conference on Foundations of Software Science and Computation Structures, volume 1378 of Lecture Notes in Computer Science, pages 140-155. Springer-Verlag, 1998. Google Scholar
- 6.Luca Cardelli. A language with distributed scope. Computing Systems, 8(I):27-59, January 1995. A preliminary version appeared in Proceedings of the 22nd ACM Symposium on Principles of Programruing. Google ScholarDigital Library
- 7.Luca Cardelli and Andrew Gordon. Types for mobile ambients. Draft, 1998. Available from http://www, luca. demon, co. uk/.Google Scholar
- 8.Mads Dam. Proving trust in systems of second-order processes. In Hawaii International Conference on Systems Science. IEEE Computer Society Press, 1998. Google ScholarDigital Library
- 9.D. Denning. Certification of programs for secure information flow. Communications of the ACM, 20:504-513, 1977. Google ScholarDigital Library
- 10.C. Foumet, G. Gonthier, J.J. Levy, L. Marganget, and D. Remy. A calculus of mobile agents. In U. Montanari and V. Sassone, editors, CONCUR: Proceedings of the International Conference on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 406--42 I, Pisa, August 1996. Springer-Vedag. Google ScholarDigital Library
- 11.Nevin Heintz and Jon G. Riecke. The SLam calculus: Programming with secrecy and integrity. In Conference Record of the ACM Symposium on Principles of Programming Languages, San Diego, January 1998. ACM Press. Google ScholarDigital Library
- 12.Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. Computer Science Technical Report 2/98, University of Sussex, 1998. Extended abstract in HLCL '98. Available from http://www.elsevier.nl/locate/entcs/ volume 16.3. html.Google Scholar
- 13.Matthew Hennessy and James Riely. Type-safe execution of mobile agents in anonymous networks. Computer Science Technical Report 3/98, University of Sussex, 1998. Available from http: //www. cogs. susx. ac. uk/.Google Scholar
- 14.Frederick Coleville Knabe. Language Support for Mobile Agents. PhD thesis, Carnegie-Mellon University, 1995.Google Scholar
- 15.Dexter Kozen. Efficient code certification. Technical Report 98-1661, Comell University, Department of Computer Science, 1988. Available from http ://www. cs. cornell, edu/kozen/secure. Google ScholarDigital Library
- 16.Robin Milner. The polyadic n-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, October 1991. Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer and H. Schwichtenberg, Springer-Verlag, 1993.Google Scholar
- 17.Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, Parts I and II. Information and Computation, 100:1- 77, September 1992. Google ScholarDigital Library
- 18.Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From System F to typed assembly language. In Conference Record of the ACM Symposium on Principles of Programming Languages, pages 85-97, San Diego, January 1998. ACM Press. Google ScholarDigital Library
- 19.George Necula. Proof-carrying code. In Conference Record of the ACM Symposium on Principles of Programming Languages. ACM Press, January 1996. Google ScholarDigital Library
- 20.Atsuhi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the ACM Symposium on Principles of Programming Languages, Charleston, January 1993. ACM Press. Google ScholarDigital Library
- 21.Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409-454, 1996. Extended abstract in LICS '93.Google ScholarCross Ref
- 22.James Riely and Matthew Hennessy. Trust and partial typing in open systems of mobile agents. Computer Science Technical Report 4/98, University of Sussex, 1998. Available from http://www.cogs. susx.ac.uk/.Google Scholar
- 23.James Riely and Matthew Hennessy. A typed language for distributed mobile processes. In Conference Record of the ACM Symposium on Principles of Programming Languages, San Diego, January 1998. ACM Press. Google ScholarDigital Library
- 24.Tatsurou Sekiguchi and Akinori Yonezawa. A calculus with code mobility. In FMOODS "97, Canterbury, July 1997. Chapman and Hall. Google ScholarDigital Library
- 25.Peter Sewell. Global/local subtyping and capability inference for a distributed n-calculus. In Proceedings of ICALP '98: International Colloquium on Automata, Languages and Programming (Aarhus), number 1443 in LNCS, pages 695-706. Springer-Verlag, July 1998. Google ScholarDigital Library
- 26.Geoffrey Smith and Dennis Volpano. Secure information flow in a multi-threaded imperative language. In Conference Record of the ACM Symposium on Principles of Programming Languages, San Diego, January 1998. ACM Press. Google ScholarDigital Library
- 27.Frank Yellin. Low-level security in Java. In WWW4 Conference, 1995. Available from htZp://www.javasoft.com/sfaq/ verifier, html.Google Scholar
Index Terms
- Trust and partial typing in open systems of mobile agents
Recommendations
Trust and Partial Typing in Open Systems of Mobile Agents
We present a partially typed semantics for Dπ, a distributed π-calculus. The semantics is designed for mobile agents in open distributed systems in which some sites may harbor malicious intentions. Nonetheless, the semantics guarantees traditional type-...
Adopters trust in enterprise open source vendors
We identify three trust factors in enterprise open source software (OSS) vendors.Vendor's embracement of open standards, security and support influence system trust.System trust increases adopters attitudes and intentions in enterprise OSS vendors. ...
Examining Mobile Banking User Trust: A Tripartite Perspective
Building users' trust is crucial to alleviating their perceived risk and facilitating their usage of mobile banking. Drawing on a tripartite perspective of transference-based, personality-based and self-perception-based determinants, this research ...
Comments