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 条
  • [31] On Statistical Security in Two-Party Computation
    Khurana, Dakshita
    Mughees, Muhammad Haris
    THEORY OF CRYPTOGRAPHY, TCC 2020, PT II, 2020, 12551 : 532 - 561
  • [32] A new two-party bargaining mechanism
    Y. H. Gu
    M. Goh
    Q. L. Chen
    R. D. Souza
    G. C. Tang
    Journal of Combinatorial Optimization, 2013, 25 : 135 - 163
  • [33] On the Complexity of Two-Party Differential Privacy
    Haitner, Iftach
    Mazor, Noam
    Silbak, Jad
    Tsfadia, Eliad
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 1392 - 1405
  • [34] The Limits of Two-Party Differential Privacy
    McGregor, Andrew
    Mironov, Ilya
    Pitassi, Toniann
    Reingold, Omer
    Talwar, Kunal
    Vadhan, Salil
    2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 81 - 90
  • [35] Two-party competition with persistent policies
    Forand, Jean Guillaume
    JOURNAL OF ECONOMIC THEORY, 2014, 152 : 64 - 91
  • [36] Secrecy of two-party secure computation
    Chiang, YT
    Wang, DW
    Liau, CJ
    Hsu, TS
    DATA AND APPLICATIONS SECURITY XIX, PROCEEDINGS, 2005, 3654 : 114 - 123
  • [37] The tyranny of the two-party system.
    Pederson, WD
    LIBRARY JOURNAL, 2002, 127 (12) : 100 - 100
  • [38] On the Power of Secure Two-Party Computation
    Hazay, Carmit
    Venkitasubramaniam, Muthuramakrishnan
    ADVANCES IN CRYPTOLOGY (CRYPTO 2016), PT II, 2016, 9815 : 397 - 429
  • [39] Secure two-party computational geometry
    Li, SD
    Dai, YQ
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (02) : 258 - 263
  • [40] Contracts for Interacting Two-Party Systems
    Pace, Gordon J.
    Schapachnik, Fernando
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (94): : 21 - 30