常数轮公平理性秘密共享方案

Constant-round fair rational secret sharing scheme

在理性秘密共享方案中,公平性是所有参与者期望的目标。基于均匀分组原理研究了常数轮理性秘密共享方案,结合双线性对有关知识和双变量单向函数构造知识承诺方案,该方案是可验证的,以此来检验分发者和参与者的欺骗问题。分发者分给各组参与者的子秘密份额数量最多相差1,有效约束参与者的偏离行为。参与者按照协议执行4轮即可实现公平重构秘密,一定程度上降低了公平理性秘密共享方案的通信复杂度,具有一定应用价值。

In the rational secret sharing scheme, fairness is the goal that all participants expect. Based on the principle of uniform grouping, the scheme was verified by combining bilinear pair knowledge and bivariate one-way function to verify the deception problem of the distributor and the participant.The number of sub-secret shares distfibuted by the distributor to each group of participants is at most one, effectively restricting the deviation behavior of the participant. In the end, participants can implement fair reconstruction secret in four rounds according to the protocol, which reduces the communication complexity of fair and rational secret sharing scheme to a certain extent, and has certain application value.