(Enter summary)
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... (Update)
Cited by: More
Comparing Two Notions of Simulatability - Dennis Hofheinz And
(Correct)
Layered Specifications Framework for Analysis of.. - Bar-Ilan University..
(Correct)
On the Relationships between Notions of.. - Datta, Küsters.. (2006)
(Correct)
Active bibliography (related documents): More All
1.4: A General Composition Theorem for Secure Reactive Systems - Backes, Pfitzmann, Waidner (2004)
(Correct)
0.7: Secure Asynchronous Reactive Systems - Backes, Pfitzmann, Waidner (2004)
(Correct)
0.4: A Composable Cryptographic Library with Nested.. - Backes, Pfitzmann.. (2003)
(Correct)
Similar documents based on text: More All
0.7: Symmetric Authentication within a Simulatable.. - Backes, Pfitzmann.. (2003)
(Correct)
0.6: Low-level Ideal Signatures and General Integrity Idealization - Backes, Pfitzmann, Waidner (2004)
(Correct)
0.6: Reactively Secure Signature Schemes - Backes, Pfitzmann, Waidner (2003)
(Correct)
Related documents from co-citation: More All
62: Universally composable security: A new paradigm for cryptographic protocols
- Canetti - 2001
10: Model for asynchronous reactive systems and its application to secure message tr..
- Ptzmann, Waidner
7: Security and composition of multi-party cryptographic protocols
- Canetti - 1998
BibTeX entry: (Update)
M. Backes, B. P tzmann and M. Waidner, A General Composition Theorem for Secure Reactive Systems, 1st TCC, 2004. http://citeseer.ist.psu.edu/backes04general.html More
@misc{ backes04general,
author = "M. Backes and B. tzmann and M. Waidner",
title = "A General Composition Theorem for Secure Reactive Systems",
text = "M. Backes, B. P tzmann and M. Waidner, A General Composition Theorem for
Secure Reactive Systems, 1st TCC, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/backes04general.html" }
Citations (may not include all citations):
718
Distributed Algorithms (context) - Lynch - 1996
404
Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
339
Theory and applications of trapdoor functions (context) - Yao - 1982
189
Universally composable security: A new paradigm for cryptogr..
- Canetti - 2000 DBLP
179
Security and composition of multiparty cryptographic protoco..
- Canetti - 2000 DBLP
168
ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1995
167
Protocols for secure computations (context) - Yao - 1982
165
Optimal asymmetric encryption
- Bellare, Rogaway - 1994 DBLP
140
How to play any mental game -- or -- a completeness theorem .. (context) - Goldreich, Micali et al. - 1987
120
Secure computation (context) - Micali, Rogaway - 1991
114
A probabilistic poly-time framework for protocol analysis
- Lincoln, Mitchell et al. - 1998 ACM DBLP
108
International Series in Computer Science (context) - Hoare, Processes - 1985
99
Foundations of Cryptography: Basic Tools (context) - Goldreich - 2001 DBLP
98
Fair computation of general functions in presence of immoral.. (context) - Goldwasser, Levin - 1990 ACM DBLP
95
The security of cipherblock chaining
- Bellare, Killian et al.
90
Secure multiparty protocols and zero knowledge proof systems.. (context) - Beaver - 1991
77
Composition and integrity preservation of secure reactive sy..
- Pfitzmann, Waidner - 2000 ACM DBLP
75
IEEE Transactions on Software Engineering (context) - Misra, Chandy et al. - 1981
60
Specifications for multi-level security and a hook-up proper.. (context) - McCullough - 1987
56
A general theory of composition for trace sets closed under ..
- McLean - 1994
46
Probabilistic polynomial-time equivalence and security analy..
- Lincoln, Mitchell et al. - 1999
40
Player simulation and general adversary structures in perfec..
- Hirt, Maurer - 2000 DBLP
26
possibilistic (context) - McLean, theory et al. - 1996
23
Security and the composition of machines (context) - Johnson, Thayer - 1988 DBLP
23
Cryptographically sound and machine-assisted verification of..
- Backes, Jacobi - 2003 ACM DBLP
17
IEEE Transactions on Software Engineering (context) - McCullough, theorem et al. - 1990
16
Computational probabilistic non-interference
- Backes, Pfitzmann - 2002 ACM DBLP
15
the composition of secure systems (context) - Mantel - 2002
11
Polynomial fairness and liveness
- Backes, Pfitzmann et al. - 2002 ACM DBLP
7
Secure protocol composition (context) - Datta, Derek et al. - 2003 ACM
6
Amodel for asynchronous reactive systems and its application.. (context) - Pfitzmann, Waidner - 2000
5
Intransitive non-interference for cryptographic purposes
- Backes, Pfitzmann - 2003 ACM
5
A general framework for formal notions (context) - Pfitzmann, Waidner - 1994
4
Trace-based network proof systems: Expressiveness and comple.. (context) - Widom, Gries et al. - 1992 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zurich.ibm.com/security/publications/2004.html): More
Polynomial Liveness - Backes, Pfitzmann, Waidner, Steiner (2003)
(Correct)
R. Dingledine (ed.), Proc. 3rd Workshop on Privacy.. - Springer-Verlag.. (2003)
(Correct)
Federated Identity-Management Protocols - Where User Authentication (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC