Compact zero-knowledge proofs for threshold ECDSA with trustless setup

DOI10.1007/978-3-030-75245-3_18zbMath1479.94352OpenAlexW3164210535MaRDI QIDQ2061931

Xiang Xie, Tsz Hon Yuen, Handong Cui

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_18

zbMATH Keywords

threshold signaturezero-knowledge proofECDSA

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

One-more unforgeability of blind ECDSA ⋮ Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups ⋮ Multi-signatures for ECDSA and its applications in blockchain ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Practical Schnorr threshold signatures without the algebraic group model

Cites Work

• Unnamed Item
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Two-party ECDSA from hash proof systems and efficient instantiations
• Generic groups, collision resistance, and ECDSA
• Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
• On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
• On the Portability of Generalized Schnorr Proofs
• Fast secure two-party ECDSA signing

This page was built for publication: Compact zero-knowledge proofs for threshold ECDSA with trustless setup