Pages that link to "Item:Q4924433"
From MaRDI portal
The following pages link to Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction (Q4924433):
Displaying 7 items.
- Polynomial expressions of \(p\)-ary auction functions (Q2003342) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Topology-hiding computation on all graphs (Q5919491) (← links)
- Multi-Party Secure Computation of Multi-Variable Polynomials (Q6080444) (← links)
- How to obfuscate MPC inputs (Q6114268) (← links)