File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Bandwidth-Efficient Zero-Knowledge Proofs For Threshold ECDSA

TitleBandwidth-Efficient Zero-Knowledge Proofs For Threshold ECDSA
Authors
Issue Date2-Jun-2023
PublisherBCS, The Chartered Institute for IT
Citation
The Computer Journal, 2023 How to Cite?
Abstract

In most threshold Elliptic Curve Digital Signature Algorithm (ECDSA) signatures using additively homomorphic encryption, the zero-knowledge (ZK) proofs related to the ciphertext or the message space are the bottleneck in terms of bandwidth as well as computation time. In this paper, we propose a compact ZK proof for relations related to the Castagnos–Laguillaumie (CL) encryption, which is 33% shorter and 29% faster than the existing work in PKC 2021. We also give new ZK proofs for relations related to homomorphic operations over the CL ciphertext. These new ZK proofs are useful to construct a bandwidth-efficient universal composable-secure threshold ECDSA without compromising the proactive security and the non-interactivity. In particular, we lowered the communication and computation cost of the key refresh algorithm in the Paillier-based counterpart from [Math Processing Error] to [Math Processing Error]⁠. Considering a 5-signer setting, the bandwidth is better than the Paillier-based counterpart for up to 99, 95 and 35% for key generation, key refreshment and pre-signing, respectively.


Persistent Identifierhttp://hdl.handle.net/10722/331178
ISSN
2023 Impact Factor: 1.5
2023 SCImago Journal Rankings: 0.520

 

DC FieldValueLanguage
dc.contributor.authorCui, HD-
dc.contributor.authorChan, KY-
dc.contributor.authorYuen, TH-
dc.contributor.authorKang, X-
dc.contributor.authorChu, CK-
dc.date.accessioned2023-09-21T06:53:25Z-
dc.date.available2023-09-21T06:53:25Z-
dc.date.issued2023-06-02-
dc.identifier.citationThe Computer Journal, 2023-
dc.identifier.issn0010-4620-
dc.identifier.urihttp://hdl.handle.net/10722/331178-
dc.description.abstract<p>In most threshold Elliptic Curve Digital Signature Algorithm (ECDSA) signatures using additively homomorphic encryption, the zero-knowledge (ZK) proofs related to the ciphertext or the message space are the bottleneck in terms of bandwidth as well as computation time. In this paper, we propose a compact ZK proof for relations related to the Castagnos–Laguillaumie (CL) encryption, which is 33% shorter and 29% faster than the existing work in PKC 2021. We also give new ZK proofs for relations related to homomorphic operations over the CL ciphertext. These new ZK proofs are useful to construct a bandwidth-efficient universal composable-secure threshold ECDSA without compromising the proactive security and the non-interactivity. In particular, we lowered the communication and computation cost of the key refresh algorithm in the Paillier-based counterpart from [Math Processing Error] to [Math Processing Error]⁠. Considering a 5-signer setting, the bandwidth is better than the Paillier-based counterpart for up to 99, 95 and 35% for key generation, key refreshment and pre-signing, respectively.<br></p>-
dc.languageeng-
dc.publisherBCS, The Chartered Institute for IT-
dc.relation.ispartofThe Computer Journal-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.titleBandwidth-Efficient Zero-Knowledge Proofs For Threshold ECDSA-
dc.typeArticle-
dc.identifier.doi10.1093/comjnl/bxad057-
dc.identifier.eissn1460-2067-
dc.identifier.issnl0010-4620-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats