Pages that link to "Item:Q3102210"
From MaRDI portal
The following pages link to Constant-Round Private Function Evaluation with Linear Complexity (Q3102210):
Displaying 8 items.
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Constant-round multiparty private function evaluation with (quasi-)linear complexities (Q6535112) (← links)
- Breaking the size barrier: universal circuits meet lookup tables (Q6595671) (← links)