一种可验证的多秘密共享方案  

Verifiable Multi-secret Sharing Scheme

作　　者：李雄[1] 李志慧[1] 于静[1] 

机构地区：[1]陕西师范大学数学与信息科学学院,西安710062

出　　处：《计算机工程》2008年第24期160-161,164,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(10571112);陕西省自然科学基础研究计划基金资助项目(2007A06);陕西师范大学研究生培养创新基金资助项目(2008CXS010)

摘　　要：YCH方案是一个基于二元单向函数和Shamir(t,n)门限方案的有效多秘密共享方案,但其不具有可验证性。该文基于YCH方案、RSA密码体制和离散对数问题,提出一个可验证的多秘密共享方案,使YCH方案保留原有性质的同时实现了可验证性。该方案中参与者的秘密份额由自己选择产生且无需安全信道,有较强的实用价值。YCH scheme is an efficient multi-secret sharing scheme based on two-variable one-way function and Shamir（t, n） threshold secret sharing scheme, but the scheme does not have the property of verification. This paper presents a verifiable multi-secret sharing scheme based on YCH scheme, RSA cryptosystem and intractability of discrete logarithm. It has the property of verification as well as the other properties of YCH scheme. It does not need a secure channel and each participant chooses his secret shadow by himself, so the scheme provides great capabilities for many applications.

关 键 词：多秘密共享 RSA密码体制 离散对数 可验证性 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]