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

基于门限签名体制的多重秘密共享方案

A MULTI- SECRET SHARING SCHEME BASED ON THRESHOLD CRYPTOSYSTEM
下载PDF
导出
摘要 基于Shamir门限方案和RSA密码体制,提出一个一般访问结构上的秘密共享方案.参与者的秘密份额由参与者自己选取,秘密分发者不需要向各个参与者传送任何秘密信息.当秘密更新、访问结构改变或参与者加入/退出系统时,各参与者的秘密份额不需要更新.秘密份额的长度小于秘密的长度.每个参与者只需要维护一个秘密份额就可以实现对多个秘密的共享.每个参与者能够验证其他参与者是否进行了欺骗.方案的安全性是基于Shamir门限和RSA密码体制的安全性. Based on Shamir＇s threshold scheme and the RSA cryptosystem, a new secret sharing scheme is proposed. Each participant＇ s secret shadow is secreted by the participant himself and the dealer does not need to deliver any secret information to each participant. The shadows do not need to be changed when the shared secret is renewed, the access structure is altered, or old participants are deleted/or new participants are added. All these shadows are shorter than or as short as the shared secret. Each participant shares many secrets with other participants by holding only one shadow. Each participant is allowed to check whether another participant provides the true information or not. The security of this scheme is the same as that of Shamir＇ s threshold scheme and the RSA cryptosystem.
作者 王云 张秉儒 芦殿军
机构地区 青海大学成人教育学院 青海师范大学数学科学系
出处 《山东师范大学学报（自然科学版）》 CAS 2012年第1期44-46,共3页 Journal of Shandong Normal University(Natural Science)
基金 国家自然科学基金资助项目（10761008）
关键词 信息安全 秘密共享 RSA 访问结构 information security secret sharing RSA access structure
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献11

  • 1Shamir A. How to share a secret[J]. Communications of the ACM, 1979, 22 ( 11 ) :612 - 613.
  • 2Blakley G. Safeguarding cryptographic keys. In : Proc. AFIPS 1979 Natl. Conf[ M ]. New York : AFIPS Press, 1979:313 - 317.
  • 3Wu t. C, He W H. A geometric approach for sharing secrets[ J]. Computers & Secrety, 1995,14 (2) :135 - 145.
  • 4滕猛,邹鹏,王怀民.一种主动秘密共享算法[J].计算机研究与发展,2003,40(7):1008-1015. 被引量：11
  • 5Yang C C, Chang T Y, Hwang M. S. A (r, n) moltisecret sharing scheme [ J ]. Applied Mathematics and Computation, 2004, 151 (2) :483 -490.
  • 6Benaloh J, Leichter J. Ceneralized secret sharing and monotone functions [ M ]. In : Advances in Cryptology - Crypto ' 88. Benlin : Springer - Verlag, 1990:27 - 35.
  • 7Eskieiolu A M, Delp E J. A key reansport protocol based on secret sharing applieationa to information security [ J ]. IEEE. Trans. Consumer Electronics, 2002, 48 (4) : 816 - 824.
  • 8AI Shahri A F,Smith D G, Irvine J M. A secure network access protocol. In:Proc. 8^th IEEEInt ' 1 Symposium on Computers and Communication. Los Alamitos, CA : IEEEComputer Society press, 2003:809 - 814.
  • 9Cachin C, Body C. On - line secret sharing, in : Proc. 5 th IMA Conf. Berlin : springer - verlag, 1994 : 190 - 198.
  • 10Pinch R. On - line multiple secret sharing[ J]. Electronics Letters, 1996,32 ( 12 ) :1087 - 1090.

二级参考文献11

  • 1R Canetti, R Gennaro, S L Jarecki et al. Adaptive security for threshold cryptosystems. In: Proc of the 19th Annual Int' l Cryptology Conf. Berlin: Springer-Verlag, 1999. 98--115.
  • 2Y Frankel, P Gemmell, P D MacKenzie et al. Optimal-resillence proactive public-key cryptosysterns. In: Proc of the 38th IEEE Symposium on the Foundations of Computer Science. New York:IEEE Computer Society Pree, 1997. 384--393.
  • 3R Ostrovsky, M Yung. How to withstand mobile virus attacks.In: Proc of the 10th ACM Symp on the Principles of Distributed Computing. New York: ACM Press, 1991. 51--59.
  • 4A Herzberg, S L Jarecki, H Krawczyk et al. Proactive secret sharing or: How to cope with perpetual leakage. In:Advances in Cryptology--Crypto'95. Berlin: Springer-Verlag, 1995. 339-352.
  • 5R Gennaro, S L Jarecki, H Krawczyk et al. Robust threshold DSS signature. In: Advances in Cryptology-Eurocrypt.' 96.Berlin: Springer-Verlag, 1996. 354--371.
  • 6A Herzberg, M Jakobsson, S Jarecki et al. Proactive public key and signature systems. ACM Security' 97, Zurich, Switzerland,1997.
  • 7P Feldman. A practical scheme for non-interactive verifiable secret sharing. In: Proc of the 28th Annual IEEE Sympositma on Foundation of Computer Science. New York: IEEE·Computer Society Press, 1987. 427--437.
  • 8R Gennaro, S L Jarecki, H Krawczyk et al. Secure distributed key generation for discrete-log based cryptosysterns. In: Advances in Cryptology--Eyricrtot' 99. Berlin: Springer-Verlag, 1999.295--310.
  • 9T Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In: Proc of the 11th Annual Int' l Cryptology Conf (CRYPTO) . Berlin: Springer-Verlag, 1991.129-- 140.
  • 10Y Frankel, P Gemmel, M Yung. Wimess based cryptographic program checking and robust function sharing. In: Proc of the 28th Annual Symp on Theory of Computing. New York: ACM Press, 1996. 499--508.

共引文献10

山东师范大学学报（自然科学版）
2012年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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