Bandwidth-efficient threshold EC-DSA
From MaRDI portal
Publication:2055695
DOI10.1007/978-3-030-45388-6_10zbMath1481.94134OpenAlexW3021332472MaRDI QIDQ2055695
Dario Catalano, Guilhem Castagnos, Ida Tucker, Fabien Laguillaumie, Federico Savasta
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_10
Related Items (10)
Efficient threshold-optimal ECDSA ⋮ Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups ⋮ 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}\) ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Practical Schnorr threshold signatures without the algebraic group model ⋮ 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 ⋮ Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient signature generation by smart cards
- Verifiable delay functions
- Encryption switching protocols revisited: switching modulo \(p\)
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- A signature scheme based on the intractability of computing roots
- Bandwidth-efficient threshold EC-DSA
- Distributing any elliptic curve based protocol
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
- Two-party ECDSA from hash proof systems and efficient instantiations
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
- Robust Threshold DSS Signatures
- How to share a secret
- Robust and Efficient Sharing of RSA Functions
- New and improved constructions of non-malleable cryptographic protocols
- On the Portability of Generalized Schnorr Proofs
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- Class Groups of Quadratic Fields
- Securing threshold cryptosystems against chosen ciphertext attack
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Nonmalleable Cryptography
- On quadratic fields with large 3-rank
- Simple verifiable delay functions
- Advances in Cryptology - CRYPTO 2003
- Fast secure two-party ECDSA signing
- Efficient verifiable delay functions
This page was built for publication: Bandwidth-efficient threshold EC-DSA
