Two-party ECDSA from hash proof systems and efficient instantiations
From MaRDI portal
Publication:2304919
DOI10.1007/978-3-030-26954-8_7zbMath1436.94102OpenAlexW2968538997MaRDI QIDQ2304919
Federico Savasta, Dario Catalano, Guilhem Castagnos, Ida Tucker, Fabien Laguillaumie
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_7
Related Items (14)
A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency ⋮ Efficient threshold-optimal ECDSA ⋮ Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups ⋮ One round threshold ECDSA without roll call ⋮ 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}\) ⋮ Fast two-party signature for upgrading ECDSA to two-party scenario easily ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Compact zero-knowledge proofs for threshold ECDSA with trustless setup ⋮ Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
This page was built for publication: Two-party ECDSA from hash proof systems and efficient instantiations
