Description
Secure multi-party computation (MPC) allows a set of $n$ players to securely compute an agreed function of their inputs, even when up to $t$ of the players are under complete adversarial control. We consider secure MPC in the information-theoretic model with broadcast channels (PKI setup) and present an efficient protocol with optimal resilience ($t< n/2$), using a new technique technique called dispute control: During the course of the protocol, the players keep track of disputes that arise among them, and the ongoing computation is adjusted such that known disputes cannot arise again. This prevents the faulty players from intervening too often, which again allows the honest players to reduce the frequency of expensive verifications. This way, we can securely (for some security parameter $\kappa$) compute a circuit with $m$ gates with communication complexity $O(m n^2 \kappa)$ bits (plus some overhead independent of $m$). This is to be compared with $\Omega(m n^{22} \kappa)$ -- the communication complexity of the best known protocol in the same model.
Prochains exposés
-
Polytopes in the Fiat-Shamir with Aborts Paradigm
Orateur : 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[…]-
Cryptographie
-
Primitive asymétrique
-
Mode et protocole
-
-
Post-quantum Group-based Cryptography
Orateur : Delaram Kahrobaei - The City University of New York