S. Dov Gordon Jonathan Katz + July 11, 2006  Home/Search
Context
Related
| iacr.org/2006/142.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/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of secret sharing among n rational players. This problem was introduced by Halpern and Teague (STOC 2004), who claim that a solution is impossible for n = 2 but show a solution for the case n 3. Contrary to their claim, we show a protocol for rational secret sharing among n = 2 players; our protocol extends to the case n 3, where it is simpler than the Halpern-Teague solution and also o#ers a number of other advantages. We also show how to avoid the continual... (Update)
Active bibliography (related documents): More All
0.5: Rational Secret Sharing and Multiparty Computation (Extended.. - Halpern, Teague (2004) (Correct)
0.5: A Digital Signature Scheme Secure Against Adaptive.. - Goldwasser, Micali.. (1988) (Correct)
0.3: On Correctness and Privacy in Distributed Mechanisms - Brandt, Sandholm (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ jonathan-rational,
author = "Dov Gordon Jonathan",
title = "Rational Secret Sharing, Revisited",
url = "citeseer.ist.psu.edu/760902.html" }
Citations (may not include all citations):645 How to Share a Secret (context) - Shamir - 1979
309 Game Theory (context) - Fudenberg, Tirole - 1991
282 A Course in Game Theory (context) - Osborne, Rubinstein - 1994
185 How to Generate and Exchange Secrets (context) - Yao - 1986
174 Safeguarding Cryptographic Keys (context) - Blakley - 1979
140 How to Play any Mental Game or A Completeness Theorem for Pr.. (context) - Goldreich, Micali et al. - 1987
54 Cambridge University Press (context) - Goldreich, Cryptography et al. - 2004
18 Limits on the Security of Coin Flips when Half the Processor.. (context) - Cleve - 1986
3 Rational Secret Sharing and Multiparty Computation - Halpern, Teague - 2004
2 th Annual ACM Symposium on Theory of Computing (context) - Lepinski, Micali et al. - 2005
2 Non-Cooperative Computing: Boolean Functions with Correctnes.. (context) - Shoham, Tennenholtz - 2005
1 Distributed Computing Meets Game Theory: Robust Mechanisms f.. (context) - Abraham, Dolev et al. - 2006
1 Rationality and Adversarial Behavior in Multi-Party Computat.. (context) - Lysyanskaya, Triandopoulos - 2006
1 Completely Fair SFE and Coalition-Safe Cheap Talk (context) - Lepinski, Micali et al. - 2004
1 Rational Secure Function Evaluation and Ideal Mechanism Desi.. (context) - Izmalkov, Micali et al. - 2005
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (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