Efficient Multiplicative-to-Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold ECDSA
Published in 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS 2023), Copenhagen, Denmark, 2023
Recommended citation: Haiyang Xue, Man Ho Au, Mengling Liu, Kwan Yin Chan, Handong Cui, Xiang Xie, Tsz Hon Yuen, and Chengru Zhang. “Efficient Multiplicative-to-Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold ECDSA.” In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS 2023), pp. 2974–2988, 2023. https://doi.org/10.1145/3576915.3616595
This work develops a new multiplicative-to-additive conversion based on the Joye–Libert cryptosystem, a key building block for threshold ECDSA. It provides efficient zero-knowledge proofs with standard soundness and improves bandwidth and computation trade-offs over prior constructions.