Pages that link to "Item:Q2890025"
From MaRDI portal
The following pages link to Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025):
Displaying 7 items.
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity (Q2119064) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Privacy Assurances in Multiple Data-Aggregation Transactions (Q3193250) (← links)