On Threshold Signatures from MPC-in-the-Head

We initiate the study of (n out of n) threshold signatures built from MPC-in-the-Head signatures. While recent impossibility results (Doerner, Kondi and Rosenbloom, CRYPTO'24) show that any such construction must have a signature size that grows with the number <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> of users (or else require a prohibitive non-black-box use of cryptography), we outline a general strategy to confine the dependency in the number of users to a term of the form <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mi>λ</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mi>O</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> , where <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>λ</mml:mi> </mml:mrow> </mml:math> is a security parameter and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> a constant that depends on the signature scheme. We provide a concrete instantiation of our strategy by building a threshold signature on top of the scheme of (Carozza, Couteau, and Joux, EUROCRYPT'23).

Authors

Institutions

Publication Details

Journal
IACR Communications in Cryptology
Published
2026-08-03
DOI
https://doi.org/10.62056/aesgvu7sf
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Threshold Signatures from MPC-in-the-Head

Eliana Carozza, Geoffroy Couteau
IACR Communications in Cryptology
Cryptography and Data Security
article

On Threshold Signatures from MPC-in-the-Head

Eliana Carozza, Geoffroy Couteau
article en

Abstract

We initiate the study of (n out of n) threshold signatures built from MPC-in-the-Head signatures. While recent impossibility results (Doerner, Kondi and Rosenbloom, CRYPTO'24) show that any such construction must have a signature size that grows with the number <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> of users (or else require a prohibitive non-black-box use of cryptography), we outline a general strategy to confine the dependency in the number of users to a term of the form <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mi>λ</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mi>O</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> , where <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>λ</mml:mi> </mml:mrow> </mml:math> is a security parameter and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> a constant that depends on the signature scheme. We provide a concrete instantiation of our strategy by building a threshold signature on top of the scheme of (Carozza, Couteau, and Joux, EUROCRYPT'23).

IACR Communications in CryptologyVol. 3(2)
Centre National de la Recherche Scientifique (FR), Université Paris Cité (FR)
Agence Nationale de la Recherche
Openalex Percentile: Top 7%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.