Cryptographic types

Proceedings of the Computer Security Foundations Workshop

Volumn 2002-January, Issue , 2002, Pages 238-252

  Duggan, D ^a  

^a Stevens Institute of Technology   (United States)

Author keywords

Computer languages; Computer science; Cryptographic protocols; IP networks; Pervasive computing; Protection; Public key; Public key cryptography; Runtime; Telecommunication traffic

Indexed keywords

CALCULATIONS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; INTERNET PROTOCOLS; JAVA PROGRAMMING LANGUAGE; NETWORK SECURITY; PROGRAM COMPILERS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; SECURITY SYSTEMS; TELECOMMUNICATION TRAFFIC; UBIQUITOUS COMPUTING;

CRYPTOGRAPHIC PROTOCOLS; IP NETWORKS; PROTECTION; PUBLIC KEYS; RUNTIMES;

CRYPTOGRAPHY;

EID: 84948736825     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2002.1021819     Document Type: Conference Paper

References (39)

1. M. Abadi. Security by typing in security protocols. In Theoretical Aspects of Computer Science, pages 611-638, 1997.
2. M. Abadi. Protection in programming-language translations. In Proceedings of the International Conference on Automata, Languages and Programming, 1998.
3. M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems, 13(2):237-268, 1991.
4. M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. In Proceedings of IEEE Symposium on Logic in Computer Science, 1998.
5. M. Abadi, C. Fournet, and G. Gonthier. Secure communications processing for distributed languages. In IEEE Symposium on Security and Privacy, 1999.
6. M. Abadi, C. Fournet, and G. Gonthier. A top-down look at a secure message. In Foundations of Software Technology and Theoretical Computer Science, pages 122-141, 1999.
7. M. Abadi, C. Fournet, and G. Gonthier. Authentication primitives and their compilation. In Proceedings of ACM Symposium on Principles of Programming Languages, 2000.
8. M. Abadi and A. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, January 1999.
9. M. Abadi, B. Lampson, M. Burrows, and E. Wobber. Authentication in distributed systems: Theory and practice. ACM Trans. Comput. Syst., 10(4):265-310, 1992. Also appeared as SRC Research Report 83.
10. R. M. Amadio. An asynchronous model of locality, failure and process mobility. In COORDINATION'97, volume 1282 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
11. R. M. Amadio, L. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous pi-calculus. Theoretical Computer Science, 195(2):291-324, 1998.
12. A. Appel and E. Felten. Proof-carrying authentication. In ACM Symposium on Security, 2000.
13. M. Blaze, J. Feigenbaum, and J. Lacy. Decentralized trust management. In IEEE Symposium on Security and Privacy, 1996.
14. L. Cardelli. Abstractions for mobile computation. In J. Vitek and C. Jensen, editors, Secure Internet Programming: Security Issues for Distributed and Mobile Objects, volume 1603 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
15. L. Cardelli, G. Ghelli, and A. D. Gordon. Secrecy and group creation. In Concurrency Theory (CONCUR). Springer-Verlag, 2000.
16. L. Cardelli and A. Gordon. Mobile ambients. In M. Nivat, editor, Foundations of Software Science and Computational Structures, volume 1378 of Lecture Notes in Computer Science, pages 140-155. Springer-Verlag, 1998.
17. G. Castagna and J. Vitek. A calculus of secure mobile computations. In Internet Programming Languages, Lecture Notes in Computer Science. Springer-Verlag, 1999.
18. W. Clinger and J. Rees, editors. IEEE Standard for the Scheme Programming Language. Institute for Electrical and Electronic Engineers, 1991. IEEE Standard 1178-1990.
19. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Communications of the ACM, 1977.
20. D. Duggan. Dynamic typing for distributed programming in polymorphic languages. ACM Transactions on Programming Languages and Systems, 21(1):11-45, January 1999.
21. C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi (extended abstract). In ICALP, volume 1443 of Lecture Notes in Computer Science, pages 844-855. Springer-Verlag, 1998.
22. T. Freeman and F. Pfenning. Refinement types for ML. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 268-277. ACM Press, 1991.
23. A. D. Gordon and A. Jeffrey. Authenticity by typing for security protocols. In IEEE Computer Security Foundations Workshop (CSFW), June 2001.
24. A. D. Gordon and A. Jeffrey. Typing correspondence assertions for communication protocols. In Mathematical Foundations of Programming Semantics (MFPS), May 2001.
25. M. Hennessy and J. Riely. Type-safe execution of mobile agents in anonymous networks. In Secure Internet Programming: Security Issues for Distributed and Mobile Objects, Lecture Notes in Computer Science. Springer-Verlag, 1999.
26. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In European Conference on Object-Oriented Programming, Lecture Notes in Computer Science, pages 133-147. Springer-Verlag, 1991.
27. R. Milner. The polyadic π-calculus: A tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, volume 94 of Computer and Systems Sciences, pages 203-246. Springer-Verlag, 1993.
28. J. Mitchell and G. Plotkin. Abstract types have existential types. ACM Transactions on Programming Languages and Systems, 10(3):470-502, 1988.
29. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. In Proceedings of ACM Symposium on Principles of Programming Languages, 1998.
30. A. C. Myers and B. Liskov. Complete, safe information flow with decentralized labels. In IEEE Symposium on Security and Privacy, 1998.
31. G. Necula. Proof-carrying code. In Proceedings of ACM Symposium on Principles of Programming Languages, 1997.
32. G. Necula and P. Lee. Safe kernel extensions without runtime checking. In Operating Systems Design and Implementation, 1996.
33. F. Pottier and S. Conchon. Information flow inference for free. In Proceedings of ACM International Conference on Functional Programming, 2000.
34. J. Riely and M. Hennessy. Trust and partial typing in open systems of mobile agents. In Proceedings of ACM Symposium on Principles of Programming Languages, 1999.
35. D. Sangiorgi. Asynchronous process calculi: The first-order and higher-order paradigms. Theoretical Computer Science, 1999.
36. E. Sumii and B. C. Pierce. Logical relations for encryption. In Computer Security Foundations Workshop, June 2001.
37. D. Volpano and G. Smith. A type-based approach to program security. In Proceedings of the International Joint Conference on Theory and Practice of Software Development. Springer-Verlag, 1997.
38. T. Y. C. Woo and S. S. Lam. Authentication for distributed systems. Computer, 25(1):39-52, 1992.
39. T. Y. C. Woo and S. S. Lam. A semantic model for authentication protocols. In IEEE Symposium on Security and Privacy, pages 178-194, 1993.