(Enter summary)
Abstract: Important properties of many protocols are liveness or
availability, i.e., that something good happens now and
then. In asynchronous scenarios these properties obviously
depend on the scheduler, which is usually considered to be
fair in this case. Unfortunately, the standard definitions of
fairness and liveness based on infinite sequences cannot be
applied for most cryptographic protocols since one must restrict
the adversary and the runs as a whole to polynomial
length. We present the first... (Update)
Cited by: More
On the Relationships between Notions of.. - Datta, Küsters.. (2006)
(Correct)
On Fairness in Simulatability-based Cryptographic Systems - Backes, Hofheinz.. (2005)
(Correct)
A Composable Cryptographic Library with Nested.. - Backes, Pfitzmann.. (2003)
(Correct)
Similar documents (at the sentence level):
7.0%: Polynomial Fairness and Liveness - Michael Backes Birgit (2002)
(Correct)
5.7%: Polynomial Liveness - Backes, Pfitzmann, Waidner, Steiner (2003)
(Correct)
Active bibliography (related documents): More All
0.1: Cryptographically Sound Analysis of Security Protocols - Backes (2002)
(Correct)
0.1: Deriving Cryptographically Sound Implementations Using.. - Backes, Jacobi.. (2002)
(Correct)
0.1: Computational Probabilistic Non-Interference - Backes, Pfitzmann (2002)
(Correct)
Similar documents based on text: More All
0.5: Security in Business Process Engineering - Backes, Pfitzmann, Waidner (2003)
(Correct)
0.5: Symmetric Authentication within a Simulatable.. - Backes, Pfitzmann.. (2003)
(Correct)
0.5: Low-level Ideal Signatures and General Integrity Idealization - Backes, Pfitzmann, Waidner (2004)
(Correct)
Related documents from co-citation: More All
7: Universally composable security: A new paradigm for cryptographic protocols
- Canetti - 2001
7: Cryptographically sound and machine-assisted veri- fication of security protocol..
- Backes, Jacobi - 2003
7: Computational probabilistic non-interference
- Backes, Pfitzmann - 2002
BibTeX entry: (Update)
M. Backes, B. Pfitzmann, M. Steiner, and M. Waidner. Polynomial Fairness and Liveness. In Proceedings of 15th IEEE Computer Security Foundations Workshop, CSFW '02, Cape Breton, Nova Scotia, Canada, pages 160 - 174, June 2002. http://citeseer.ist.psu.edu/backes02polynomial.html More
@misc{ backes02polynomial,
author = "M. Backes and B. Pfitzmann and M. Steiner and M. Waidner",
title = "Polynomial Fairness and Liveness",
text = "M. Backes, B. Pfitzmann, M. Steiner, and M. Waidner. Polynomial Fairness
and Liveness. In Proceedings of 15th IEEE Computer Security Foundations
Workshop, CSFW '02, Cape Breton, Nova Scotia, Canada, pages 160 - 174, June
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/backes02polynomial.html" }
Citations (may not include all citations):
718
Distributed algorithms (context) - Lynch - 1996
231
Information Processing Letters (context) - Alpern, Schneider - 1985
108
International Series in Computer Science (context) - Hoare, processes - 1985
100
Automatic verification of pipelined microprocessor control
- Burch, Dill - 1994
74
A model for asynchronous reactive systems and its applicatio..
- Pfitzmann, Waidner - 2001
17
Secure and efficient asynchronous broadcast protocols
- Cachin, Kursawe et al. - 2001
17
Cryptographically sound analysis of security protocols
- Backes - 2002
15
rd Symposium on Foundations of Computer Science (context) - Yao, secure - 1982
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/2002.html): More
Dynamic Accumulators and Application to Efficient.. - Camenisch, Lysyanskaya (2002)
(Correct)
Secure Intrusion-tolerant Replication on the Internet - Cachin, Poritz (2002)
(Correct)
Event Matching in Symmetric Subscription Systems - Rjaibi, Dittrich, Jaepel (2002)
(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