Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters  Home/Search
Context
Related
| iacr.org/2006/132.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositionality guarantees, which are achieved by universally quantifying over all environmental behaviors of the analyzed protocol. As a consequence, however, protocols that are secure except for certain environmental behaviors are not simulatable, even if these behaviors are efficiently identifiable and thus can be prevented by... (Update)
Active bibliography (related documents): More All
1.8: Limits of the Reactive Simulatability/UC of Dolev-Yao.. - Backes, Pfitzmann.. (2006) (Correct)
0.5: The Impossibility of Realizable Ideal Functionality - Datta, Derek, Mitchell.. (2005) (Correct)
0.4: On the Relationships between Notions of.. - Datta, Küsters.. (2006) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ backes-conditional,
author = "Michael Backes and Markus Dürmuth and Dennis Hofheinz and Ralf Küsters",
title = "Conditional Reactive Simulatability",
url = "citeseer.ist.psu.edu/backes06conditional.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
339 Theory and applications of trapdoor functions (context) - Yao
189 Universally composable security: A new paradigm for cryptogr.. - Canetti
189 Universally composable security: A new paradigm for cryptogr.. - Canetti
120 Secure computation (context) - Micali, Rogaway - 1992
98 How to play any mental game---a completeness theorem for pro.. (context) - Goldreich, Micali et al.
85 Encryption modes with almost free message integrity - Jutla
78 Specification and design (context) - Jones - 1983
78 Foundations of secure interactive computing (context) - Beaver - 1992
75 IEEE Transactions of Software Engineering (context) - Misra, Chandy et al. - 1981
74 A model for asynchronous reactive systems and its applicatio.. - Pfitzmann, Waidner
56 Universally composable commitments - Canetti, Fischlin
56 Fast encryption and authentication: Xcbc encryption and xecb.. - Gligor, Donescu - 2001
43 Universally composable two-party and multi-party secure comp.. - Canetti, Lindell et al.
34 A composable cryptographic library with nested operations - Backes, Pfitzmann et al.
30 A general composition theorem for secure reactive systems - Backes, Pfitzmann et al.
22 Symmetric encryption in a simulatable Dolev-Yao style crypto.. - Backes, Pfitzmann
19 the composition of authenticated byzantine agreement - Lindell, Lysyanskaya et al.
11 Secure asynchronous reactive systems - Backes, Pfitzmann et al.
11 General composition and universal composability in secure mu.. - Lindell
6 New notions of security: Achieving universal composability w.. - Prabhakaran, Sahai
4 the relationships between notions of simulationbased securit.. - Datta, Ksters et al.
4 Limit Reactive SimulatabilityUC Dolev Yao model with hashe - Birgit, Michael et al.
2 Games and the impossibility of realizable ideal functionalit.. (context) - Datta, Derek et al.
2 Limits of the cryptographic realization of Dolev-Yao-style X.. - Backes, Pfitzmann
2 Universally composable commitments using random oracles (context) - Hofheinz, Mller-Quade
1 Assume-guarantee verification of source code with design-lev.. - Giannakopoulou, Pasareanu et al. - 2004
1 ACM Transactional on Programmming Languages and Systems (context) - Abadi, Lamport - 1995
1 Composing partially-specified systems (context) - Hinton
1 Key-dependent message security under active attacks (context) - Backes, Pfitzmann et al.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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