首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Information-Theoretic Secure Verifiable Secret Sharing over RSA Modulus
作者姓名:QIU  Gang  WANG  Hong  WEI  Shimin  XIAO  Guozhen
作者单位:[1]State Key Laboratory of Integrated Sevice Network, Xidian University, Xi'an 710071, Shaanxi, China [2]State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China [3]Department of Computer Science and Technology, Huaibei Coal Normal College, Huaibei 235000, Anhui, China
摘    要:The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA (Rivest, Shamir, Adleman) modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.

关 键 词:可检验秘密共享  信息安全  RSA  委托
文章编号:1007-1202(2006)06-1849-04
收稿时间:2006-03-20

Information-theoretic secure verifiable secret sharing over RSA modulus
QIU Gang WANG Hong WEI Shimin XIAO Guozhen.Information-Theoretic Secure Verifiable Secret Sharing over RSA Modulus[J].Wuhan University Journal of Natural Sciences,2006,11(6):1849-1852.
Authors:Qiu Gang  Wang Hong  Wei Shimin  Xiao Guozhen
Institution:(1) State Key Laboratory of Integrated Sevice Network, Xidian University, 710071 Xian, Shaanxi, China;(2) State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, 100049 Beijing, China;(3) Department of Computer Science and Technology, Huaibei Coal Normal College, 235000 Huaibei, Anhui, China
Abstract:The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA (Rivest,Shamir,Adleman) modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.
Keywords:verifiable secret sharing  information-theoretic secure  commitment  RSA(Rivest  Shamir  Adleman) modulus
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号