[1]唐春明,裴定一,赵延孟,等.信息理论安全下公开可验证密钥共享方案[J].深圳大学学报理工版,2009,26(2):121-126.
 TANG Chun-ming,PEI Ding-yi,ZHAO Yan-meng,et al.A publicly verifiable secret sharing scheme with information-theoretic security[J].Journal of Shenzhen University Science and Engineering,2009,26(2):121-126.
点击复制

信息理论安全下公开可验证密钥共享方案()
分享到:

《深圳大学学报理工版》[ISSN:1000-2618/CN:44-1401/N]

卷:
第26卷
期数:
2009年2期
页码:
121-126
栏目:
电子与信息工程
出版日期:
2009-04-30

文章信息/Info

Title:
A publicly verifiable secret sharing scheme with information-theoretic security
文章编号:
1000-2618(2009)02-0121-06
作者:
唐春明12 裴定一1赵延孟3石桂花1
1)广州大学信息安全研究所,广州大学数学与信息科学学院,广州 510006;
2)信息安全国家重点实验室,中国科学院软件研究所,北京 100190;
3)深圳大学数学与计算科学学院,深圳 518060
Author(s):
TANG Chun-ming12PEI Ding-yi1ZHAO Yan-meng3and SHI Gui-hua1
1)Institute of Information Security,College of Mathematics and Information Science,Guangzhou University,Guangzhou 510006,P.R.China;
2)State Key Laboratory of Information Security,Institute of Software Science,Chinese Academy of Science,Beijing 100190,P.R.China;
3)Collegel of Mathematics and Computational Science,Shenzhen University,Shenzhen 518060,P.R.China
关键词:
密码学公开可验证秘密共享方案承诺方案零知识证明协议信息理论安全
Keywords:
cryptographypublicly verifiable secret sharingcommitment schemezero-knowledge proof protocolinformation-theoretic security
分类号:
TP 309
文献标志码:
A
摘要:
基于信息理论安全的承诺方案和知识的零知识证明协议,构造一个公开可验证的密钥共享方案.在该方案中,任何参与者在密钥分布协议中都能验证其他参与者密钥分块的有效性,且在密钥重构中,仅密钥分块的接收者能验证该分块的有效性.对比可验证的密钥共享方案,该方案更具实用性,是一个独到的具有信息理论意义下安全的公开可验证密钥共享方案.
Abstract:
Based on information-theoretic hiding commitment scheme and zero-knowledge proof of knowledge, a publicly verifiable secret sharing (PVSS) scheme was constructed. In this scheme, any party could verify the validity of participants shares in the distribution protocol. Only the receiver could verify validity of these shares gained from the other participants in the reconstruction protocol. This PVSS scheme with information-theoretic security has demostrated that it is more applicable in some cases than any verifiable secrete sharing scheme.

参考文献/References:

[1]Shamir A. 怎样共享一个秘密[J].ACM通讯,1979(22):612-613(英文版).
[2]Blakey G R.保护密码学密钥[C]// 全国计算机会议论文集.柏林:施普林格出版社,1979(48):313-317(英文版).
[3]Feldman P.可行的非交互可验证秘密共享方案[C]//第28届IEEE计算机科学基础会议论文集.纽约:IEEE学会,1987:427-437(英文版).
[4]Pederson T P.非交互的信息理论安全的可验证密钥共享方案[C]// 美国密码学会议论文集.柏林:施普林格出版社,1992:129-140(英文版).
[5]Stadler M.公开可验证秘密共享[C]// 欧洲密码学会议论文集.柏林:施普林格出版社,1996:190-199.(英文版).
[6]Schoenmakers B.一种简单的公开可验证秘密共享方案以及它在电子选举中的应用[C]// 美国密码学会议论文集.柏林:施普林格出版社,1999:148-164(英文版).
[7]Chaum D,Pedersen T P.可转换电子货币[C]// 欧洲密码学会议论文集.柏林:施普林格出版社,1993:390-407(英文版).
[8]Chaum D,Evertse J H,J van de Graaf.改进的证明离散对数的协议算法及其推广[C]// 欧洲密码学会议论文集. 柏林:施普林格出版社,1988:127-141(英文版).
[9]Damgard I.∑-协议[EB/OL]//CRT 2004[2008-01-01]http://www.daimi.au.dk/~ivan/Sigma.ps,2002(英文版).
[10]Fiat A,Shamir A.怎样为你自己的身份证明和签名问题证明一个事实解[C]// 美国密码学会议论文集.柏林:施普林格出版社,1987:186-189(英文版).
[11]唐春明,裴定一,王晓峰,等.基于非交互证据不可区分和非交互证据隐藏协议的可代表签名[J].中国科学:信息科学版,2008,51(2):128-144 (英文版).
[12]唐春明,裴定一,姚正安.有效的Zaps和知识签名[C]// IEEE计算智能和安全国际会议论文集 (CIS2007).纽约:IEEE学会,2007:637-641(英文版).


