Fast two-party signature for upgrading ECDSA to two-party scenario easily

被引:2
|
作者
Tu, Binbin [1 ,2 ,3 ,4 ]
Chen, Yu [1 ,2 ,3 ]
Cui, Hongrui [5 ]
Wang, Xianfang [4 ]
机构
[1] Shandong Univ, Sch Cyber Sci & Technol, Qingdao 266237, Peoples R China
[2] State Key Lab Cryptol, POB 5159, Beijing 100878, Peoples R China
[3] Shandong Univ, Key Lab Cryptol Technol & Informat Secur, Minist Educ, Qingdao 266237, Peoples R China
[4] CETC Cyberspace Secur Technol Co Ltd, Beijing 100070, Peoples R China
[5] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Two-party signature; ECDSA; Combinatorial ECDSA; Signing key protection;
D O I
10.1016/j.tcs.2023.114325
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
ECDSA is a standardized signature scheme and is widely used in many fields. However, most two-party ECDSA require a complicated multi-party computation technique to compute the multiplication of many shared secrets and necessitate expensive zero-knowledge proofs to deal with malicious adversaries.In this paper, we propose a simple yet fast two-party signing protocol based on ECDSA security, whose signing operation of each party is similar to the original ECDSA signing algorithm. Our protocol can enjoy the same efficiency as ECDSA and upgrades the existing ECDSA application to two-party scenario friendly. For this purpose, we first introduce a variant of ECDSA called combinatorial ECDSA, which is as secure as the standard ECDSA and can be easily divided into two parts. Then, we devise a two-party signing protocol without complicated multi-party computation from the combinatorial ECDSA and give the security proof based on ECDSA. Compared with the state-of-the-art two-party ECDSA, the signing result of each party in our protocol maintains the structure of ECDSA signature, which can be verified easily and avoids expensive zero-knowledge proofs. Last, we conduct an experimental evaluation, demonstrating that the performance of our combinatorial ECDSA and two-party signature is similar to ECDSA and the experimental results show that our proposed schemes are practical.
引用
收藏
页数:12
相关论文
共 50 条
  • [21] Two-Party Signing For ISO/IEC Digital Signature Standards
    Tang, Guofeng
    Zhang, Zhenfeng
    COMPUTER JOURNAL, 2023, 66 (05): : 1111 - 1125
  • [22] DiLizium: A Two-Party Lattice-Based Signature Scheme
    Vakarjuk, Jelizaveta
    Snetkov, Nikita
    Willemson, Jan
    ENTROPY, 2021, 23 (08)
  • [23] Secure Two-Party SM2 Signature Algorithm
    Hou H.-X.
    Yang B.
    Zhang L.-N.
    Zhang M.-R.
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2020, 48 (01): : 1 - 8
  • [24] Consecutive Adaptor Signature Scheme: From Two-Party to N-Party Settings
    Kajita, Kaisei
    Ohtake, Go
    Takagi, Tsuyoshi
    PROVABLE AND PRACTICAL SECURITY, PROVSEC 2024, PT I, 2025, 14903 : 23 - 42
  • [25] The Nature of Party Categories in Two-Party and Multiparty Systems
    Nicholson, Stephen P.
    Carman, Christopher J.
    Coe, Chelsea M.
    Feeney, Aidan
    Feher, Balazs
    Hayes, Brett K.
    Kam, Christopher
    Karp, Jeffrey A.
    Vaczi, Gergo
    Heit, Evan
    POLITICAL PSYCHOLOGY, 2018, 39 : 279 - 304
  • [26] Geometry of Secure Two-party Computation
    Basu, Saugata
    Khorasgani, Hamidreza Amini
    Maji, Hemanta K.
    Nguyen, Hai H.
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 1035 - 1044
  • [27] THE TWO-PARTY SYSTEM IN BRITISH POLITICS=
    Lipson, Leslie
    AMERICAN POLITICAL SCIENCE REVIEW, 1953, 47 (02) : 337 - 358
  • [28] NECESSITY FOR DOMICILE IN TWO-PARTY DIVORCES
    不详
    COLUMBIA LAW REVIEW, 1952, 52 (02) : 282 - 283
  • [29] Two-party generation of DSA signatures
    Philip MacKenzie
    Michael K. Reiter
    International Journal of Information Security, 2004, 2 (3-4) : 218 - 239
  • [30] Secure Two-Party Computation Is Practical
    Pinkas, Benny
    Schneider, Thomas
    Smart, Nigel P.
    Williams, Stephen C.
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2009, 2009, 5912 : 250 - +