The following pages link to Samuel Ranellucci (Q775978):
Displayed 12 items.
- Optimizing authenticated garbling for faster secure two-party computation (Q775980) (← links)
- Best of both worlds in secure computation, with low communication overhead (Q1656049) (← links)
- Resource-efficient OT combiners with active security (Q1690281) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Highly efficient OT-based multiplication protocols (Q2169999) (← links)
- Generalizing Efficient Multiparty Computation (Q2947520) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816) (← links)
- On the Efficiency of Bit Commitment Reductions (Q3102208) (← links)
- Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement (Q3179358) (← links)
- Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority (Q5200453) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)