paper-conference

FOLEAGE: $\mathbb{F}_4$OLE-Based Multi-Party Computation for Boolean Circuits
Secure Multi-party Computation (MPC) allows two or more parties to compute any public function over their privately-held inputs, …
Cite IACR eprint
Pseudorandomness of Decoding, Revisited: Adapting OHCP to Code-Based Cryptography
Recent code-based cryptosystems rely, among other things, on the hardness of the decisional decoding problem. If the search version is …
Cite IACR eprint
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding

Secure computation often benefits from the use of correlated randomness to achieve fast, non-cryptographic online protocols. A recent …
Cite IACR eprint ArXiv
On Codes and Learning with Errors over Function Fields
It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear …
Cite IACR eprint ArXiv
Right-Hand Side Decoding of Gabidulin Codes and Applications
We discuss the decoding of Gabidulin and interleaved Gabidulin codes. We give the full presentation of a decoding algorithm for …
Cite ArXiv
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code …
Cite Sage Code ArXiv