A General Composition Theorem for Secure Reactive Systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2951, Issue , 2004, Pages 336-354

  Backes, Michael ^a   Pfitzmann, Birgit ^a   Waidner, Michael ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BLACK-BOX SIMULATABILITY; COMPOSITION THEOREM; COMPOSITIONAL PROPERTIES; CONCRETE SECURITIES; POLYNOMIAL NUMBER; REACTIVE SYSTEM; SECURE IMPLEMENTATION; SIMULATABILITY;

CRYPTOGRAPHY;

EID: 35048854169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_19     Document Type: Article

References (34)

1. M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507-534, 1995.
2. M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STAGS), volume 2607 of LNCS, pages 675-686. Springer, 2003.
3. M. Backes and B. Pfitzmann. Computational probabilistic non-interference. In Proc. 7th European Symposium on Research in Computer Security (ESORICS), volume 2502 of LNCS, pages 1-23. Springer, 2002.
4. M. Backes and B. Pfitzmann. Intransitive non-interference for cryptographic purposes. In Proc. 24th IEEE Symposium on Security & Privacy, pages 140-152, 2003.
5. M. Backes, B. Pfitzmann, M. Steiner, and M. Waidner. Polynomial fairness and liveness. In Proc. 15th IEEE Computer Security Foundations Workshop (CSFW), pages 160-174, 2002.
6. D. Beaver. Secure multiparty protocols and zero knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2):15-122, 1991.
7. M. Bellare, J. Killian, and P. Rogaway. The security of cipherblock chaining. In Advances in Cryptology: CRYPTO '94, volume 839 of LNCS, pages 341-358. Springer, 1994.
8. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology: EUROCRYPT '94, volume 950 of LNCS, pages 92-111. Springer, 1994.
9. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 3(1):143-202, 2000.
10. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 136-145, 2001. Extended version in Cryptology ePrint Archive, Report 2000/67, http://eprint.iacr.org/.
11. A. Datta, A. Derek, J. C. Mitchell, and D. Pavlovic. Secure protocol composition (extended abstract). In Proc. 1st ACM Workshop on Formal Methods in Security Engineering (FMSE), pages 11-23, 2003.
12. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
13. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game-or-a completeness theorem for protocols with honest majority. In Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
14. S. Goldvvasser and L. Levin. Fair computation of general functions in presence of immoral majority. In Advances in Cryptology: CRYPTO '90, volume 537 of LNCS, pages 77-93. Springer, 1990.
15. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
16. M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31-60, 2000.
17. C. A. R. Hoare. Communicating Sequential Processes. International Series in Computer Science, Prentice Hall, Hemel Hempstead, 1985.
18. D. M. Johnson and F. Javier Thayer. Security and the composition of machines. In Proc. 1st IEEE Computer Security Foundations Workshop (CSFW), pages 72-89, 1988.
19. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In Proc. 5th ACM Conference on Computer and Communications Security, pages 112-121, 1998.
20. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security analysis. In Proc. 8th Symposium on Formal Methods Europe (FME1999), volume 1708 of LNCS, pages 776-793. Springer, 1999.
21. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, 1996.
22. H. Mantel. On the composition of secure systems. In Proc. 23rd IEEE Symposium on Security & Privacy, pages 88-101, 2002.
23. D. McCullough. Specifications for multi-level security and a hook-up property. In Proc. 8th IEEE Symposium on Security & Privacy, pages 161-166, 1987.
24. D. McCullough. A hookup theorem for multilevel security. IEEE Transactions on Software Engineering, 16(6):563-568, 1990.
25. J. McLean. A general theory of composition for trace sets closed under selective interleaving functions. In Proc. 15th IEEE Symposium on Security & Privacy, pages 79-93, 1994.
26. J. McLean. A general theory of composition for a class of "possibilistic" security properties. IEEE Transactions on Software Engineering, 22(1):53-67, 1996.
27. S. Micali and P. Rogaway. Secure computation. In Advances in Cryptology: CRYPTO '91, volume 576 of LNCS, pages 392-404. Springer, 1991.
28. J. Misra and K. M. Chandy. Proofs of network of processes. IEEE Transactions on Software Engineering, 7(4):417-426, 1981.
29. B. Pfitzmann and M. Waidner. A general framework for formal notions of "secure" systems. Research Report 11/94, University of Hildesheim, Apr. 1994. http://www.semper.org/sirene/lit/abstr94.html\#PfWa_94.
30. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. 7th ACM Conference on Computer and Communications Security, pages 245-254, 2000. Extended version (with Matthias Schunter) IBM Research Report RZ 3206, May 2000, http://BWW.semper.org/s irene/publ/PfSWl_00ReactSimulIBM.ps.gz.
31. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. 22nd IEEE Symposium on Security & Privacy, pages 184-200, 2001. Extended version in Cryptology ePrint Archive, Report 2000/066, http : //eprint.iacr.org/.
32. J. Widom, D. Gries, and R B. Schneider. Trace-based network proof systems: Expressiveness and completeness. ACM Transactions on Programming Languages and Systems, 14(3):396-416, 1992.
33. A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 160-164, 1982.
34. A.C. Yao. Theory and applications of trapdoor functions. In Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 80-91, 1982.