Threshold ECDSA with an offline recovery party

DOI10.1007/S00009-021-01886-3MaRDI QIDQ2053769zbMATH OpenOpenAlexFDO

Authors Michele Battagliola, Riccardo Longo, Alessio Meneghetti, Massimiliano Sala

Publication date 30 November 2021

Published in Mediterranean Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2007.04036, http://hdl.handle.net/11572/327419

zbMATH Keywords

analysis of algorithmselliptic curvesauthenticationcryptographyfinite fieldssecret sharing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20) Authentication, digital signatures and secret sharing (94A62) Elliptic curves (14H52)

Abstract: A $(t,n)-$ threshold signature scheme enables distributed signing among $n$ players such that any subgroup of size $t$ can sign, whereas any group with fewer players cannot. Our goal is to produce signatures that are compatible with an existing centralized signature scheme: the key generation and signature algorithm are replaced by a communication protocol between the parties, but the verification algorithm remains identical to that of a signature issued using the centralized algorithm. Starting from the threshold schemes for the ECDSA signature due to R. Gennaro and S. Goldfeder, we present the first protocol that supports multiparty signatures with an offline participant during the Key Generation Phase, without relying on a trusted third party. Following well-established approaches, we prove our scheme secure against adaptive malicious adversaries.

Recommendations

• Provably unforgeable threshold EdDSA with an offline participant and trustless setup
• Efficient threshold-optimal ECDSA
• scientific article; zbMATH DE number 1149912
• Fast threshold ECDSA with honest majority
• One round threshold ECDSA without roll call
• Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
• scientific article; zbMATH DE number 1894959
• Information Security and Privacy
• Compact zero-knowledge proofs for threshold ECDSA with trustless setup
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security

Cites work

• scientific article; zbMATH DE number 1583788 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 1304079 (Why is no real title available?)
• scientific article; zbMATH DE number 1842489 (Why is no real title available?)
• scientific article; zbMATH DE number 1418293 (Why is no real title available?)
• scientific article; zbMATH DE number 1440055 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Fast Software Encryption
• Fast secure two-party ECDSA signing
• How to share a secret
• Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
• Robust threshold DSS signatures
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security

Cited in

(7)

• FROST: Flexible round-optimized Schnorr threshold signatures
• Efficient secure two party ECDSA
• One round threshold ECDSA without roll call
• Provably unforgeable threshold EdDSA with an offline participant and trustless setup
• Efficient threshold-optimal ECDSA
• Cutting the GRASS: threshold group action signature schemes
• Public Key Cryptography - PKC 2006

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Threshold ECDSA with an offline recovery party

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053769)