Chinese Journal of Network and Information Security ›› 2018, Vol. 4 ›› Issue (1): 52-56.doi: 10.11959/j.issn.2096-109x.2018010

• Papers • Previous Articles     Next Articles

Research on security multi-party computing based on game theory

Xinglan ZHANG,Wei ZHENG()   

  1. Department of Information Science,Beijing University of Technology,Beijing 100124,China
  • Revised:2017-12-09 Online:2018-01-01 Published:2018-02-09
  • Supported by:
    The National Natural Science Foundation of China(10007016201201)

Abstract:

In the classic millionaire agreement,one party can get the final wealth comparison results,you can not tell the other party,you can not comply with this agreement,combined with game theory can avoid this problem,you can make the participants away from the agreement proceeds less than compliance with the agreement,compliance with the agreement is the optimal strategy for the participant.At present,the problem of computational efficiency based on game theory is low,and the protocol greatly improves the computational efficiency by introducing a binary tree.

Key words: game theory, millionaire problem, secure multi-party computation, binary sort tree

CLC Number: 

No Suggested Reading articles found!