A SECRET SHARING SCHEME BASED ON NEAR-MDS CODES

被引：21
作者：
Zhou, Yousheng [1 ,2 ,3 ,4 ]
Wang, Feng [1 ,2 ,3 ]
Xin, Yang [1 ,2 ,3 ,4 ]
Luo, Shoushan [1 ,2 ,3 ,4 ]
Qing, Sihan [5 ]
Yang, Yixian [1 ,2 ,3 ]
机构：
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Informat Secur Ctr, Beijing 100876, Peoples R China
[2] Beijing Univ Posts & Telecommun, Key Lab Network & Informat Attack & Def Technol M, Beijing 100876, Peoples R China
[3] Natl Engn Lab Disaster Backup & Recovery, Beijing 100876, Peoples R China
[4] Beijing Safe Code Technol Co Ltd, Beijing 100876, Peoples R China
[5] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
来源：
2009 IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT, PROCEEDINGS | 2009年
基金：
中国国家自然科学基金;
关键词：
secret sharing; access structure; Near-MDS codes;
D O I：
10.1109/ICNIDC.2009.5360821
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider the application of Near-MDS codes in cryptography. Near-MDS codes have some important properties that can be used to construct secret sharing schemes. The proposed secret sharing schemes in this paper have good security properties such as cheating detection and cheaters identification when recovering. the secret. In addition, the number of participants in our proposed scheme is more than previous results.
引用
收藏
页码：833 / +
页数：2
相关论文
共 11 条
[1]  
Blakley G.R., 1979, P 1979 AFIPS NAT COM, V48, P313, DOI 10.1109/MARK.1979.8817296
[2]  
DODUNEKOV S, 2003, J GEOMETRY, V54, P30
[3]   ON SECRET SHARING SYSTEMS [J].
KARNIN, ED ;
GREENE, JW ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) :35-41
[4]  
Massey JL., 1995, Codes and Cyphers: Cryptography and Coding IV, P33
[5]  
MCELIECE RJ, 1981, COMMUNICATIONS ACM, V24
[6]  
Pieprzyk J, 2002, LECT NOTES COMPUT SC, V2587, P253
[7]  
RABIN T, 1989, COMMUN ACM, P73
[8]  
ROMAN S, 1992, CODING INFORM THEORY, P255
[9]  
SELBERG EW, 1993, CS93182 CARN MELL U
[10]   HOW TO SHARE A SECRET [J].
SHAMIR, A .
COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613
12