Samuel Ranellucci

Available identifiers

Publication	Date of Publication	Type
Highly efficient OT-based multiplication protocols	2022-08-30	Paper
Optimizing authenticated garbling for faster secure two-party computation	2020-06-30	Paper
Secure computation with low communication from cross-checking	2019-01-23	Paper
Best of both worlds in secure computation, with low communication overhead	2018-08-10	Paper
Resource-efficient OT combiners with active security	2018-01-19	Paper
On the computational overhead of MPC with dishonest majority	2017-06-13	Paper
Efficient generic zero-knowledge proofs from commitments (extended abstract)	2017-01-06	Paper
Reactive garbling: foundation, instantiation, application	2017-01-06	Paper
Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement	2016-12-21	Paper
Generalizing efficient multiparty computation	2015-09-24	Paper
Trading robustness for correctness and privacy in certain multiparty computations, beyond an honest majority	2012-11-06	Paper
On the efficiency of bit commitment reductions	2011-12-02	Paper

This page was built for person: Samuel Ranellucci