[1]李慧贤,程春田,庞辽军.基于LUC访问结构上的秘密共享方案[J].东南大学学报(自然科学版),2006,36(1):43-46.[doi:10.3969/j.issn.1001-0505.2006.01.009]
 Li Huixian,Cheng Chuntian,Pang Liaojun.LUC-based secret sharing scheme with access structures[J].Journal of Southeast University (Natural Science Edition),2006,36(1):43-46.[doi:10.3969/j.issn.1001-0505.2006.01.009]
点击复制

基于LUC访问结构上的秘密共享方案()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
36
期数:
2006年第1期
页码:
43-46
栏目:
计算机科学与工程
出版日期:
2006-01-20

文章信息/Info

Title:
LUC-based secret sharing scheme with access structures
作者:
李慧贤12 程春田2 庞辽军3
1 大连理工大学计算机科学与工程系, 大连 116024; 2 大连理工大学水电与水信息研究所, 大连 116024; 3 西安电子科技大学综合业务网国家重点实验室, 西安 710071
Author(s):
Li Huixian12 Cheng Chuntian2 Pang Liaojun3
1 Department of Computer Science and Engineering, Dalian University of Technology, Dalian 116024, China
2 Institute of Hydropower System and Hydroinformatics, Dalian University of Technology, Dalian 116024, China
3
关键词:
秘密共享 访问结构 LUC公钥密码体制
Keywords:
secret sharing access structure LUC public key cryptosystem
分类号:
TP918
DOI:
10.3969/j.issn.1001-0505.2006.01.009
摘要:
基于LUC公钥密码体制提出了一个访问结构上的秘密共享方案. 该方案使用参与者的私钥作为其秘密份额, 秘密分发者不需要进行秘密份额的分配. 秘密份额的长度小于或等于秘密的长度. 在秘密重构过程中, 每个合作的参与者只需提交一个由秘密份额计算的伪份额, 且任何人都能够立即检验每个合作的参与者是否进行了欺骗. 该方案可以用来共享任意多个秘密, 而不必更新各参与者的秘密份额. 分析发现, 所提出的方案是一个安全、有效的方案, 特别适合应用于秘密分发者与参与者之间不存在安全通信信道的场合.
Abstract:
A secret sharing scheme with access structures is proposed, which is based on LUC public key cryptosystem. Each participant’s private-key is used as his secret shadow and the secret dealer does not have to distribute each participant’s secret shadow. All these shadows are shorter than or as short as the shared secret. In the recovery phase, each cooperative participant only needs to submit a pseudo-share instead of his secret shadow and anyone is allowed to check whether a cooperative participant provides the true information or not immediately. The secret shadows do not need to be changed when sharing multiple secrets. Analyses show that the proposed scheme is an efficient and computationally secure scheme, and is especially adapted for use in the scenario where there is no secure channel between the secret dealer and participants.

参考文献/References:

[1] Hwang R J,Chang C C.An on-line secret sharing scheme for multi-secrets [J]. Computer Communications,1998,21(13):1170-1176.
[2] Shamir A.How to share a secret [J].Communications of the ACM,1979,22(11):612-613.
[3] Blakley G.Safeguarding cryptographic keys [C] //Proc of AFIPS National Computer Conference.New York:AFIPS Press,1979:313-317.
[4] Benaloh J,Leichter J.Generalized secret sharing and monotone functions [C] //Proc of Advances in Cryptology-Crypto’88.Berlin:Springer-Verlag,1990:27-35.
[5] Wang S J.Direct construction of a secret in generalized group-oriented cryptography [J]. Computer Standards & Interface,2004,26(5):455-460.
[6] Smith P.LUC public-key encryption:a secure alternative to RSA [J].Dr Dobb’s Journal,1993,18(1):44-49.
[7] 王育民,刘建伟.通信网的安全——理论与技术[M].西安:西安电子科技大学出版社,1999:210-215.
[8] Yang C C,Chang T Y,Hwang M S.A(t,n)multi-secret sharing scheme [J].Applied Mathematics and Computation,2004,151(2):483-490.
[9] Rivest R L,Shamir A,Adleman L.A method for obtaining digital signatures and public key cryptosystem [J].Communication of ACM,1978,21(2):120-126.

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金资助项目(50479055)、国家重点基础发展计划(973计划)资助项目(G1999035805).
作者简介: 李慧贤(1977—), 女, 博士生; 程春田(联系人), 男, 博士, 教授, 博士生导师, ctcheng@dlut.edu.cn.
更新日期/Last Update: 2006-01-20