期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种可验证的多秘密共享方案 被引量：2

Verifiable Multi-secret Sharing Scheme
下载PDF
导出
摘要 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.
作者 李雄 李志慧 于静
机构地区 陕西师范大学数学与信息科学学院
出处 《计算机工程》 CAS CSCD 北大核心 2008年第24期160-161,164,共3页 Computer Engineering
基金 国家自然科学基金资助项目(10571112) 陕西省自然科学基础研究计划基金资助项目(2007A06) 陕西师范大学研究生培养创新基金资助项目(2008CXS010)
关键词 多秘密共享 RSA密码体制 离散对数 可验证性 multi-secret sharing RSA cryptosystem discrete logarithm verification
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献8

  • 1Shamir A. How to Share a Secret[J]. Communications of ACM, 1979, 22(11): 612-613.
  • 2Blakley G. Safeguarding Cryptographic Keys[C]//Proc. of AFIPS National Computer Conference. New York, USA: AFIPS Press, 1979.
  • 3Yang Chouchen, Chang Tingyi, Hwang Minshiang. A (t, n) Multisecret Sharing Scheme[J]. Applied Mathematics and Computation, 2004, 151(2): 483-490.
  • 4He J, Dawson E. Multi-secret Sharing Scheme Based on One-way Function[J]. Electronics Letters, 1995, 31(2): 483-490.
  • 5Zhao Jianjie, Zhang Jianzhong, Zhao Rong. A Practical Verifiable Multi-secret Sharing Scheme[J]. Computer Standards & Interfaces, 2007, 29(1): 138-141.
  • 6Shao Jun, Cao Zhenfu. A New Efficient(t, n) Verifiable Multi-secret Sharing (VMSS) Based on YCH Scheme[J]. Applied Mathematics and Computation, 2005, 168(1 ): 135-140.
  • 7Chang Chin-Chen, Horug Woan-Jing, Buehrer D J. A Cascade Exponentiation Evaluation Scheme Based on the Lempel-Ziv-Welch Compression Algorithm[J]. Journal of Information Science and Engineering, 1995, 11(3): 417-431.
  • 8Knuth D V. The Art of Computer Programming: Seminumefical Algorithms[M]. [S. l.]: Addision-Wesley, 1969.

同被引文献24

  • 1甘元驹,谢仕义,郑小平,付东洋.对安全有效的(t,n)多秘密共享认证方案的改进[J].电子与信息学报,2007,29(7):1642-1644. 被引量：8
  • 2Shamir A. How to Share a Secret[J]. Communications of the ACM, 1979, 22(11): 612-613.
  • 3Blakley G. Safeguarding Cryptographic Keys[C]//Proc. of AFIPS'79 National Computer Conference. New York, USA: AFIPS Press, 1979.
  • 4Dawson H J, Dawson E. Multisecret-sharing Scheme Based on One-way Function[J]. Electronics Letters, 1995, 3 ! (2): 93-95.
  • 5Ren Junn-Hwang, Chin Chen-Chang. An On-line Secret Sharing Scheme for Multi-secrets[J]. Computer Communications, 1998, 21(13): 1170-1176.
  • 6Chien H, Tseng J. A Practical Multi-secret Sharing Scheme[J]. IEICE Transactions on Fundamentals of Electronics, Comm. and Computer, 2000, 83(12): 2762-2765.
  • 7Yang Chou-Chen, Chang Ting-Yi, Hwang Min-Shiang. A (t,n) Multi-secret Sharing Scheme[J]. Applied Mathematics and Computation, 2004, 151 (2): 483-490.
  • 8Li Huixian, Cheng Chuntian, Pang Liaojun. A New (t,n) Threshold Multi-secret Sharing Scheme[C]//Proc. of 2008 international Symposium on Electronic Commerce and Security. Berlin, Germany: [s. n.], 2005.
  • 9Shamir A.How to share a secret[J].Communications of the ACM,1979,22(11):612-613.
  • 10Blakley G R.Safeguarding cryptographic keys[C]//Proceedings of AFIPS 1979 National Computer Conference,1979,48:313-317.

引证文献2

二级引证文献5

计算机工程
2008年 第24期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部