Cryptology ePrint Archive: Report 2020/006

Tight and Optimal Reductions for Signatures based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures

André Chailloux and Thomas Debris-Alazard

Abstract: The GPV construction [GPV08] presents a generic construction of signature schemes in the Hash and Sign paradigm. This construction requires a family F of trapdoor preimage sampleable functions (TPSF). In this work we extend this notion to the weaker Average TPSF (ATPSF) and show that the GPV construction also holds for ATPSF in the Random Oracle Model. We also introduce the problem of finding a Claw with a random function (Claw(RF)) and present a tight security reduction to the Claw(RF) problem. Our reduction is also optimal meaning that an algorithm that solves the Claw(RF) problem breaks the scheme. We extend these results to the quantum setting and prove this same tight and optimal reduction in the QROM. Finally, we apply these results to code-based signatures, notably the Wave signature scheme and prove tight and optimal reductions for it in the ROM and the QROM improving and extending the original analysis of [DST19a]

Category / Keywords: public-key cryptography / post-quantum signature schemes, quantum random oracle model, code-based cryptography, trapdoor preimage sampleable functions

Date: received 2 Jan 2020

Contact author: thomas debris at rhul ac uk,andre chailloux@inria fr

Available format(s): PDF | BibTeX Citation

Version: 20200103:074252 (All versions of this report)

Short URL: ia.cr/2020/006


[ Cryptology ePrint archive ]