基于中国剩余定理的秘密共享算法
|
摘要
提出了一种基于中国剩余定理的秘密共享算法.算法设定数据所有者拥有n个数据文件,在加密阶段,算法根据中国剩余定理生成n-1级多项式,利用该多项式对子文件集合中的所有机密文件进行加密,只有授权数据使用者可以访问相应的子文件;解密阶段中数据使用者将私有共享和对应的公共共享进行组合,而后恢复该授权用户想要访问的原始文件或文件集合.经过分析实验证明,所提出的算法与其他算法相比具有计算效率高,不易被破解等优点.
A secret sharing algorithm is presented based on Chinese residual theorem. The algorithm sets the data owner to have a set of n data files. In the encryption phase, the algorithm generates the n-1 polynomial according to the Chinese residual theorem. The polynomial is used to encrypt all the confidential files in the subfile collection. Only the authorized data user can access the corresponding subfile.Decryption phase of the data user will be private sharing and the corresponding public sharing combination,and then restore the authorized user wants to access the original file or file collection. Experiments show that the algorithm proposed here has the advantages of high computational efficiency and easy to be cracked compared with other algorithms.
A secret sharing algorithm is presented based on Chinese residual theorem. The algorithm sets the data owner to have a set of n data files. In the encryption phase, the algorithm generates the n-1 polynomial according to the Chinese residual theorem. The polynomial is used to encrypt all the confidential files in the subfile collection. Only the authorized data user can access the corresponding subfile.Decryption phase of the data user will be private sharing and the corresponding public sharing combination,and then restore the authorized user wants to access the original file or file collection. Experiments show that the algorithm proposed here has the advantages of high computational efficiency and easy to be cracked compared with other algorithms.
引文
1王于丁,杨家海,徐聪,等.云计算访问控制技术研究综述[J].软件学报,2015,26(5):1 129-1 150.
2李经纬,贾春福,刘哲理,等.可搜索加密技术研究综述[J].软件学报,2015,26(1):109-128.
3 Yan X,Lu Y,Huang H,et al.Quality-adaptive threshold visual secret sharing by random grids[C/OL]//IEEE:International Conference on Signal and Image Processing,Beijing,China,Aug 13-15,2016.[2018-02-014].https://ieeexplore.ieee.org/document/7888277.
4谭振华,杨广明,王兴伟,等.面向云存储的多维球面门限秘密共享方案[J].软件学报,2016,27(11):2 912-2 928.
5 Boyle E,Gilboa N,Ishai Y.Function secret sharing:Improvements and extensions[C]//ACM.Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security:2016.New York:ACM,2016:1 292-1 303.
6张恩,耿魁,金伟,等.抗隐蔽敌手的云外包秘密共享方案[J].通信学报,2017,38(5):57-65.
7庞辽军,裴庆祺,李慧贤,等.秘密共享技术及其应用[M].北京:人民邮电出版社,2017.
8 Miao F,Wang L,Yangyang J I,et al.GOMSS:A simple group oriented(t,m,n)multi-secret sharing scheme[J].Chinese Journal of Electronics,2017,26(3):557-563.
9 Shamir A.How to share a secret[J].Communications of ACM,1979,22(11):612-613.
10 Blakley G R.Safeguarding cryptographic keys[J].AFIPS Conference Proceedings,1979,48:313-317.
11 Asmuth C,Bloom J.A modular approach to key safeguarding[J].Information Theory IEEE Transactions on,1983,29(2):208-210.
12 Mignotte M.How to Share a Secret(Lecture Notes in Computer Science 149)[M].Feuerstein:Springer,1983.
13 Brickell E F.Some Ideal Secret Sharing Schemes(Lecture Notes in Computer Science 434)[M].New York:Springer,1990.
14 Tochikubo K.Efficient secret sharing schemes based on unauthorized subsets[J].Ieice Transactions on Fundamentals of Electronics Communications&Computer Sciences,2005,88A(1):322-326.
15许春香,肖国镇.门限多重秘密共享方案[J].电子学报,2004,32(10):1 688-1 689.
16 Liu Y,Wu H L,Chang C C.A fast and secure scheme for data outsourcing in the cloud[J].Ksii Transactions on Internet&Information Systems,2014,8(8):2 708-2 721.
17陈其明.基于中国剩余定理的可验证秘密共享研究[D].合肥工业大学:信息科学学院,2011.
18黄科华.基于二元多项式与中国剩余定理的多秘密分享方案[J].长沙大学学报,2015,29(2):8-10.
19陈泽文,张龙军,王育民,等.一种基于中国剩余定理的群签名方案[J].信息安全与通信保密,2008,32(12):140-142.
20徐甫,马静谨.基于中国剩余定理的门限RSA签名方案的改进[J].电子与信息学报,2015,37(10):2 495-2 500.
21 Fawcett T.An introduction to ROC analysis[J].Pattern Recognition Letters,2006,27(8):861-874.
2李经纬,贾春福,刘哲理,等.可搜索加密技术研究综述[J].软件学报,2015,26(1):109-128.
3 Yan X,Lu Y,Huang H,et al.Quality-adaptive threshold visual secret sharing by random grids[C/OL]//IEEE:International Conference on Signal and Image Processing,Beijing,China,Aug 13-15,2016.[2018-02-014].https://ieeexplore.ieee.org/document/7888277.
4谭振华,杨广明,王兴伟,等.面向云存储的多维球面门限秘密共享方案[J].软件学报,2016,27(11):2 912-2 928.
5 Boyle E,Gilboa N,Ishai Y.Function secret sharing:Improvements and extensions[C]//ACM.Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security:2016.New York:ACM,2016:1 292-1 303.
6张恩,耿魁,金伟,等.抗隐蔽敌手的云外包秘密共享方案[J].通信学报,2017,38(5):57-65.
7庞辽军,裴庆祺,李慧贤,等.秘密共享技术及其应用[M].北京:人民邮电出版社,2017.
8 Miao F,Wang L,Yangyang J I,et al.GOMSS:A simple group oriented(t,m,n)multi-secret sharing scheme[J].Chinese Journal of Electronics,2017,26(3):557-563.
9 Shamir A.How to share a secret[J].Communications of ACM,1979,22(11):612-613.
10 Blakley G R.Safeguarding cryptographic keys[J].AFIPS Conference Proceedings,1979,48:313-317.
11 Asmuth C,Bloom J.A modular approach to key safeguarding[J].Information Theory IEEE Transactions on,1983,29(2):208-210.
12 Mignotte M.How to Share a Secret(Lecture Notes in Computer Science 149)[M].Feuerstein:Springer,1983.
13 Brickell E F.Some Ideal Secret Sharing Schemes(Lecture Notes in Computer Science 434)[M].New York:Springer,1990.
14 Tochikubo K.Efficient secret sharing schemes based on unauthorized subsets[J].Ieice Transactions on Fundamentals of Electronics Communications&Computer Sciences,2005,88A(1):322-326.
15许春香,肖国镇.门限多重秘密共享方案[J].电子学报,2004,32(10):1 688-1 689.
16 Liu Y,Wu H L,Chang C C.A fast and secure scheme for data outsourcing in the cloud[J].Ksii Transactions on Internet&Information Systems,2014,8(8):2 708-2 721.
17陈其明.基于中国剩余定理的可验证秘密共享研究[D].合肥工业大学:信息科学学院,2011.
18黄科华.基于二元多项式与中国剩余定理的多秘密分享方案[J].长沙大学学报,2015,29(2):8-10.
19陈泽文,张龙军,王育民,等.一种基于中国剩余定理的群签名方案[J].信息安全与通信保密,2008,32(12):140-142.
20徐甫,马静谨.基于中国剩余定理的门限RSA签名方案的改进[J].电子与信息学报,2015,37(10):2 495-2 500.
21 Fawcett T.An introduction to ROC analysis[J].Pattern Recognition Letters,2006,27(8):861-874.