Journal of Computer Applications ›› 2015, Vol. 35 ›› Issue (7): 1877-1881.DOI: 10.11772/j.issn.1001-9081.2015.07.1877

Previous Articles     Next Articles

Secret sharing scheme only needing XOR operations

YUAN Qizhao1, CAI Hongliang1, ZHANG Jingzhong1, XIA Hangyu2   

  1. 1. Chengdu Institute of Computer Application, Chinese Academy of Sciences, Chengdu Sichuan 610041, China;
    2. College of Informatics, Huazhong Agricultural University, Wuhan Hubei 430070, China
  • Received:2015-01-20 Revised:2015-03-20 Online:2015-07-10 Published:2015-07-17


袁琦钊1, 蔡红亮1, 张景中1, 夏航宇2   

  1. 1. 中国科学院 成都计算机应用研究所, 成都 610041;
    2. 华中农业大学 信息学院, 武汉 430070
  • 通讯作者: 袁琦钊(1985-),男,湖南资兴人,博士研究生,主要研究方向:编码理论、信息安全,
  • 作者简介:蔡红亮(1983-),男,山西临汾人,博士研究生,主要研究方向:编码理论、信息安全; 张景中(1986-),男,江西上饶人,博士研究生,主要研究方向:编码理论、信息安全。
  • 基金资助:



The traditional secret sharing schemes based on interpolation polynomial require a heavy computational cost. When the data is large, the efficiency of operation is particularly low. Therefore, a new secret sharing scheme for protecting the security of large scale data was proposed. The proposed scheme used the data block's method and need the exclusive-OR (XOR) operation over GF(2) only. The theoretical analysis and experimental results show that, compared to the traditional secret sharing scheme based on interpolation polynomial, the new scheme is increased by 19.3% in the operational efficiency.

Key words: large-scale data, information security, secret sharing, Reed-Solomon (RS) code, eXclusive-OR(XOR) operation



关键词: 大规模数据, 信息安全, 秘密分享, RS码, 异或运算

CLC Number: