Efficient Multiplicative-to-Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold ECDSA
Haiyang Xue, Man Ho Au, Mengling Liu, Kwan Yin Chan, Handong Cui, Xiang Xie, Tsz Hon Yuen, Chengru Zhang
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, 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.
Topics & Concepts
Elliptic Curve Digital Signature AlgorithmMultiplicative functionCryptosystemComputer scienceFunction (biology)Theoretical computer scienceCryptographyParallel computingArithmeticMathematicsPublic-key cryptographyAlgorithmElliptic curve cryptographyComputer securityEncryptionBiologyMathematical analysisEvolutionary biologyCryptography and Data SecurityBlockchain Technology Applications and SecurityComplexity and Algorithms in Graphs