Christian Cachin, Jan Camenisch  Home/Search
Context
Related
| ibm.com/~cca/./papers/fair.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: ibm.com/~cca/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an ecient and fair protocol for secure two-party computation in the optimistic model, where a partially trusted third party T is available, but not involved in normal protocol executions. T is needed only if communication is disrupted or if one of the two parties misbehaves. The protocol guarantees that although one party may terminate the protocol at any time, the computation remains fair for the other party. Communication is over an asynchronous network. All our protocols are based ... (Update)
Active bibliography (related documents): More All
0.3: Abuse-free Optimistic Contract Signing - Garay, Jakobsson, MacKenzie (1999) (Correct)
0.3: Abuse-free Multi-party Contract Signing - Garay, MacKenzie (1999) (Correct)
0.3: An Efficient System for Non-transferable Anonymous.. - Camenisch, Lysyanskaya (2001) (Correct)
Similar documents based on text: More All
0.8: Practical Verifiable Encryption and Decryption of Discrete.. - Camenisch, Shoup (2002) (Correct)
0.6: One-Round Secure Computation and Secure Autonomous.. - Cachin.. (2000) (Correct)
0.5: Full design of Dependable Third Party Services - Cachin (2002) (Correct)
BibTeX entry: (Update)
@misc{ cachin-optimistic,
author = "Christian Cachin and Jan Camenisch",
title = "Optimistic Fair Secure Computation (Extended Abstract)",
url = "citeseer.ist.psu.edu/375804.html" }
Citations (may not include all citations):601 A public key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali et al. - 1984
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991
254 A practical public-key cryptosystem provably secure against .. - Cramer, Shoup - 1998
197 A randomized protocol for signing contracts (context) - Even, Goldreich et al. - 1985
185 How to generate and exchange secrets (context) - Yao - 1986
179 Security and composition of multi-party cryptographic protoc.. - Canetti - 2000
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
167 Protocols for secure computation (context) - Yao - 1982
166 Wallet databases with observers (context) - Chaum, Pedersen - 1993
154 Secure multi-party computation - Goldreich - 1998
140 How to play any mental game or a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987
131 Optimistic fair exchange of digital signatures - Asokan, Shoup et al. - 2000
100 Optimistic protocols for fair exchange - Asokan, Schunter et al. - 1997
98 Fair computation of general functions in presence of immoral.. (context) - Goldwasser, Levin - 1991
90 Secure multiparty protocols and zero-knowledge proof systems.. (context) - Beaver - 1991
65 Number-theoretic constructions of ecient pseudorandom functi.. - Naor, Reingold - 1997
59 Non-interactive oblivious transfer and applications (context) - Bellare, Micali - 1990
54 Ecient signature generation by smart cards (context) - Schnorr - 1991
53 A minimal model for secure computation - Feige, Kilian et al. - 1994
52 Multiparty computations ensuring privacy of each party's inp.. (context) - Chaum, Damg et al. - 1988
47 The round complexity of secure protocols - Beaver, Micali et al. - 1990
34 Proofs of partial knowledge and simplied design of witness h.. - Cramer, Damg et al. - 1994
32 Ecient group signature schemes for large groups (context) - Camenisch, Stadler - 1997
30 Multiparty computation with faulty majority (context) - Beaver, Goldwasser - 1989
26 Publicly veriable secret sharing - Stadler - 1996
22 IEEE Transactions on Information Theory (context) - Ben-Or, Goldreich et al. - 1990
18 Committed oblivious transfer and private multi-party computa.. (context) - Cr, Graaf et al. - 1995
12 Ecient concurrent zero-knowledge in the auxiliary string mod.. (context) - Damg - 2000
8 of Lecture Notes in Computer Science (context) - Brickell, Chaum et al. - 1988
7 Limits on the security of coin ips when half the processors .. (context) - Cleve - 1986
5 Veriable encryption and applications to group signatures and.. (context) - Camenisch, Damg - 1998
4 of Lecture Notes in Computer Science (context) - Micali, Rogaway et al. - 1992
3 Optimistic asynchronous multi-party contract signing (context) - Baum-Waidner, Waidner - 1998
1 Linear zero-knowledge|a note on ecient zeroknowledge proofs .. (context) - Cramer, Damg - 1997
1 Secure protocols with invisible trusted parties (context) - Micali - 1998
Documents on the same site (http://www.zurich.ibm.com/~cca/publications.html): More
Locating the Primary Attention Focus of the User - Rauterberg, Cachin (1993) (Correct)
Random Oracles in Constantinople: Practical Asynchronous.. - Cachin, Kursawe, Shoup (2000) (Correct)
One-Round Secure Computation and Secure Autonomous.. - Cachin, Camenisch.. (2000) (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