Fair rational secure two-party computing protocol

Abstract

The invention designs a fair rational and safe two-party calculation protocol, and aims to solve the problem of fairness in rational and safe two-party calculation. Compared with the traditional security multi-party calculation, the participants in the rational security two-party calculation are rational so as to achieve the self utility maximization selection strategy. The main idea of the method is that the uncertainty of the participant strategy is investigated, the participant strategy is quantified by using the orientation vector of the direction entropy, and the behavior strategy of the participant is evaluated from different dimensions. When the participant selects the cooperation strategy, the orientation vector of the direction entropy is positive, and the transmitted information is positive information. And when the participant selects a non-cooperation strategy, the orientation vector of the direction entropy is negative, and the transmitted information is negative information. And finally, a conclusion is obtained that the direction entropy value of the participant selecting the cooperation strategy is higher than the direction entropy value of the participant selecting the non-cooperation strategy.

Description

Technical field: [0001] The invention belongs to the field of rational cryptography, and designs a fair, rational and secure two-party computing protocol in combination with secure multi-party computing and based on game theory. Background technique: [0002] There are many problems in the traditional secure multi-party computation: 1) The participants in the agreement are either honest, semi-honest or malicious. In reality, the participants have the greatest self-interest, so it does not conform to the realistic scenario; 2) In traditional secure multi-party computing, one participant will choose to terminate the agreement after obtaining the secret, which leads to the unfairness of the agreement; 3) In the process of implementing the agreement, rational participants make strategic choices based on their own interests, which will lead to uncertainty. [0003] Rational secure multi-party computation refers to secure multi-party computation with rational participants. It is ...

AI Technical Summary

Problems solved by technology

[0002] There are many problems in the traditional secure multi-party computation: 1) The participants in the agreement are either honest, semi-honest or malicious, and the actual participants are in the best of their own interests, so it does not conform to the realistic scenario; 2) In traditional secure multi-party computing, one participant will choose to terminate the agreement after obtaining the secret, which will lead to the unfairness of the agreement; 3) In the process of implementing the agreement, rational participants choose strategies based on their own interests, which will lead to uncertainty

However, in the process of executing the agreement, the participants usually have multiple behavioral strategies. When using information entropy to measure the event, it is impossible to measure the positive or negative amount of information transmitted by the event.

Images