Secure implementation of channel abstractions

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 105-116

  Abadi, Martín ^a   Fournet, Cédric ^b   Gonthier, Georges ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CALCULATIONS; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; NETWORK SECURITY; PROGRAM TRANSLATORS; TRANSLATION (LANGUAGES);

CHANNEL ABSTRACTIONS; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; ENCRYPTED COMMUNICATION; LOWER LEVEL LANGUAGE; REMOTE METHOD INVOCATIONS; REMOTE PROCEDURE CALL; SECURE IMPLEMENTATION;

HIGH LEVEL LANGUAGES;

EID: 84982909952     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705647     Document Type: Conference Paper

References (35)

1. M. Abadi. Secrecy by typing in security protocols. In Theoretical Aspects of Computer Software, volume 1281 of Lecture Notes in Computer Science, pages 611{ 638. Springer-Verlag, 1997.
2. M. Abadi. Protection in programming-language translations. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming, July 1998. To appear.
3. M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. Manuscript, full version of this paper, on the Web at http://pauillac.inria.fr/join, 1998.
4. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Technical Report 414, University of Cambridge Computer Laboratory, Jan. 1997. Extended version of both [5] and [6]. A revised version appeared as Digital Equipment Corporation Systems Research Center report No. 149, January 1998, and an abridged version will appear in Information and Computation.
5. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, pages 36{47, April 1997.
6. M. Abadi and A. D. Gordon. Reasoning about cryptographic protocols in the spi calculus. In A. Mazurkiewicz and J. Winkowski, editors, Proceedings of the 8th International Conference on Concurrency Theory, volume 1243 of Lecture Notes in Computer Science, pages 59{73. Springer-Verlag, July 1997.
7. K. F. Alden and E. P. Wobber. The AltaVista tunnel: Using the Internet to extend corporate networks. Digital Technical Journal, 9(2):5{15, Oct. 1997. On the Web at http://www.digital.com/info/DTJQ01/DTJQ01HM.HTM.
8. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Comput. Sci., 96:217{248, 1992.
9. A. D. Birrell. Secure communication using remote procedure calls. ACM Transactions on Computer Systems, 3(1):1{14, Feb. 1985.
10. E. Brinksma, A. Rensink, and W. Vogler. Fair testing. In I. Lee and S. A. Smolka, editors, Proceedings of the 6th International Conference on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 313{327. Springer-Verlag, 1995.
11. P.-C. Cheng, J. A. Garay, A. Herzberg, and H. Krawczyk. Design and implementation of modular key management protocol and IP secure tunnel on AIX. In Proceedings of the 5th USENIX UNIX Security Symposium, June 1995.
12. 10th IEEE Computer Security Foundations Workshop. IEEE Computer Society, 1997. Proceedings.
13. M. Dam. Proving trust in systems of second-order processes: Preliminary results. Draft, 1997.
14. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Comput. Sci., 34:83{ 133, 1984.
15. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proceedings of POPL '96, pages 372{385. ACM, Jan. 1996.
16. C. Fournet, G. Gonthier, J.-J. Levy, L. Maranget, and D. Remy. A calculus of mobile agents. In U. Montanari and V. Sassone, editors, Proceedings of the 7th International Conference on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science. Springer- Verlag, Aug. 1996.
17. C. Fournet, C. Laneve, L. Maranget, and D. Remy. Implicit typing a la ML for the join-calculus. In A. Mazurkiewicz and J. Winkowski, editors, Proceedings of the 8th International Conference on Concurrency Theory, volume 1243 of Lecture Notes in Computer Science, pages 196{212. Springer-Verlag, July 1997.
18. C. Fournet and L. Maranget. The join-calculus language. Web pages at http://pauillac.inria.fr/join, June 1997.
19. C. A. R. Hoare. Proof of correctness of data representations. Acta Inf., 1:271{281, 1972.
20. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Comput. Sci., 151:437{486, 1995.
21. B. Lampson, M. Abadi, M. Burrows, and E. Wobber. Authentication in distributed systems: Theory and practice. ACM Transactions on Computer Systems, 10(4):265{310, Nov. 1992.
22. J. Linn. RFC 1508: Generic security service application program interface. Web page at ftp://ds.internic.net/rfc/rfc1508.txtSept. 1993.
23. J. Linn. Generic interface to security services. Computer Communications, 17(7):476{482, July 1994.
24. D. L. McDonald, B. G. Phan, and R. J. Atkinson. A socket-based key management API (and surrounding infrastructure). In Proceedings of INET96, 1996. On the Web at http://www.isoc.org/isoc/whatis/conferences/inet/96/proceedings/.
25. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
26. Microsoft. CryptoAPI. Web pages at http://www.microsoft.com/security/tech/.
27. R. Milner. Communication and Concurrency. Prentice Hall International, 1989.
28. R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119{141, 1992.
29. R. Milner. The polyadic π-calculus: A tutorial. In Bauer, Brauer, and Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, 1993.
30. R. Milner, J. Parrow, and D.Walker. A calculus of mobile processes, parts I and II. Information and Computation, 100:1{40 and 41{77, Sept. 1992.
31. R. M. Needham and M. D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993{999, Dec. 1978.
32. D. Sangiorgi and R. Milner. The problem of "weak bisimulation up to". In W. R. Cleaveland, editor, Proceedings of CONCUR'92, volume 630 of Lecture Notes in Computer Science, pages 32{46. Springer-Verlag, 1992.
33. Sun Microsystems, Inc. RMI enhancements. Web pages at http://java.sun.com/products/jdk/1.2/docs/guide/rmi/index.html 1997.
34. L. van Doorn, M. Abadi, M. Burrows, and E. Wobber. Secure network objects. In Proceedings 1996 IEEE Symposium on Security and Privacy, pages 211{221, May 1996.
35. A. Wollrath, R. Riggs, and J. Waldo. A distributed object model for the Java system. Computing Systems, 9(4):265{290, Fall 1996.