基于中国剩余定理的公平理性安全多方计算

现有的理性安全多方计算多数通过同步信道来实现,本文基于中国剩余定理,在异步信道上实现了公平的理性安全多方计算。采用不确定轮数的办法,使得理性参与者不知道那一轮是最后一轮。通过一报还一报机制和动态添加/删除方式,使得理性参与者偏离协议的收益小于遵循协议的收益,理性参与者没动机偏离协议,实现任意参与者人数的公平理性安全多方计算,从博弈论角度对方案进行公平性分析。最后从信道类型、参与者组成、交互轮数、其它要求进行方案对比,进一步说明本方案具有的优势。

Rational Fair Secure Multiparty Computation Based on Chinese Remainder Theorem

Exciting rational secure multiparty computation goes less to discuss asynchronous channel, we realize it on asynchronous channel by using Chinese reminder theorem. Using the way of uncertain rounds, rational play ers dont which round is the last round. Through tit ior tat mechanism and dynamical add/remove, rational play ers have not any motivation to deviate from the specified protocol, if someone deviate from it, then his utility yields less than follow it, so we realize any number of players＇fair rational secure muhiparty computation. Fur thermore, we analyze the schemeg fairness from the perspective of game theory. Finally, some advantages of our scheme are demonstrated further by comparing the exiting schemes with the type of comluunication channel, con sists of players, interactive round and other requests.