Threshold ECDSA with an offline recovery party

DOI10.1007/S00009-021-01886-3zbMATH Open1478.94105arXiv2007.04036OpenAlexW3216859527MaRDI QIDQ2053769FDOQ2053769

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)

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.

Full work available at URL: https://arxiv.org/abs/2007.04036

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

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)

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• Title not available (Why is that?)
• How to share a secret
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Title not available (Why is that?)
• Robust threshold DSS signatures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Software Encryption
• Title not available (Why is that?)
• Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast secure two-party ECDSA signing

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
• Cutting the GRASS: threshold group action signature schemes
• Efficient threshold-optimal ECDSA
• Public Key Cryptography - PKC 2006

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)