A SECRET SHARING SCHEME BASED ON NEAR-MDS CODES

被引：17
|
作者：
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
相关论文
共 50 条
  • [1] On near-MDS codes and caps
    Ceria, Michela
    Cossidente, Antonio
    Marino, Giuseppe
    Pavese, Francesco
    DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (03) : 1095 - 1110
  • [2] A matrix characterization of Near-MDS codes
    Viswanath, G
    Rajan, BS
    ARS COMBINATORIA, 2006, 79 : 289 - 294
  • [3] On the extendibility of near-MDS elliptic codes
    Giulietti, M
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2004, 15 (01) : 1 - 11
  • [4] On the Extendibility of Near-MDS Elliptic Codes
    Massimo Giulietti
    Applicable Algebra in Engineering, Communication and Computing, 2004, 15 : 1 - 11
  • [5] MDS and near-MDS codes via twisted Reed–Solomon codes
    Junzhen Sui
    Xiaomeng Zhu
    Xueying Shi
    Designs, Codes and Cryptography, 2022, 90 : 1937 - 1958
  • [6] MDS and near-MDS codes via twisted Reed-Solomon codes
    Sui, Junzhen
    Zhu, Xiaomeng
    Shi, Xueying
    DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (08) : 1937 - 1958
  • [7] A Riemann hypothesis analogue for near-MDS codes
    Kim, Dong Chan
    Hyun, Jong Yoon
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (16-17) : 2440 - 2444
  • [8] Near-MDS codes from elliptic curves
    Angela Aguglia
    Luca Giuzzi
    Angelo Sonnino
    Designs, Codes and Cryptography, 2021, 89 : 965 - 972
  • [9] Near-MDS codes from elliptic curves
    Aguglia, Angela
    Giuzzi, Luca
    Sonnino, Angelo
    DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (05) : 965 - 972
  • [10] Almost-MDS and near-MDS codes for error detection
    Dodunekova, R
    Dodunekov, SM
    Klove, T
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (01) : 285 - 290
12345