| 1 |
|
| 2 |
|
| 3 |
ITAKURA K . A public-key cryptosystem suitable for digital multisignature. NEC Research and Development, 1983, 71, 1- 8.
|
| 4 |
BARSKI C . Bitcoin for the Befuddled. San Francisco, USA: No Starch Press, 2014.
|
| 5 |
KOKORIS-KOGIAS E, JOVANOVIC P, GAILLY N, et al. Enhancing Bitcoin security and performance with strong consistency via collective signing[C]//Proceedings of the 25th USENIX Conference on Security Symposium. San Diego, USA: USENIX Association, 2016: 279-296.
|
| 6 |
SYTA E, TAMAS I, VISHER D, et al. Keeping authorities "honest or bust" with decentralized witness cosigning[C]//Proceedings of the IEEE Symposium on Security and Privacy (SP). Washington D.C., USA: IEEE Press, 2016: 526-545.
|
| 7 |
|
| 8 |
秦艳琳, 吴晓平. 高效的无证书有序多重签名方案. 通信学报, 2013, 34 (7): 105- 110.
|
|
QIN Y L , WU X P . Efficient certificateless sequential multi-signature scheme. Journal on Communications, 2013, 34 (7): 105- 110.
|
| 9 |
许艳, 黄刘生, 田苗苗, 等. 可证安全的高效无证书有序多重签名方案. 通信学报, 2014, 35 (11): 126- 131.
|
|
XU Y , HUANG L S , TIAN M M , et al. Provably secure and efficient certificateless sequential multi-signature scheme in random oracle model. Journal on Communications, 2014, 35 (11): 126- 131.
|
| 10 |
国家密码管理局. SM2椭圆曲线公钥密码算法: GM/T 0003—2012[S]. 北京: 中国标准出版社, 2010.
|
|
State Cryptography Administration. Public key cryptographic algorithm SM2 based on elliptic curves: GM/T 0003—2012[S]. Beijing: China Standard Press, 2010. (in Chinese)
|
| 11 |
杨宏志, 袁凌云, 王舒. 基于SM2国密算法优化的区块链设计. 计算机工程与设计, 2021, 42 (3): 622- 627.
|
|
YANG H Z , YUAN L Y , WANG S . Optimized blockchain design based on SM2 algorithm. Computer Engineering and Design, 2021, 42 (3): 622- 627.
|
| 12 |
沈荣耀, 马利民, 王佳慧, 等. 基于国密SM2算法的局部可验证聚合签名算法研究. 信息安全研究, 2024, 10 (2): 156- 162.
|
|
SHEN R Y , MA L M , WANG J H , et al. Research on locally verifiable aggregate signature algorithm based on SM2. Journal of Information Security Research, 2024, 10 (2): 156- 162.
|
| 13 |
包子健, 何德彪, 彭聪, 等. 基于SM2数字签名算法的可否认环签名. 密码学报, 2023, 10 (2): 264- 275.
|
|
BAO Z J , HE D B , PENG C , et al. Deniable ring signature scheme based on SM2 digital signature algorithm. Journal of Cryptologic Research, 2023, 10 (2): 264- 275.
|
| 14 |
BELLARE M, NEVEN G. Multi-signatures in the plain public-key model and a general forking lemma[C]//Proceedings of the 13th ACM Conference on Computer and Communications Security. New York, USA: ACM Press, 2006: 390-399.
|
| 15 |
BAGHERZANDI A, CHEON J H, JARECKI S. Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma[C]//Proceedings of the 15th ACM Conference on Computer and Communications Security. New York, USA: ACM Press, 2008: 449-458.
|
| 16 |
MA C S , WENG J , LI Y J , et al. Efficient discrete logarithm based multi-signature scheme in the plain public key model. Designs, Codes and Cryptography, 2010, 54 (2): 121- 133.
doi: 10.1007/s10623-009-9313-z
|
| 17 |
|
| 18 |
XIAO Y , ZHANG P , LIU Y H . Secure and efficient multi-signature schemes for Fabric: an enterprise blockchain platform. IEEE Transactions on Information Forensics and Security, 2021, 16, 1782- 1794.
doi: 10.1109/TIFS.2020.3042070
|
| 19 |
DRIJVERS M, EDALATNEJAD K, FORD B, et al. On the security of two-round multi-signatures[C]//Proceedings of the IEEE Symposium on Security and Privacy (SP). Washington D.C., USA: IEEE Press, 2019: 1084-1101.
|
| 20 |
MAXWELL G , POELSTRA A , SEURIN Y , et al. Simple Schnorr multi-signatures with applications to Bitcoin. Designs, Codes and Cryptography, 2019, 87 (9): 2139- 2164.
doi: 10.1007/s10623-019-00608-x
|
| 21 |
NICK J, RUFFING T, SEURIN Y, et al. MuSig-DN: Schnorr multi-signatures with verifiably deterministic nonces[C]//Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. New York, USA: ACM Press, 2020: 1717-1731.
|
| 22 |
|
| 23 |
王竹, 杨思琦, 李凤华, 等. 高效可证明安全的无证书有序聚合签名方案. 通信学报, 2022, 43 (5): 58- 67.
|
|
WANG Z , YANG S Q , LI F H , et al. Efficient and provably-secure certificateless sequential aggregate signature scheme. Journal on Communications, 2022, 43 (5): 58- 67.
|
| 24 |
陈虹, 曹玥, 金海波, 等. 安全高效的无对运算无证书有序多重签名方案. 计算机应用研究, 2023, 40 (11): 3402- 3407.
|
|
CHEN H , CAO Y , JIN H B , et al. Secure and efficient certificateless sequential multi-signature scheme with no pair operation. Application Research of Computers, 2023, 40 (11): 3402- 3407.
|
| 25 |
尚铭, 马原, 林璟锵, 等. SM2椭圆曲线门限密码算法. 密码学报, 2014, 1 (2): 155- 166.
|
|
SHANG M , MA Y , LIN J Q , et al. A threshold scheme for SM2 elliptic curve cryptographic algorithm. Journal of Cryptologic Research, 2014, 1 (2): 155- 166.
|
| 26 |
侯红霞, 杨波, 张丽娜, 等. 安全的两方协作SM2签名算法. 电子学报, 2020, 48 (1): 1- 8.
|
|
HOU H X , YANG B , ZHANG L N , et al. Secure two-party SM2 signature algorithm. Acta Electronica Sinica, 2020, 48 (1): 1- 8.
|
| 27 |
范青, 何德彪, 罗敏, 等. 基于SM2数字签名算法的环签名方案. 密码学报, 2021, 8 (4): 710- 723.
|
|
FAN Q , HE D B , LUO M , et al. Ring signature schemes based on SM2 digital signature algorithm. Journal of Cryptologic Research, 2021, 8 (4): 710- 723.
|
| 28 |
阮鸥, 陈吉晨, 毛浩. 一种高效的SM2数字签名批量验证算法. 计算机工程与科学, 2021, 43 (7): 1236- 1242.
|
|
RUAN O , CHEN J C , MAO H . An efficient batch verification algorithm for SM2 signatures. Computer Engineering & Science, 2021, 43 (7): 1236- 1242.
|
| 29 |
LIU D N, YUAN Y Y, XUE T F, et al. An efficient batch verification scheme for SM2 signatures[C]//Proceedings of the 8th International Conference on Dependable Systems and Their Applications (DSA). Washington D.C., USA: IEEE Press, 2021: 208-212.
|
| 30 |
ZHANG Y L, WANG H Y, WANG Y C, et al. Signature scheme based on the SM2 algorithm in Fabric[C]//Proceedings of the International Conference on Networking and Network Applications (NaNA). Washington D.C., USA: IEEE Press, 2021: 443-448.
|
| 31 |
国家密码管理局. SM3密码杂凑算法: GM/T 0004—2012[S]. 北京: 中国标准出版社, 2012.
|
|
State Cryptography Administration. SM3 cryptographic hash algorithm: GM/T 0004—2012[S]. Beijing: Standards Press of China, 2012. (in Chinese)
|
| 32 |
BELLARE M, ROGAWAY P. Random oracles are practical: a paradigm for designing efficient protocols[C]//Proceedings of the 1st ACM Conference on Computer and Communications Security. New York, USA: ACM Press, 1993: 62-73.
|
| 33 |
|