Description
Lyubashevsky’s signatures are based on the Fiat-Shamir with aborts paradigm, whose central ingredient is the use of rejection sampling to transform (secret-key-dependent) signature samples into samples from a secret-key-independent distribution. The choice of these two underly- ing distributions is part of the rejection sampling strategy, and various instantiations have been considered up to this day. In this work, we inves- tigate which strategy leads to the most compact signatures, given signing runtime requirements. Our main contributions are as follows:<br/> (i) We prove lower bounds for compactness of signatures given signing runtime requirements, and (ii) show that these lower bounds are reached considering a new and elementary choice of distributions, namely con- tinuous uniform distributions over hyperballs. (iii) We also prove that, for any fixed pair of distributions, classic rejection sampling is the best strategy for minimizing the number of aborts, as well as (iv) propose a novel strategy that allows to fix (any) bound on the number of aborts while still guaranteeing correctness and security.<br/> lien: https://univ-rennes1-fr.zoom.us/j/97066341266?pwd=RUthOFV5cm1uT0ZCQVh6QUcrb1drQT09
Next sessions
-
Polytopes in the Fiat-Shamir with Aborts Paradigm
Speaker : Hugo Beguinet - ENS Paris / Thales
The Fiat-Shamir with Aborts paradigm (FSwA) uses rejection sampling to remove a secret’s dependency on a given source distribution. Recent results revealed that unlike the uniform distribution in the hypercube, both the continuous Gaussian and the uniform distribution within the hypersphere minimise the rejection rate and the size of the proof of knowledge. However, in practice both these[…]-
Cryptography
-
Asymmetric primitive
-
Mode and protocol
-
-
Post-quantum Group-based Cryptography
Speaker : Delaram Kahrobaei - The City University of New York