Secure implementations of typed channel abstractions

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2007, Pages 251-262

  Bugliesi, Michele ^a   Giunti, Marco ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Full abstraction; Language encodings; Typed behavioral theories

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CRYPTOGRAPHY; EQUIVALENCE CLASSES;

FULL ABSTRACTION; LANGUAGE ENCODINGS; TYPED BEHAVIORAL THEORIES;

SECURITY OF DATA;

EID: 34548278382     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190216.1190253     Document Type: Conference Paper

References (19)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In Proc. of the 28th ACM Symposium on Principles of Programming Languages (POPL '01), pages 104-115. ACM Press, 2001.
2. M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. Information and Computation, 174(1):37-83, April 2002.
3. Martin Abadi. Protection in programming-language translations. In Proc. of ICALP '98, pages 868-883, 1998.
4. Martín Abadi and Bruno Blanchet. Analyzing security protocols with secrecy types and logic programs. J. ACM, 52(1):. 102-146, 2005.
5. Michael Baldamus, Joachim Parrow, and Björn Victor. A fully abstract encoding of the π-calculus with data terms. In Proc. of ICALP '05, pages 1202-1213, 2005.
6. Bruno Blanchet. From Secrecy to Authenticity in Security Protocols. In Manuel Hermenegildo and Germán Puebla, editors, 9th International Static Analysis Symposium (SAS'02), volume 2477 of Lecture Notes on Computer Science, pages 342-359, Madrid, Spain, September 2002. Springer Verlag.
7. Bruno Blanchet. Automatic Proof of Strong Secrecy for Security Protocols. In IEEE Symposium on Security and Privacy, pages 86-100, Oakland, California, May 2004.
8. M. Boreale, R. De Nicola, and R. Pugliese. Proof techniques for cryptographic processes. SIAM Journal on Computing, 31(3):947-986, 2001.
9. Michele Boreale. On the expressiveness of internal mobility in namepassing calculi. Theor: Comput. Sci., 195(2):205-226, 1998.
10. M. Bugliesi and M. Giunti. Typed processes in untyped contexts. In Rocco Nicola and Davide Sangiorgi, editors, Proc. of TGC 2005, Symposium on Trustworthy Global Computing, volume 3705 of Lecture Notes on Computer Science, pages 19-32. Springer-Verlag, 2005.
11. Cédric Fournet and Cosimo Laneve. Bisimulations in the joincalculus. Theor: Comput. Sci., 266(1-2):569-603, 2001.
12. Cédric Fournet. The Join-Calculus: a Calculus for Distributed Mobile Programming. PhD thesis, Ecole Polytechnique, Palaiseau., November 1998. Also published by INRIA, TU-0556.
13. Marco Giunti. Secure Implementation of Typed Channel Abstractions. PhD thesis, Università di Venezia, 2007. Forthcoming.
14. M. Hennessy and J. Rathke. Typed behavioral equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science, 14(5):651-684, 2003.
15. Kohei Honda and Nobuko Yoshida. On reduction-based process semantics. Theor: Comput. Sci., 151(2):437-486, 1995.
16. Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. Inf. Comput., 163(1):1-59, 2000.
17. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5), 1996.
18. Benjamin C. Pierce and Davide Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. J. ACM, 47(3):531-584, 2000.
19. D. Sangiorgi and D. Walker. The π-calculus A theory of mobile processes. Cambridge, 2001.