Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA
Threshold ECDSA receives interest lately due to its widespread adoption in blockchain applications. A common building block of all leading constructions involves a secure conversion of multiplicative shares into additive ones, which is called the multiplicative-to-additive (MtA) function. MtA domina...
Saved in:
Main Authors: | , , , , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9187 https://ink.library.smu.edu.sg/context/sis_research/article/10192/viewcontent/3576915.3616595.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-10192 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-101922024-08-13T05:19:10Z Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA XUE, Haiyang AU, Ho Man LIU, Mengling CHAN, Yin Kwan CUI, Handong XIE, Xiang YUEN, Hon Tsz ZHANG, Chengru Threshold ECDSA receives interest lately due to its widespread adoption in blockchain applications. A common building block of all leading constructions involves a secure conversion of multiplicative shares into additive ones, which is called the multiplicative-to-additive (MtA) function. MtA dominates the overall complexity of all existing threshold ECDSA constructions. Specifically, O(n2) invocations of MtA are required in the case of n active signers. Hence, improvement of MtA leads directly to significant improvements for all state-of-the-art threshold ECDSA schemes.In this paper, we design a novel MtA by revisiting the Joye-Libert (JL) cryptosystem. Specifically, we revisit JL encryption and propose a JL-based commitment, then give efficient zero-knowledge proofs for JL cryptosystem which are the first to have standard soundness. Our new MtA offers the best time-space complexity trade-off among all existing MtA constructions. It outperforms state-of-the-art constructions from Paillier by a factor of 1.85 to 2 in bandwidth and 1.2 to 1.7 in computation. It is 7X faster than those based on Castagnos-Laguillaumie encryption only at the cost of 2X more bandwidth. While our MtA is slower than OT-based constructions, it saves 18.7X in bandwidth requirement. In addition, we also design a batch version of MtA to further reduce the amortised time and space cost by another 25%. 2024-11-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/9187 info:doi/10.1145/3576915.3616595 https://ink.library.smu.edu.sg/context/sis_research/article/10192/viewcontent/3576915.3616595.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Multiplicative-to-Additive function Joye-Libert cryptosystem Threshold ECDSA Zero-knowledge proof Information Security |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Multiplicative-to-Additive function Joye-Libert cryptosystem Threshold ECDSA Zero-knowledge proof Information Security |
spellingShingle |
Multiplicative-to-Additive function Joye-Libert cryptosystem Threshold ECDSA Zero-knowledge proof Information Security XUE, Haiyang AU, Ho Man LIU, Mengling CHAN, Yin Kwan CUI, Handong XIE, Xiang YUEN, Hon Tsz ZHANG, Chengru Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA |
description |
Threshold ECDSA receives interest lately due to its widespread adoption in blockchain applications. A common building block of all leading constructions involves a secure conversion of multiplicative shares into additive ones, which is called the multiplicative-to-additive (MtA) function. MtA dominates the overall complexity of all existing threshold ECDSA constructions. Specifically, O(n2) invocations of MtA are required in the case of n active signers. Hence, improvement of MtA leads directly to significant improvements for all state-of-the-art threshold ECDSA schemes.In this paper, we design a novel MtA by revisiting the Joye-Libert (JL) cryptosystem. Specifically, we revisit JL encryption and propose a JL-based commitment, then give efficient zero-knowledge proofs for JL cryptosystem which are the first to have standard soundness. Our new MtA offers the best time-space complexity trade-off among all existing MtA constructions. It outperforms state-of-the-art constructions from Paillier by a factor of 1.85 to 2 in bandwidth and 1.2 to 1.7 in computation. It is 7X faster than those based on Castagnos-Laguillaumie encryption only at the cost of 2X more bandwidth. While our MtA is slower than OT-based constructions, it saves 18.7X in bandwidth requirement. In addition, we also design a batch version of MtA to further reduce the amortised time and space cost by another 25%. |
format |
text |
author |
XUE, Haiyang AU, Ho Man LIU, Mengling CHAN, Yin Kwan CUI, Handong XIE, Xiang YUEN, Hon Tsz ZHANG, Chengru |
author_facet |
XUE, Haiyang AU, Ho Man LIU, Mengling CHAN, Yin Kwan CUI, Handong XIE, Xiang YUEN, Hon Tsz ZHANG, Chengru |
author_sort |
XUE, Haiyang |
title |
Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA |
title_short |
Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA |
title_full |
Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA |
title_fullStr |
Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA |
title_full_unstemmed |
Efficient multiplicative-to-additive function from Joye-Libert cryptosystem and its application to threshold ECDSA |
title_sort |
efficient multiplicative-to-additive function from joye-libert cryptosystem and its application to threshold ecdsa |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2024 |
url |
https://ink.library.smu.edu.sg/sis_research/9187 https://ink.library.smu.edu.sg/context/sis_research/article/10192/viewcontent/3576915.3616595.pdf |
_version_ |
1814047785528328192 |