检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王伊蕾[1,2] 郑志华[3] 王皓[3] 徐秋亮[2]
机构地区:[1]鲁东大学信息与电气工程学院,山东烟台264025 [2]山东大学计算机科学与技术学院,济南250101 [3]山东师范大学信息科学与工程学院,济南250014
出 处:《计算机研究与发展》2014年第7期1527-1537,共11页Journal of Computer Research and Development
基 金:国家自然科学基金项目(61173139);山东省自然科学基金重点项目(ZR2011FZ005);高等学校博士学科点专项科研基金项目(20110131110027)
摘 要:在安全多方计算中,公平性指的是被腐败的参与者可以得到他们的输出当且仅当诚实参与者得到他们的输出.当恶意者超过参与者数量一半时,公平性很难达到.因此在设计两方计算协议时,公平性经常被忽略.在传统多方计算中,包括总是遵守协议的诚实参与者,虽然遵守协议但是希望通过保留中间结果得到对方私有信息的半诚实参与者和任意偏离协议的恶意参与者.理性参与者不同于上述参与者,他们的主要目标是最大化他们的收益.理性计算是指带有理性参与者的计算,它开辟了实现两方安全计算中公平性的新思路.考虑了理性安全计算允许理性参与者具有不对称的信息的情况,例如效用函数和参与者的私有类型,这是与之前理性计算的不同之处.针对这种不同,提出了一种较强的均衡概念——可计算序贯均衡.可计算序贯均衡包括2部分:可计算序贯理性和一致性.它强于纳什均衡,可以用来实现理性两方计算中的公平性.最后构造了一个模拟器,证明了协议的安全性.In secure multi-party computation, the property of fairness means that corrupted parties should receive their outputs if and only if the honest parties also receiye their outputs. It is hardly achieved when the number of malicious parties is more than half number of the participants. Therefore, fairness is often ignored in secure multi-party computation. Parties in traditional secure computation consist of honest parties, semi-honest parties and malicious parties. Honest parties always follow the protocol. Semi-honest parties also follow the protocol. However, they may keep an internal state of all the corrupted parties attempting to use this to learn private information. Malicious parties arbitrarily deviate from the protocol. Rational parties are neither of them but only want to maximize their utilities. Rational secure computation means that rational parties are allowed to participate in the computation, which opens a new avenue to achieve this desirable property. In this paper, we consider a more realistic rational protocol where parties may have asymmetric information such as utilities and types, which make our protocol distinct with previous ones. On account of these distinctions, a stronger equilibrium named computational sequential equilibrium, Which consists of computational sequentially rational and consistent, is put forward to guarantee fairness. At the end of this paper, an simulator is constructed to prove the security of the protocol.
关 键 词:扩展博弈 理性安全计算 序贯均衡 私有类型 效用函数
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3