New Security Proofs of TC-in-the-Head Signatures in the Quantum Random Oracle Model
Open Access
- 26 October 2026
- journal article
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Abstract
The MPC-in-the-Head paradigm is a promising approach for constructing post-quantum signatures, and its variants VOLE-in-the-Head (VOLEitH) and TC-in-the-Head (TCitH) are adopted in some NIST PQC candidates. Recent works by Aguilar-Melchor et al. (ASIACRYPT 2023), Hülsing et al. (CRYPTO 2024), and Baum et al. (CRYPTO 2025) establish EUF-CMA security for MPCitH/VOLEitH in the quantum random oracle model (QROM), but these proofs either ignore crucial optimizations such as rejection sampling and grinding or rely on round-by-round soundness and key-generation lossiness. Due to these restrictions, they do not directly apply to TCitH signatures such as Mirath, RYDE, or MQOM. This paper addresses this gap by analyzing the QROM security of TCitH signatures that incorporate the crucial optimizations. Our treatment of rejection sampling and grinding applies more generally to MPCitH signatures, while our complete security proofs are instantiated for the TCitH signatures Mirath and RYDE. Our contributions are twofold: 1) We provide a new (strong) EUF-CMA security proof that accommodates rejection sampling and grinding. 2) We identify a gap in the EUF-CMA proof of MQOM and show that this issue extends to some schemes, including SBC (Huth and Joux, CRYPTO 2024) and rBN++ (Kim, Lee, and Son, EUROCRYPT 2025).Keywords
This publication has 32 references indexed in Scilit:
- Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM2022
- Online-Extractability in the Quantum Random-Oracle Model2022
- Tight Adaptive Reprogramming in the QROM2021
- On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work2021
- CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations2019
- How to Record Quantum Queries, and Applications to Quantum Indifferentiability2019
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems2000
- Cryptanalysis of the TTM CryptosystemLecture Notes in Computer Science, 2000
- Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization1999
- A new identification scheme based on syndrome decoding1994