检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]合肥工业大学计算机学院,安徽合肥230009
出 处:《计算机应用与软件》2015年第8期276-278,共3页Computer Applications and Software
基 金:国家自然科学基金项目(61272540);安徽省自然科学基金项目(11040606M138)
摘 要:秘密共享交互过程中存在成员欺骗问题,现有的理性秘密共享方案的惩罚机制过于严厉,鲁棒性差。针对该问题提出一种公平的理性秘密共享方案。方案给出一种改进的惩罚机制,通过多轮交互秘密份额,能有效识别并阻止成员欺骗。与之前的理性秘密共享方案不同,改进的惩罚机制不仅能更好地保障诚实成员的利益,同时也给予欺骗者一个改过的机会,具有更好的鲁棒性和公平性。Frauds among members happen in the interactive process of secret sharing. The punishment mechanism of existing rational secret sharing schemes is too harsh with poor robustness. We proposed a fair rational secret sharing scheme aimed at this problem,in which an improved punishment mechanism is given. Through several rounds of secret sharing,the scheme can identify and hold back the frauds among members effectively. Different from the previous rational secret sharing schemes,the revised punishment mechanism can better guarantee the interests of the honest members. Meanwhile,it also provides an opportunity for the cheaters to make up for their mistakes.Therefore,this scheme has better sense of robustness and fairness.
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70