A General Composition Theorem for Secure Reactive Systems

Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography, i.e., the specification is an ideal system and a real system should in some sense simulate this ideal one. We show that if a system consists of a polynomial number of arbitrary ideal subsystems such that each of them has a secure implementation in the sense of blackbox simulatability, then one can securely replace all ideal subsystems with their respective secure counterparts without destroying the blackbox simulatability relation. We further prove our theorem for universal simulatability by showing that blackbox simulatability implies universal simulatability under reasonable assumptions. We show all our results with concrete security.

• Type: Conference
• Year: 2004
• Where: TCC
• Authors: Michael Backes, Birgit Pfitzmann, Michael Waidner
• Keywords: Blackbox Simulatability, Cryptography, Ideal, Ideal Subsystems, TCC 2004