Logical relations for encryption

Journal of Computer Security

Volumn 11, Issue 4, 2003, Pages 521-554

  Sumii, Eijiro ^a   Pierce, Benjamin C ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; THEOREM PROVING;

LOGICAL RELATIONS;

SECURITY OF DATA;

EID: 0141751786     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2003-11403     Document Type: Conference Paper

References (39)

1. M. Abadi, Secrecy by typing in security protocols, Journal of the ACM 46(5) (1999), 749-786.
2. M. Abadi and A.D. Gordon. A bisimulation method for cryptographic protocols, Nordic Journal of Computing 5 (1998), 267-303.
3. M. Abadi and A.D. Gordon, A calculus for cryptographic protocols: The spi calculus, Information and Computation, 148(1) (1999), 1-70. A preliminary version appeared in: Proceedings of the 4th ACM Conference on Computer and Communications Security. 1997, pp. 36-47.
4. M. Abadi and C. Fournet, Mobile values, new names, and secure communication, in: Proceedings of the 28th ACM S1GPLAN-SIGACT Symposium on Principles of Programming Languages, 2001, pp. 104-115.
5. G.M. Bierman, A.M. Pitts and C.V. Russo, Operational properties of Lily, a polymorphic linear lambda calculus with recursion, in: Higher Order Operational Techniques in Semantics, Volume 41 of Electronic Notes in Theoretical Computer Science, Elsevier Science, 2000.
6. L. Birkedal and R. Harper, Relational interpretations of recursive types in an operational setting, Information and Computation 155(1-2) (1999), 3-63.
7. M. Boreale. R. De Nicola and R. Pugliese, Proof techniques for cryptographic processes, 1999. ftp://rap.dsi.unifi.it/pub/papers/spi.ps.gz. An extended and revised version of the paper that appeared in 14th Annual IEEE Symposium on Logic in Computer Science. 1999, pp. 157-166.
8. D. Dolev and A.C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory 29(2) (1983), 198-208.
9. A. Durante, R. Focardi and R. Gorrieri, CVS: A compiler for the analysis of cryptographic protocols, in: 12th IEEE Computer Security Foundations Workshop, 1999, pp. 203-212.
10. A. Durante, R. Focardi and R. Gorrieri, A compiler for analysing cryptographic protocols using noninterference, ACM Transactions on Software Engineering and Methodology 9(4) (2000), 488-528.
11. A.D. Gordon and A. Jeffrey, Authenticity by typing for security protocols, in: 14th IEEE Computer Security Foundations Workshop, 2001. pp. 145-159.
12. J. Heather, G. Lowe and S. Schneider, How to prevent type flaw attacks on security protocols, in: /3th IEEE Computer Security Foundations Workshop, 2000, pp. 255-268.
13. N. Heintze and E. Clarke, eds, Workshop on Formal Methods and Security Protocols, 1999. http://cm.bell-labs.com/cm/cs/who/nch/fmsp99/.
14. N. Heintze and J.G. Riecke, The SLam calculus: Programming with secrecy and integrity, in: Proceedings of the 25th ACM SIOPLAN-SICACT Symposium on Principles of Programming Languages, 1998.
15. M. Hennessy and J. Riely, Information flow vs. resource access in the asynchronous pi-calculus, in: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, Volume 1853 of Lecture Notes in Computer Science, Springer-Verlag, 2000, pp. 415-427.
16. K. Honda and N. Yoshida, A uniform framework for secure information flow, in: Proceedings of the 29th ACM SIOPLAN-SIGACT Symposium on Principles of Programming Languages. 2002, pp. 81-92.
17. IEEE computer security foundations workshop, http://www2.csl.sri.com/csfw/index.html.
18. G. Lowe, An attack on the Needham-Schroeder public-key authentication protocol, Information Processing Letters 56(3) (1995), 131-133.
19. C. Meadows, Formal verification of cryptographic protocols: A survey, in: Advances in Cryptology Asiacrypt '94, Volume 917 of Lecture Notes in Computer Science. Springer-Verlag, 1995, pp. 133-150.
20. C. Meadows, Open issues in formal methods for cryptographic protocol analysis, in: DARPA Information Survivability Conference and Exposition, IEEE Computer Society, 2000, pp. 237-250.
21. J.K. Millen, A necessarily parallel attack, in: Workshop on Formal Methods and Security Protocols. 1999. http://www.cs.bell-labs.com/who/ncn/fmsp99/program.html.
22. J.C. Mitchell, Foundations for Programming Languages, MIT Press, 1996.
23. J.H. Morris Jr. Protection in programming languages, Communications of the ACM 16(1) (1973) 15-21.
24. R. Needham and M. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM 21(12) (1978) 993-999.
25. B. Pierce and D. Sangiorgi, Typing and subtyping for mobile processes, in: Eighth Annual IEEE Symposium on Logic in Computer Science, 1993, pp. 376-385. Full version in Mathematical Structures in Computer Science 6(5) (1996) 409-453.
26. B. Pierce and E. Sumii, Relating cryptography and polymorphism, 2000. Manuscript: http://www.yl.is. s.u-tokyo.ac.jp/̃sumii/pub/infohide.ps.gz.
27. A.M. Pitts, Existential types: Logical relations and operational equivalence, in: Proceedings of the 25th International Colloquium on Automata, Languages and Programming, Volume 1443 of Lecture Notes in Computer Science, Springer-Verlag, 1998, pp. 309-326.
28. A.M. Pitts, Parametric polymorphism and operational equivalence, Mathematical Structures in Computer Science 10 (2000) 321-359. A preliminary version appeared in HOOTS II Second Workshop on Higher-Order Operational Techniques in Semantics, Electronic Notes in Theoretical Computer Science, Vol. 10,1998.
29. A.M. Pitts and J.R.X. Ross, Process calculus based upon evaluation to committed form, Theoretical Computer Science 195 (1998), 155-182. A preliminary version appeared in: CONCUR 196; Concurrency Theory, Lecture Notes in Computer Science, Springer-Verlag, Vol. 1119, 1996, pp. 18-33.
30. A.M. Pitls and I. Stark, Operational reasoning for functions with local state, in: Higher Order Operational Techniques in Semantics, Cambridge University Press, 1998, pp. 227-273.
31. F. Pottier, A simple view of type-secure information flow in the π-calculus, in: 15th IEEE Computer Security Foundations Workshop, 2002, pp. 320-330.
32. F. Pottier and V. Simonet, Information flow inference for ML, in: Proceedings of the 29th ACM SIGPLAN-SICACT Symposium on Principles of Programming Languages, 2002, pp. 319-330.
33. J.C. Reynolds, Types, abstraction and parametric polymorphism, in: Information Processing 83, Proceedings of the IFIP 9th World Computer Congress, 1983, pp. 513-523.
34. P.Y.A. Ryan and S.A. Schneider, Process algebra and non-interference, in: 12th IEEE Computer Security Foundations Workshop,1999, pp. 214-227.
35. G. Smith and D. Volpano, Secure information flow in a multi-threaded imperative language, in: Proceedings of the 25th ACM SIGPLAN-SICACT Symposium on Principles of Programming Languages, 1998, pp. 355-364.
36. I. Stark, Names and higher-order functions, PhD thesis. University of Cambridge, 1994. http://www.dcs.ed.ac.uk/home/stark/publications/thesis.htrnl.
37. D.N. Turner, The polymorphic pi-calculus: theory and implementation, PhD thesis, University of Edinburgh, 1995.
38. D. Volpano, Formalization and proof of secrecy properties, in: 12th IEEE Computer Security Foundations Workshop, 1999, pp. 92-95.
39. P. Wadler, Theorems for free! in: Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, ACM, 1989. pp. 347-359.