Post-quantum (partially) blind signatures from matrix code equivalence

Abstract We construct a novel code-based blind signature scheme, using the MEDS group action. The scheme is built using similar ideas to the Schnorr blind signature scheme and CSI-Otter, but uses additional public key and commitment information to overcome the difficulties that the MEDS group action faces: lack of module structure (present in Schnorr) and lack of a quadratic twist (present in CSI-Otter). We address security concerns related to public key validation, and prove the security of our protocol in the random oracle model, using the security framework of Kastner, Loss, and Xu, under a variant of the Inverse Matrix Code Equivalence problem and a mild heuristic assumption. We also discuss alternative techniques for constructing a code-based blind signature, explain how to modify our protocol to yield a partially blind signature, and consider possible parameter sets and corresponding performance metrics.

Authors

Institutions

Publication Details

Journal
Cryptography and Communications
Published
2026-04-17
DOI
https://doi.org/10.1007/s12095-026-00879-x
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Post-quantum (partially) blind signatures from matrix code equivalence

Edoardo Persichetti, Jason T. LeGrow, Veronika Kuchta
Cryptography and Communications
Quantum Information and Cryptography
article

Post-quantum (partially) blind signatures from matrix code equivalence

Edoardo Persichetti, Jason T. LeGrow, Veronika Kuchta
article en

Abstract

Abstract We construct a novel code-based blind signature scheme, using the MEDS group action. The scheme is built using similar ideas to the Schnorr blind signature scheme and CSI-Otter, but uses additional public key and commitment information to overcome the difficulties that the MEDS group action faces: lack of module structure (present in Schnorr) and lack of a quadratic twist (present in CSI-Otter). We address security concerns related to public key validation, and prove the security of our protocol in the random oracle model, using the security framework of Kastner, Loss, and Xu, under a variant of the Inverse Matrix Code Equivalence problem and a mild heuristic assumption. We also discuss alternative techniques for constructing a code-based blind signature, explain how to modify our protocol to yield a partially blind signature, and consider possible parameter sets and corresponding performance metrics.

Cryptography and Communications
Florida Atlantic University (US), Virginia Tech (US)
Commonwealth Cyber Initiative
Peace, Justice and strong institutions
Openalex Percentile: Top 5%
Quantum Information and Cryptography
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.

Post-quantum (partially) blind signatures from matrix code equivalence — Edoardo Persichetti, Jason T. LeGrow, et al. · Cryptography and Communications (2026) | TGRS Research Map | TGRS