Pages that link to "Item:Q2188968"
From MaRDI portal
The following pages link to Efficient and scalable universal circuits (Q2188968):
Displaying 11 items.
- More efficient universal circuit constructions (Q1703934) (← links)
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation (Q2056778) (← links)
- 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)
- (Q3400469) (← links)
- Universal circuits (Preliminary Report) (Q4140882) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Arbitrary-size permutation networks using arbitrary-radix switches (Q6159027) (← links)
- Constant-round multiparty private function evaluation with (quasi-)linear complexities (Q6535112) (← links)
- PFE: linear active security, double-shuffle proofs, and low-complexity communication (Q6573663) (← links)
- Breaking the size barrier: universal circuits meet lookup tables (Q6595671) (← links)
