Description
Zero-knowledge proofs of knowledge are useful tools for designing signature schemes. Among the existing techniques, the MPC-in-Head (MPCitH) paradigm provides a generic framework to build quantum-resilient proofs using techniques from secure multiparty computation. This paradigm has recently been improved in a series of works which makes it an effective and versatile tool. In this talk, I will present the recent advances in post-quantum signatures relying on the MPC-in-the-Head. After a general introduction to MPCitH, I will provide an overview of the state of the art that led to the MPCitH-based candidates that have been submitted to the additional NIST call for post-quantum signatures. Then, I will present the Threshold-Computation-in-the-Head (TCitH) framework, based on joint works with Matthieu Rivain. This framework extends common MPC-in-the-Head techniques by using Shamir’s secret sharing (instead of additive sharing) to achieve significant improvements in terms of sizes and timings.
Next sessions
-
Verification of Rust Cryptographic Implementations with Aeneas
Speaker : Aymeric Fromherz - Inria
From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the[…] -
On the average hardness of SIVP for module lattices of fixed rank
Speaker : Radu Toma - Sorbonne Université
In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…] -
Endomorphisms via Splittings
Speaker : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-