vix.ing · top · new · best · stats · spec

A tight security reduction in the quantum random oracle model for code-based signature schemes

2017/09/20 by André Chailloux, Thomas Debris-Alazard, Chailloux, André +1
Computer Science · #Chaos-based Image/Signal Encryption #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.1709.06870

openalex publication_date 2017/09/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Quantum secure signature schemes have a lot of attention recently, in particular because of the NIST call to standardize quantum safe cryptography. However, only few signature schemes can have concrete quantum security because of technical difficulties associated with the Quantum Random Oracle Model (QROM). In this paper, we show that code-based signature schemes based on the full domain hash paradigm can behave very well in the QROM i.e. that we can have tight security reductions. We also study quantum algorithms related to the underlying code-based assumption. Finally, we apply our reduction to a concrete example: the SURF signature scheme. We provide parameters for 128 bits of quantum security in the QROM and show that the obtained parameters are competitive compared to other similar quantum secure signature schemes.

Related