[1]Shamir A.How to share a secret[J].Communication of the ACM,1979(22):612-613.
[2]Blakey G R.Safeguarding cryptographic keys[C]// Proceedings of the National Computer Conference.Berlin:Springer-Verlag,1979:313-317.
[3]Feldman P.A practical scheme for non-interactive verifiable secret sharing[C]// Proceedings of 28th IEEE Symposium on Foundation of Computer Science (FOCS).NY:IEEE Society,1987:427-437.
[4]Pedersen T P.Non-interactive and information-theoretic secure verifiable secret sharing[C]// Advances in Cryptology-CRYPTO91.Berlin:Springer-Verlag,1992:129-140.
[5]Stadler M.Publicly verifiable secret sharing[C]// Advances in Crypto-EUROCRYPT96.Berlin:Springer-Verlag,1996:190-199.
[6]Schoenmakers B.A simple publicly verifiable secret sharing scheme and its application to electronic voting[C]// Advances in Cryptology-CRYPTO99.Berlin:Springer-Verlag,1999:148-164.
[7]Chaum D,Pedersen T P.Transferred cash grows in size[C]// Advances in Crypto-EUROCRYPT92.Berlin:Springer-Verlag,1993:390-407.
[8]Chaum D,J H Evertse,J van de Graaf.An improved protocol for demonstrating possession of discrete logarithms and some generalizations[C]// Advances in Crypto-EUROCRYPT87.Berlin:Springer-Verlag,1988:127-141.
[9]Damgard I.∑-protocols[EB/OL]CRT 2004[2008-01-01]http://www.daimi.au.dk/~ivan/Sigma.ps,2002.
[10]A fiat and a shamir.How to prove yourself:practical solution to identification and signature problems[C]// Advances In CRYPTO86.Berlin:Springer-Verlag,1987:186-189.
[11]TANG Chun-ming,PEI Ding-yi,WANG Xiao-feng,et al.Delegateable signature based on non-interactive witness indistinguishable and non-interactive witness hiding proofs[J].Science In China(Series F):Information Sciences,2008,51(2),128-144.
[12]TANG Chun-ming,PEI Ding-yi,YAO Zheng-an.Efficient zaps and signatures of knowledges[C]// In Proceeding of IEEE International Conference on Computational Intelligence and Security(CIS2007).NY:IEEE Society,2007:637-641.

相似文献/References:

[1]张席,陈泯融,杨玲.基于身份多接收者签密方案的安全性分析[J].深圳大学学报理工版,2010,27(4):408.
 ZHANG Xi,CHEN Min-rong,and YANG Ling.Cryptanalysis of an identity-based multi-recipient signcryption scheme[J].Journal of Shenzhen University Science and Engineering,2010,27(2):408.
[2]唐春明,赵延孟.使用双线性对构造基于身份的不可否认签名[J].深圳大学学报理工版,2006,23(1):85.
 TANG Chun-ming and ZHAO Yan-meng.Identity-based undeniable signatures from bilinear pairings[J].Journal of Shenzhen University Science and Engineering,2006,23(2):85.

备注/Memo

备注/Memo:
收稿日期:2008-02-29;修回日期:2008-11-17
基金项目:国家自然科学基金资助项目(10871222);国家自然科学基金专项基金资助项目(10726012)
作者简介:唐春明(1972-),男(汉族),湖南省怀化市人,广州大学副教授、博士.E-mail:ctang@gzhu.edu.cn
更新日期/Last Update: 2009-05-15