Rational secret sharing, revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4116 LNCS, Issue , 2006, Pages 229-241

  Dov Gordon, S ^a   Katz, Jonathan ^a  

^a Dept of Computer Science University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; FUNCTIONS; PROBLEM SOLVING; SECURITY OF DATA;

HALPERN-TEAGUE SOLUTION; RATIONAL PLAYERS; RATIONAL SECRET SHARING;

NETWORK PROTOCOLS;

EID: 33750018128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. I. Abraham, D. Dolev, R. Gonen, and J. Halpern. Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and Multiparty Computation. 25th ACM Symposium on Principles of Distributed Computing (PODC 2006), to appear.
2. G.R. Blakley. Safeguarding Cryptographic Keys. National Computer Conference, vol. 48, pp. 313-317, AFIPS Press, 1979.
3. R. Cleve. Limits on the Security of Coin Flips when Half the Processors are Faulty. 18th Annual ACM Symposium on Theory of Computing (STOC 1986).
4. D. Fudenberg and J. Tirole. Game Theory. MIT Press, 1991.
5. O. Goldreich. Foundations of Cryptography, vol. 2: Basic Applications, Cambridge University Press, 2004.
6. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. 19th Annual ACM Symposium on Theory of Computing (STOC 1987).
7. J. Halpern and V. Teague. Rational Secret Sharing and Multiparty Computation. 36th Annual ACM Symposium on Theory of Computing (STOC 2004).
8. S. Izmalkov, S. Micali, and M. Lepinski. Rational Secure Function Evaluation and Ideal Mechanism Design. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005).
9. M. Lepinski, S. Micali, C, Peikert, and A. Shelat. Completely Fair SFE and Coalition-Safe Cheap Talk. 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004).
10. M. Lepinski, S. Micali, and A. Shelat. Collusion-Free Protocols. 37th Annual ACM Symposium on Theory of Computing (STOC 2005).
11. A. Lysyanskaya and N. Triandopoulos. Rationality and Adversarial Behavior in Multi-Party Computation. Advances in Cryptology - Crypto 2006, to appear.
12. M.J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994.
13. A. Shamir. How to Share a Secret. Comm. ACM, 22(11): 612-613 (1979).
14. Y. Shoham and M. Tennenholtz. Non-Cooperative Computing: Boolean Functions with Correctness and Exclusivity. Theoretical Computer Science 343(1-2): 97-113 (2005).
15. A. C.-C. Yao. How to Generate and Exchange Secrets. 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1986).