Abstract
We consider the cooperation of rational parties in secret sharing. We present a new methodology for rational secret sharing both in two-party and multi-party settings based on Bayesian game. Our approach can resolve the impossible solutions to a rational secret sharing model. First, we analyze the 2-out-of-2 rational secret sharing using Bayesian game, which makes us able to consider different classes of the protocol player (for “good” and “bad” players) and model attributes such as any other parties’ preferences and beliefs that may affect the outcome of the game. Thus, the new model makes us able to reason rational secret sharing from the perspective of Bayesian rationality, a notion that may be in some scenarios more appropriate than that defined as per pure rational. According to these analyses, we propose a Bayesian rational protocol of 2-out-of-2 secret sharing. Also, our techniques can be extended to the case of t-out-of-n Bayesian rational secret sharing easily. Our protocol is adopted only by the parties in their decision-making according to beliefs and Bayes rule, without requiring simultaneous channels and can be run over asynchronous networks.
摘要
创新点
本文研究秘密共享中理性参与者的合作问题。 基于贝叶斯博弈提出适用于两方和多方环境下的理性密秘共享的新方法, 该方法能解决理性密秘共享模型中的一些难以解决的问题。 首先, 应用贝叶斯博弈分析门限(2, 2)理性秘密共享方案, 该方案能考虑不同类型的协议参与者(“诚实的”和“恶意的”参与者)以及从参与者的偏好、 信念等属性建模, 这些属性能影响理性秘密共享协议的博弈的结果。 该模型从贝叶斯理性的角度合理的刻画理性秘密共享, 较从纯理性的角度分析理性秘密共享更符合实际应用。 基于这些分析, 我们提出贝叶斯理性秘密共享协议, 该技术能容易的扩展到门限(t, n)贝叶斯理性秘密共享的情况而不影响其安全性能。 而且, 我们的协议仅需各参与者基于他们的信念和贝叶斯规则进行决策而不要求同步信道, 能在异步网络上运行。
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Blakley G R. Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference. Monval: AFIPS Press, 1979. 313–317
Shamir A. How to share a secret. Commun ACM, 1979, 22: 612–613
Halpern J, Teague V. Rational secret sharing and multiparty computation: extended abstract. In: Proceedings of 36th Annual ACM Symposium on Theory of Computing (STOC). New York: ACM, 2004. 623–632
Dodis Y, Rabin T. Cryptography and game theory. In: Nisan N, Roughgarden T, Tardos E, et al., eds. Algorithmic Game Theory. Cambridge: Cambridge University Press, 2007. 181–207
Katz J. Bridging game theory and cryptography: recent results and future directions. In: Proceedings of 5th Theory of Cryptography Conference. Heidelberg: Springer, 2008. 251–272
Fudenberg D, Tirole J. Game Theory. Cambridge: MIT Press, 1992
Zhang Z F, Liu M L. Rational secret sharing as extensive games. Sci China Inf Sci, 2013, 56: 032107
Maleka S, Shareef A, Pandu Rangan C. Rational secret sharing with repeated games. In: Proceedings of 4th Information Security Practice and Experience Conference. Heidelberg: Springer, 2008. 334–346
Lysyanskaya A, Triandopoulos N. Rationality and adversarial behavior in multiparty computation. In: Dwork C, ed. In: Proceedings of 26th Annual International Cryptology Conference. Heidelberg: Springer, 2006. 180–197
Kol G, Naor M. Games for exchanging information. In: Proceedings of 40th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 2008. 423–432
Kol G, Naor M. Cryptography and game theory: designing protocols for exchanging information. In: Proceedings of 5th Theory of Cryptography Conference. Heidelberg: Springer, 2008. 320–339
Fuchsbauer G, Katz J, Naccache D. Efficient rational secret sharing in standard communication networks. In: Proceedings of 7th Theory of Cryptography Conference. Heidelberg: Springer, 2010. 419–436
Ong S J, Parkes D V, Rosen A, et al. Fairness with an honest Minority and a rational majority. In: Proceedings of 6th Theory of Cryptography Conference. Heidelberg: Springer, 2009. 36–53
Zhang Z F, Liu M L. Unconditionally secure rational secret sharing in standard communication networks. In: Proceeding of 13th International Conference on Information Security and Cryptology. Heidelberg: Springer, 2011. 355–369
Tian Y L, Ma J F, Peng C G, et al. A rational framework for secure communication. Inf Sci, 2013, 250: 215–226
Fudenberg D, Tirole J. Perfect Bayesian equilibrium and sequential equilibrium. J Econ Theory, 1991, 53: 236–260
Tian Y L, Ma J F, Peng C G, et al. Game-theoretic analysis for the secret sharing scheme (in Chinese). Acta Electron Sin, 2011, 39: 2790–2795
Abraham I, Dolev D, Gonen R, et al. Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of 25th ACM Symposium Annual on Principles of Distributed Computing. New York: ACM Press, 2006. 53–62
Gordon S D, Katz J. Rational secret sharing, revisited. In: Proceedings of 5th Conference on Security and Cryptography for Networks. Heidelberg: Springer, 2006. 229–241
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tian, Y., Peng, C., Lin, D. et al. Bayesian mechanism for rational secret sharing scheme. Sci. China Inf. Sci. 58, 1–13 (2015). https://doi.org/10.1007/s11432-014-5275-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-014-5275-5