A bisimulation for dynamic sealing

Theoretical Computer Science

Volumn 375, Issue 1-3, 2007, Pages 169-192

  Sumii, Eijiro ^a   Pierce, Benjamin C ^b  

^a TOHOKU UNIVERSITY   (Japan)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

calculus; Bisimulation; Contextual equivalence; Cryptographic protocols; Data abstraction; Dynamic sealing; Encryption; Information hiding; Security

Indexed keywords

ABSTRACTING; CRYPTOGRAPHY; SECURITY OF DATA;

Λ-CALCULUS; BISIMULATION; CONTEXTUAL EQUIVALENCE; CRYPTOGRAPHIC PROTOCOLS; DATA ABSTRACTION; DYNAMIC SEALING; INFORMATION HIDING;

COMPUTER SIMULATION;

EID: 34047126463     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.12.032     Document Type: Article

References (34)

1. Martín Abadi, Cédric Fournet, Mobile values, new names, and secure communication, in: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001, pp. 104-115
2. Abadi M., and Gordon A.D. A bisimulation method for cryptographic protocols. Nordic Journal of Computing 5 (1998) 267-303
3. Abadi M., and Gordon A.D. A bisimulation method for cryptographic protocols. 7th European Symposium on Programming. Lecture Notes in Computer Science vol. 1381 (1998), Springer-Verlag 12-26 (preliminary version)
4. Abadi M., and Gordon A.D. A calculus for cryptographic protocols: The spi calculus. Information and Computation 148 1 (1999) 1-70 Proceedings of the 4th ACM Conference on Computer and Communications Security, 1997, pp. 36-47 (preliminary version)
5. Abramsky S. The lazy lambda calculus. In: Turner D.A. (Ed). Research Topics in Functional Programming (1990), Addison-Wesley 65-117
6. Boreale M., De Nicola R., and Pugliese R. Proof techniques for cryptographic processes. SIAM Journal on Computing 31 3 (2002) 947-986 14th Annual IEEE Symposium on Logic in Computer Science, 1999, pp. 157-166 (preliminary version)
7. Borgström J., and Nestmann U. On bisimulations for the spi calculus. 9th International Conference on Algebraic Methodology and Software Technology. Lecture Notes in Computer Science vol. 2422 (2002), Springer-Verlag 287-303
8. Derek Dreyer, Karl Crary, Robert Harper, A type system for higher-order modules, in: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003, pp. 236-249
9. Grossman D., Morrisett G., and Zdancewic S. Syntactic type abstraction. ACM Transactions on Programming Languages and Systems 22 6 (2000) 1037-1080 Principals in programming languages: A syntactic proof technique, in: Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (extended abstract), 1999, pp. 197-207
10. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation 124 2 (1996) 103-112
11. Alan Jeffrey, Julian Rathke, Towards a theory of bisimulation for local names, in: 14th Annual IEEE Symposium on Logic in Computer Science, 1999, pp. 56-66
12. Jeffrey A., and Rathke J. A theory of bisimulation for a fragment of Concurrent ML with local names. Theoretical Computer Science 323 (2004) 1-48 15th Annual IEEE Symposium on Logic in Computer Science (extended abstract), 2000, pp. 311-321
13. James J. Leifer, Gilles Peskine, Peter Sewell, Keith Wansbrough, Global abstraction-safe marshalling with hash types, in: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003, pp. 87-98
14. Xavier Leroy, Applicative functors and fully transparent higher-order modules, in: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995, pp. 142-153
15. Barbara Liskov, A history of CLU, in: The Second ACM SIGPLAN Conference on History of Programming Languages, 1993, pp. 133-147
16. Lowe G. An attack on the Needham-Schroeder public-key authentication protocol. Information Processing Letters 56 3 (1995) 131-133
17. Milner R. Communicating and Mobile Systems: The π-Calculus (1999), Cambridge University Press
18. Mitchell J.C. On the equivalence of data representations. Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy (1991), Academic Press 305-330
19. Mitchell J.C., and Plotkin G.D. Abstract types have existential types. ACM Transactions on Programming Languages and Systems 10 3 (1988) 470-502 Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1985, pp. 37-51 (preliminary version)
20. James H. Morris Jr., Lambda-Calculus Models of Programming Languages, Ph.D. Thesis, Massachusetts Institute of Technology, 1968
21. Morris Jr. J.H. Protection in programming languages. Communications of the ACM 16 1 (1973) 15-21
22. James H. Morris Jr., Types are not sets, in: Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1973, pp. 120-124
23. Needham R., and Schroeder M. Using encryption for authentication in large networks of computers. Communications of the ACM 21 12 (1978) 993-999
24. Benjamin C. Pierce, Eijiro Sumii, Relating cryptography and polymorphism, 2000. Draft. http://www.kb.ecei.tohoku.ac.jp/~sumii/pub/
25. Pitts A.M. Existential types: Logical relations and operational equivalence. Automata, Languages and Programming. Lecture Notes in Computer Science vol. 1443 (1998), Springer-Verlag 309-326
26. Pitts A.M. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science 10 (2000) 321-359 HOOTS II Second Workshop on Higher-Order Operational Techniques in Semantics, in: Electronic Notes in Theoretical Computer Science, vol. 10, 1998 (preliminary version)
27. Pitts A.M., and Stark I. Observable properties of higher order functions that dynamically create local names, or: what's new?. Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. 711 (1993), Springer-Verlag 122-141
28. John C. Reynolds, Types, abstraction and parametric polymorphism, in: Information Processing 83, Proceedings of the IFIP 9th World Computer Congres, 1983, pp. 513-523
29. Andreas Rossberg, Generativity and dynamic opacity for abstract types, in: Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003, pp. 241-252
30. Sangiorgi D., and Milner R. The problem of "weak bisimulation up to". CONCUR '92, Third International Conference on Concurrency Theory. Lecture Notes in Computer Science vol. 630 (1992), Springer-Verlag 32-46
31. Peter Sewell, Modules, abstract types, and distributed versioning, in: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001, pp. 236-247
32. Ian Stark, Names and Higher-Order Functions. Ph.D. Thesis, University of Cambridge, http://homepages.inf.ed.ac.uk/stark/namhof.html, 1994
33. Sumii E., and Pierce B.C. Logical relations for encryption. Journal of Computer Security 11 4 (2003) 521-554 14th IEEE Computer Security Foundations Workshop, 2001, pp. 256-269 (extended abstract)
34. Eijiro Sumii, Benjamin C. Pierce, A bisimulation for type abstraction and recursion, in: Technical Report MS-CIS-04-27, Department of Computer and Information Science, University of Pennsylvania, http://www.kb.ecei.tohoku.ac.jp/~sumii/pub/, 2004. Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005, pp. 63-74 (extended abstract)