Page 471 - 《软件学报》2025年第8期
P. 471

3894                                                       软件学报  2025  年第  36  卷第  8  期


                 [12]  Tang  ZY,  Wang  ZW.  A  threshold  SM2  Signature  scheme.  Journal  of  Nanjing  University  of  Posts  and  Telecommunications  (Natural
                     Science), 2022, 42(4): 85–95 (in Chinese with English abstract). [doi: 10.14132/j.cnki.1673-5439.2022.04.012]
                 [13]  Han G, Bai X, Geng SL, Qin BD. Efficient two-party SM2 signing protocol based on secret sharing. Journal of Systems Architecture,
                     2022, 132: 102738. [doi: 10.1016/j.sysarc.2022.102738]
                 [14]  Shang M, Ma Y, Lin JQ, Jing JW. A threshold scheme for SM2 elliptic curve cryptographic algorithm. Journal of Cryptologic Research,
                     2014, 1(2): 155–166 (in Chinese with English abstract). [doi: 10.13868/j.cnki.jcr.000015]
                 [15]  Tu BB, Wang XF, Zhang LT. Two distributed applications of SM2 and SM9. Journal of Cryptologic Research, 2020, 7(6): 826–838 (in
                     Chinese with English abstract). [doi: 10.13868/j.cnki.jcr.000409]
                 [16]  Pang  LJ,  Fei  QQ,  Li  HX,  Xu  QJ.  Secret  sharing  technology  and  its  applications.  Journal  on  Communications,  2017,  38(3):  183  (in
                     Chinese with English abstract).
                 [17]  Miao  FY,  Wang  L,  Ji  YY,  Xiong  Y.  GOMSS:  A  simple  group  oriented  (t,  m,  n)  multi-secret  sharing  scheme.  Chinese  Journal  of
                     Electronics, 2017, 26(3): 557–563. [doi: 10.1049/cje.2016.08.014]
                 [18]  Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612–613. [doi: 10.1145/359168.359176]
                 [19]  Blakley GR. Safeguarding cryptographic keys. In: Proc. of the 1979 Int’l Workshop on Managing Requirements Knowledge. New York:
                     IEEE, 1979. 313–313. [doi: 10.1109/MARK.1979.8817296]
                 [20]  Asmuth C, Bloom J. A modular approach to key safeguarding. IEEE Trans. on Information Theory, 1983, 29(2): 208–210. [doi: 10.1109/
                     TIT.1983.1056651]
                 [21]  Ore O. The general Chinese remainder theorem. The American Mathematical Monthly, 1952, 59(6): 365–370. [doi: 10.1080/00029890.
                     1952.11988142]
                 [22]  Mignotte M. How to share a secret. In: Proc. of the 1983 Workshop on Cryptography. Burg Feuerstein: Springer, 1983. 371–375. [doi: 10.
                     1007/3-540-39466-4_27]
                 [23]  Morillo P, Padró C, Sáez G, Villar JL. Weighted threshold secret sharing schemes. Information Processing Letters, 1999, 70(5): 211–216.
                     [doi: 10.1016/S0020-0190(99)00070-8]
                 [24]  Beimel A, Weinreb E. Monotone circuits for monotone weighted threshold functions. Information Processing Letters, 2006, 97(1): 12–18.
                     [doi: 10.1016/j.ipl.2005.09.008]
                 [25]  Beimel A, Tassa T, Weinreb E. Characterizing ideal weighted threshold secret sharing. SIAM Journal on Discrete Mathematics, 2008,
                     22(1): 360–397. [doi: 10.1137/S0895480104445654]
                 [26]  Iftene S, Boureanu I. Weighted threshold secret sharing based on the Chinese remainder theorem. Technical Report, Iasi: Faculty of
                     Computer Science Iasi, Romania. https://infoscience.epfl.ch/server/api/core/bitstreams/0d0302bf-b0d4-40d9-9215-55291d208bfb/content
                 [27]  Chaidos  P,  Kiayias  A.  Mithril:  Stake-based  threshold  multisignatures.  In:  Proc.  of  the  2024  Int’l  Conf.  on  Cryptology  and  Network
                     Security. Cambridge: Springer. 2024. 239–263.
                 [28]  Garg S, Jain A, Mukherjee P, Sinha R, Wang MY, Zhang YN. Cryptography with weights: MPC, encryption and signatures. In: Proc. of
                     the 43rd Annual Int’l Cryptology Conf. on Advances in Cryptology. Santa Barbara: Springer, 2023. 295–327. [doi: 10.1007/978-3-031-
                     38557-5_10]
                 [29]  Chen  ZW,  Zhang  LJ,  Wang  YM,  Huang  JW,  Huang  DR.  A  group  signature  scheme  based  on  Chinese  remainder  theorem.  Acta
                     Electronica Sinica, 2004, 32(7): 1062–1065 (in Chinese with English abstract). [doi: 10.3321/j.issn:0372-2112.2004.07.002]
                 [30]  Goldreich O, Ron D, Sudan M. Chinese remaindering with errors. IEEE Trans. on Information Theory, 2000, 46(4): 1330–1338. [doi: 10.
                     1109/18.850672]
                 [31]  Goldwasser  S,  Micali  S,  Rivest  RL.  A  digital  signature  scheme  secure  against  adaptive  chosen-message  attacks.  SIAM  Journal  on
                     Computing, 1988, 17(2): 281–308. [doi: 10.1137/0217017]
                 [32]  Zhang ZF, Yang K, Zhang J, Cheng C. Security of the SM2 signature scheme against generalized key substitution attacks. In: Proc. of the
                     2nd Int’l Conf. on Security Standardisation Research. Tokyo: Springer. 2015. 140–153. [doi: 10.1007/978-3-319-27152-1_7]

                 附中文参考文献:
                  [1]  徐秋亮, 李大兴. 椭圆曲线密码体制. 计算机研究与发展, 1999, 36(11): 1281–1288.
                  [2]  汪朝晖, 张振峰. SM2  椭圆曲线公钥密码算法综述. 信息安全研究, 2016, 2(11): 972–982.
                  [3]  国家密码管理局. 国家密码管理局关于发布《SM2        椭圆曲线公钥密码算法》公告. 2010. https://www.oscca.gov.cn/sca/xxgk/2010-
                     12/17/content_1002386.shtml
                  [4]  林璟锵, 马原, 荆继武, 王琼霄, 雷灵光, 蔡权伟, 王雷. 适用于云计算的基于          SM2  算法的签名及解密方法和系统. 中国:
   466   467   468   469   470   471   472   473   474   475   476