The advent of quantum computing threatens to break many classical cryptographic
schemes, leading to innovations in public key cryptography that focus on post-quantum …

Abstract The Fujisaki-Okamoto (FO) transformation (CRYPTO 1999 and Journal of
Cryptology 2013) turns any weakly secure public-key encryption scheme into a strongly (ie …

Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …

This document is the supporting documentation of Falcon. It is organized as follows. Chapter
2 explains the overall design of Falcon and its rationale. Chapter 3 is a complete …

We give a new signature scheme for isogenies that combines the class group actions of
CSIDH with the notion of Fiat-Shamir with aborts. Our techniques allow to have signatures of …

Abstract The famous Fiat-Shamir transformation turns any public-coin three-round interactive
proof, ie, any so-called Σ-protocol, into a non-interactive proof in the random-oracle model …

We show the following hold, unconditionally unless otherwise stated, relative to a random
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …

Key-encapsulation mechanisms secure against chosen ciphertext attacks (IND-CCA-secure
KEMs) in the quantum random oracle model have been proposed by Boneh, Dagdelen …

Abstract The Fiat-Shamir transformation is a useful approach to building non-interactive
arguments (of knowledge) in the random oracle model. Unfortunately, existing proof …

Multi-signatures are protocols that allow a group of signers to jointly produce a single
signature on the same message. In recent years, a number of practical multi-signature …