Paper 2023/1312
Efficient Multiplicative-to-Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold ECDSA
Abstract
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,
Note: fix typos
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. ACM CCS 23
- Keywords
- Multiplicative-to-Additive functionJoye-Libert cryptosystemThreshold ECDSAZero-knowledge proof
- Contact author(s)
- haiyangxc @ gmail com
- History
- 2023-10-21: revised
- 2023-09-03: received
- See all versions
- Short URL
- https://ia.cr/2023/1312
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1312, author = {Haiyang Xue and Man Ho Au and Mengling Liu and Kwan Yin Chan and Handong Cui and Xiang Xie and Tsz Hon Yuen and Chengru Zhang}, title = {Efficient Multiplicative-to-Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold {ECDSA}}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1312}, year = {2023}, url = {https://eprint.iacr.org/2023/1312} }