基于秘密共享的理性安全多方计算的研究
Research on the Multi-Computing of Rational Security Based on Secret Sharing
DOI: 10.12677/CSA.2018.83035, PDF,    国家自然科学基金支持
作者: 张兴兰*, 郑 炜：北京工业大学，北京
关键词: 秘密共享；安全多方计算；博弈论；Secret Sharing； Secure Multi-Party Computation； Game Theory
摘要: 通过对以往的基于秘密共享的理性安全多方计算协议的分析，指出了其中存在的一些问题，为了解决这些问题，本文重新设计了一种基于秘密共享的理性安全多方计算协议，通过在真实影子份额中随机的混入虚假影子份额，并且屏蔽掉参与者对于秘密分发阶段对于秘密多项式阶数等私密信息的了解，从而解决了之前协议所暴露出的问题。
Abstract: Through the analysis of the past, based on the analysis of rational-security multi-party computing protocol based on secret sharing, some of the problems are pointed out. In order to solve these problems, this paper redesigns a rational secure multi-party computing protocol based on secret sharing. In order to solve the problems exposed by the previous agreement, false points are mixed in real points and participants’ information about polynomial is masked during secret distribution.
文章引用：张兴兰, 郑炜. 基于秘密共享的理性安全多方计算的研究[J]. 计算机科学与应用, 2018, 8(3): 305-313. https://doi.org/10.12677/CSA.2018.83035

参考文献

[1] Goldreich, O. (1998) Secure Multi-Party Computation.
http://theory.lcs.mit.edu/
[2] Cramer, R. (1999) Introduction to Secure Computation. In: Damgaard, I., Ed., Lectures on Data Security, Lecture Notes in Computer Science, Vol. 1561, 16-62. [Google Scholar] [CrossRef] 
[3] Halpern, J. and Teague, V. (2004) Rational Secret Sharing and Multiparty Computation. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), 13-16 June 2004, Chicago, IL, 623-632. [Google Scholar] [CrossRef] 
[4] Kol, G. and Naor, M. (2008) Cryptography and Game Theory: Designing Protocols for Exchanging Information. Theory of Cryptography Conference (TCC 2008), 4948, 317-336. ttps://doi.org/10.1007/978-3-540-78524-8_18
[5] Maleka, S., Amjed, S. and Rangan, C.P. (2008) The Deterministic Protocol for Rational Secret Sharing. Proceedings of the 22th IEEE International Symposium on Parallel and Distributed Processing, 14-18 April 2008, Miami, FL, 1-7. [Google Scholar] [CrossRef] 
[6] Izmalkov, S., Micali, S. and Lepinski, M. (2005) Rational Secure Computation and Ideal Mechanism Design. Proceedings of the 46th Annual Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, 585-595. [Google Scholar] [CrossRef] 
[7] Fuchsbauer, G., Katz, J. and Naccache, D. (2010) Eficient Rational Secret Sharing in the Standard Communication Networks. Theory of Cryptography (TCC 2010), 5978, 419-436. [Google Scholar] [CrossRef] 
[8] Asharov, G. and Lindell, Y. (2011) Utility Dependence in Correct and Fair Rational Secret Sharing. Journal of Cryptology, 24, 157-202. [Google Scholar] [CrossRef] 
[9] Micali, S., Rabin, M.O. and Vadhan, S.P. (1999) Verifiable Random Functions. 40th Annual Symposium on Foundations of Computer Science (FOCS), 17-19 October 1999, New York City, NY, 120-130. [Google Scholar] [CrossRef] 
[10] Dodis, Y. (2003) Efficient Construction of (Distributed) Verifiable Random Functions. Public Key Cryptography—PKC 2003, 2567, 1-17. [Google Scholar] [CrossRef] 
[11] Lysyanskaya, A. (2002) Unique Signatures and Verifiable Random Func-tions from the DH-DDH Separation. Advances in Cryptology|CRYPTO 2002, 2442, 597-612. [Google Scholar] [CrossRef] 
[12] Dodis, Y. and Yampolskiy, A. (2005) A Verifiable Random Function with Short Proofs and Keys. Public Key Cryptography—PKC 2005, 3386, 416-431. [Google Scholar] [CrossRef] 
[13] Maleka, S., Shareef, A. and Rangan, C.P. (2008) The Deterministic Protocol for Rational Secret Sharing. IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008), 14-18 April 2008, Miami, FL, 1-7. [Google Scholar] [CrossRef] 
[14] Feldman, P. (1987) A Practical Scheme for Non-Interactive Verifia-ble Secret Sharing. 28th IEEE Symposium on Foundations of Computer Science (FOCS’87), 12-14 October 1987, Los Angeles, CA, 427-437. [Google Scholar] [CrossRef]