检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王彩芬 苏舜昌 杨小东 WANG Cai-fen;SU Shun-chang;YANG Xiao-dong(School of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070;Shenzhen Technical University,Shenzhen 518118,China)
机构地区:[1]西北师范大学计算机科学与工程学院,甘肃兰州730070 [2]深圳技术大学,广东深圳518118
出 处:《计算机工程与科学》2019年第9期1597-1602,共6页Computer Engineering & Science
摘 要:秘密共享作为密码学中的一个重要分支,在秘钥托管、安全多方计算、导弹发射等诸多领域有重要作用。现有秘密共享方案大多数都是基于Shamir(t,n)门限方案构造的,其核心思想是秘密分发者通过秘密多项式将秘密s分为n个影子秘密并分发给持有者,其中任意少于t个影子秘密都不能得到主秘密的任何信息,但是传统方案一直没有实现秘密数量动态更新与秘密拥有者口令授权。基于传统的Shamir秘密共享方案和有限域上的模运算,在RSA密码体制的基础上提出了一种可验证的口令授权的多秘密共享方案。在秘密共享过程中,可防止分发者欺骗和恶意参与者攻击,实现秘密数量动态更新与秘密拥有者口令授权,使方案更加具有实用价值。As an important branch of cryptography, secret sharing plays an important role in secret key escrow, secure multi-party computing, missile launching and many other fields. Most of the existing secret sharing schemes are based on the(t, n)-Shamir threshold scheme, whose core idea is that the secret distributor divides the secret s into n shadow secrets and distributes them to the holder by secret polynomial. Any less than t shadow secret cannot get any information of the main secret. However, traditional schemes cannot realize dynamic update of the secret number and password authorization of the secret holder. Based on the traditional Shamir secret sharing scheme and the modular operation over finite fields and the RSA cryptosystem, we propose a verifiable password-authorized multi-secret sharing scheme. In the secret sharing process, it can prevent distributors from deceiving and malicious participants’ attack, and achieve dynamic update of the secret number and password authorization of the secret holder, which makes the scheme more practical.
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7