参考文献/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计算智能和安全国际会议论文集 (CIS2007).纽约: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-CRYPTO91.Berlin:Springer-Verlag,1992:129-140.
[5]Stadler M.Publicly verifiable secret sharing[C]// Advances in Crypto-EUROCRYPT96.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-CRYPTO99.Berlin:Springer-Verlag,1999:148-164.
[7]Chaum D,Pedersen T P.Transferred cash grows in size[C]// Advances in Crypto-EUROCRYPT92.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-EUROCRYPT87.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 CRYPTO86.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(CIS2007).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.