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 条
  • [41] Efficient Secure Two-Party Exponentiation
    Yu, Ching-Hua
    Chow, Sherman S. M.
    Chung, Kai-Min
    Liu, Feng-Hao
    TOPICS IN CRYPTOLOGY - CT-RSA 2011, 2011, 6558 : 17 - +
  • [42] LEGO for Two-Party Secure Computation
    Nielsen, Jesper Buus
    Orlandi, Claudio
    THEORY OF CRYPTOGRAPHY, 6TH THEORY OF CRYPTOGRAPHY CONFERENCE, TCC 2009, 2009, 5444 : 368 - 386
  • [43] A Reputational Theory of Two-Party Competition
    Kalandrakis, Tasos
    QUARTERLY JOURNAL OF POLITICAL SCIENCE, 2009, 4 (04) : 343 - 378
  • [44] A new two-party bargaining mechanism
    Gu, Y. H.
    Goh, M.
    Chen, Q. L.
    Souza, R. D.
    Tang, G. C.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (01) : 135 - 163
  • [45] Is Our Two-Party System "Natural"?
    Charlesworth, James C.
    ANNALS OF THE AMERICAN ACADEMY OF POLITICAL AND SOCIAL SCIENCE, 1948, 259 : 1 - 9
  • [46] Secure Two-Party Computational Geometry
    Shun-Dong Li
    Yi-Qi Dai
    Journal of Computer Science and Technology, 2005, 20 : 258 - 263
  • [47] On the Power of Secure Two-Party Computation
    Hazay, Carmit
    Venkitasubramaniam, Muthuramakrishnan
    JOURNAL OF CRYPTOLOGY, 2020, 33 (01) : 271 - 318
  • [48] Efficient Covert Two-Party Computation
    Jarecki, Stanislaw
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2018, PT I, 2018, 10769 : 644 - 674
  • [49] On the Power of Secure Two-Party Computation
    Carmit Hazay
    Muthuramakrishnan Venkitasubramaniam
    Journal of Cryptology, 2020, 33 : 271 - 318
  • [50] Two-party computing with encrypted data
    Choi, Seung Geol
    Elbaz, Ariel
    Juels, Ari
    Malkin, Tal
    Yung, Moti
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2007, 2007, 4833 : 298 - +