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 offers a number of other advantages. We also show how to avoid the continual involvement of the dealer, in either our own protocol or that of Halpern and Teague.
Our techniques extend to the case of rational players trying to securely compute an arbitrary function, under certain assumptions on the utilities of the players.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and Multiparty Computation. In: 25th ACM Symposium on Principles of Distributed Computing (PODC 2006) (to appear, 2006)
Blakley, G.R.: Safeguarding Cryptographic Keys. In: National Computer Conference, vol. 48, pp. 313–317. AFIPS Press (1979)
Cleve, R.: Limits on the Security of Coin Flips when Half the Processors are Faulty. In: 18th Annual ACM Symposium on Theory of Computing, STOC 1986 (1986)
Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)
Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In: 19th Annual ACM Symposium on Theory of Computing, STOC 1987 (1987)
Halpern, J., Teague, V.: Rational Secret Sharing and Multiparty Computation. In: 36th Annual ACM Symposium on Theory of Computing, STOC 2004 (2004)
Izmalkov, S., Micali, S., Lepinski, M.: Rational Secure Function Evaluation and Ideal Mechanism Design. In: 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005 (2005)
Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely Fair SFE and Coalition-Safe Cheap Talk. In: 23rd ACM Symposium on Principles of Distributed Computing, PODC 2004 (2004)
Lepinski, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: 37th Annual ACM Symposium on Theory of Computing (STOC 2005) (2005)
Lysyanskaya, A., Triandopoulos, N.: Rationality and Adversarial Behavior in Multi-party Computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 180–197. Springer, Heidelberg (2006)
Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)
Shamir, A.: How to Share a Secret. Comm. ACM 22(11), 612–613 (1979)
Shoham, Y., Tennenholtz, M.: Non-Cooperative Computing: Boolean Functions with Correctness and Exclusivity. Theoretical Computer Science 343(1-2), 97–113 (2005)
Yao, A.C.-C.: How to Generate and Exchange Secrets. In: 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1986) (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gordon, S.D., Katz, J. (2006). Rational Secret Sharing, Revisited. In: De Prisco, R., Yung, M. (eds) Security and Cryptography for Networks. SCN 2006. Lecture Notes in Computer Science, vol 4116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11832072_16
Download citation
DOI: https://doi.org/10.1007/11832072_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38080-1
Online ISBN: 978-3-540-38081-8
eBook Packages: Computer ScienceComputer Science (R0)