Skip to content

Threshold Authorization Without Threshold Signatures: Signature-Agnostic MPC Custody

Jul 2026 · arXiv.org · Vol abs/2607.08226 · 1 citation · 26 references
Computer Science

TL;DR

A dual-gate architecture that separates member authentication from threshold authorization is presented, which can be deployed wherever the asset-control path supports programmable verification, and produces an enforcement-layer authorization rather than a native chain signature.

Abstract

Digital-asset custody has been built on threshold multi-party approval: no operation proceeds unless $t$ of $n$ parties approve, and fewer than t compromised parties can neither authorize nor learn the authorization secret. Threshold signature schemes (TSS) have been the standard mechanism, but the post-quantum transition disrupts this model: standardized hash-based signatures resist efficient threshold signing, and lattice-based threshold protocols remain an emerging research track. We present a dual-gate architecture that separates member authentication from threshold authorization. Each member signs its approval with an ordinary signature under any EUF-CMA scheme; the quorum jointly produces a threshold seal from Shamir-shared secrets bound to the operation. The seal is the base instance of a programmable authorization computation: simple quorum is the minimal policy, while richer policies can evaluate secret-shared state without making the member-signature scheme part of that computation. The signature scheme is a deployment parameter: migrating from ECDSA to SLH-DSA or ML-DSA is a key rotation, not a protocol redesign, and members holding keys in commodity HSMs participate through the standard sign API. The architecture can be deployed wherever the asset-control path supports programmable verification, such as smart contracts, vault modules, or HSMs guarding a master key, and produces an enforcement-layer authorization rather than a native chain signature. Below-threshold secrecy is information-theoretic; an adversary holding $\geq t$ signing keys but no coefficient shares still cannot produce the seal.

View source

Similar papers

Review Sep 2026

The Native-Signature Boundary in Post-Quantum Distributed Authorization

Post-quantum signature migration poses a distinct systems problem when authorization is distributed among multiple parties. In native threshold signing, the signature algorithm may determine key generation, share state, preprocessing, interaction, combination, refresh, and recovery. Architectures that evaluate threshol...

Dariia Porechna · 0 citations
Open access 2026

Cryptographic Attestation Against Integrity Attacks in Service Monitoring: A Threat Model and Verifiable Architecture

Service uptime monitoring infrastructure is a high-value target for data-integrity attacks: a single compromised or dishonest monitoring provider can fabricate availability records, retroactively suppress outage evidence, or silently alter historical data, and clients today have no cryptographic means of detecting such...

M. Anusuya, Chayadevi M. L., S. C. et al. · 0 citations
Open access 2026

UQ-Vote: Consensus-Authorized Threshold Decryption for End-to-End Verifiable Elections

End-to-end verifiable electronic voting requires more than encrypted ballots and a published tally. Auditors also need a consistent election transcript, and trustees need a clear rule for deciding when decryption is allowed. Existing systems often combine threshold tallying with a bulletin board. However, the condition...

Jing-Yu Liu, Jingjing Rao, Tetsutaro Uehara · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.