期刊文献+

传统游戏的网络实现技术

Implementation Technology of Traditional Games in Network
下载PDF
导出
摘要 由于网络信息不能同步传输,直接将需要面对面同步进行的传统游戏构建在网络中将无法保证游戏的公平性。针对该问题,采用基于合数高阶剩余的公钥系统中比特承诺的思想,设计传统的石头、剪刀、布游戏的双人和可计数多人游戏方案。在多人游戏协议中利用系统的同态性实现计数功能,从而隐藏出拳失败者的出拳信息,同时降低网络开销,并在协议设计中根据算法博弈论的原理,引入保证所有参与者都不可能偏离协议的机制。分析结果表明,采用以上思想设计传统的石头、剪刀、布游戏,能够实现在网络应用中的公平性和有效性。 It becomes difficult to play the games that need face-to-face mechanism to ensure the fairness on lnternet. Bit Commitment(BC) can solve this problem. This paper, using public-key cryptosystem based on high degree composite residuosity classes, proposes a new bit commitment scheme, and then, using this BC scheme as building block, designs two protocols to implement the traditional rock, paper and scissors game for multi-players. These protocols use the homomorphism of the public-key cryptosystems to perform the counting function, to hide the information of the fail player's promise, and to reduce the network overhead meanwhile. In design of these protocols, algorithmic game theory is introduced to guarantee that all players will loyally follow the prescribed game protocols. Analysis result shows that the traditional rock, paper and scissors game designed by the idea mentioned above can be achieved fairly and effectively in network.
出处 《计算机工程》 CAS CSCD 2013年第5期96-100,共5页 Computer Engineering
基金 国家自然科学基金资助项目(61070189) 陕西省科技攻关计划基金资助项目(2008K01-58)
关键词 比特承诺 游戏 网络信息 同态性 算法博弈论 Bit Commitment(BC) game network information homomorphism algorithmic game theory
  • 相关文献

参考文献12

  • 1Blum M. Coin Flipping by Telephone Protocol for Solving Impossible Problems[C]//Proceedings of ACM SIGACT News. New York, USA: ACM Press, 1983: 23-27.
  • 2Blum M, Feldman P, Micali S. Non-interactive Zeroknowledge and Its Applications[C]//Proceedings of the 20th Annum ACM Symposium on Theory of Computing. New York, USA: [s. n.], 1988: 103-112.
  • 3Michael B, Nathan L. Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values[C]//Proc. of the 26th Annual Symposium on Foundations of Computer Science. New York, USA: [s. n.], 1985: 408- 416.
  • 4杨威,黄刘生,王启研.基于椭圆曲线的三方比特承诺[J].电子与信息学报,2009,31(5):1049-1053. 被引量:3
  • 5郑东,张彤,陈克非,王育民.基于比特承诺的电子彩票方案[J].电子学报,2000,28(10):141-142. 被引量:13
  • 6Pallier R Public-Key Cryptosystems Based on Composite Degree Residue Classes[C]//Proceedings of EURO- CRYPT'99. Prague, Czech Republic: [s. n.], 1999: 223-238.
  • 7Nisan N, Rosen A. Algorithmic Mechanism Design[C]// Proc. of the 31st Annual ACM Symposium on Theory of Computing. New York, USA: ACM Press, 1999:129-140.
  • 8Feige U, Tennenholtz M. Mechanism Design with Uncertain Inputs(to Err is Human, to Forgive Divine)[EB/OL]. [2012-04-28]. http://arxiv.org/pdf/1103.2520.
  • 9Papadimitriou C, Pierrakos G. On Optimal Single-Item Auction[EB/OL]. [2012-04-28]. http://arxiv.org/pdf/1011. 1279.
  • 10Laskov P, Lippmann R. Machine Learning in Adversarial Environments[J]. Machine Learning, 2010, 81 (2): 115-119.

二级参考文献19

  • 1Blum M. Coin flipping by telephone. Proc IEEE Sprint COMPCOM. Las Vegas, 1982: 133-137.
  • 2Goldwasser S, Micali S, and Rivest R L. A Digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 1998, 17(2): 281-308.
  • 3Damgard I and Fujiso.ki E. An integer commitment scheme based on groups with hidden order. Advances in Cryptology - ASIACRYPT, New Zealand, 2002: 125-142.
  • 4Haitner I and Reingold O. Statistically-hiding commitment from any one-way function. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, San Diego, California, USA, 2007: 1-10.
  • 5Naor M. Bit commitment using pseudorandomness. Journal of Cryptology, 1991, 2(2): 151-158.
  • 6Impagliazzo R and Naor M. Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology, 1996 9(4): 199-216.
  • 7Lo H K and Chau H F. Is quantum bit commitment really possible? Phys. Rev. Lett., 1997, 78(17): 3410-3413.
  • 8Mayers D. Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett., 1997, 78(17): 3414-3417.
  • 9Lo H K and Chau H F. Making an empty promise with a quantum computer. Fortschritte Der Physik, Berlin, Wiley- VCH, 1998, 46(4-5): 507-519.
  • 10Lo H K and Chau H F. Why quantum bit commitment and ideal quantum coin tossing are impossible. Physica D, 1998, 120(1-2): 177-187.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部