Pages that link to "Item:Q1703934"
From MaRDI portal
The following pages link to More efficient universal circuit constructions (Q1703934):
Displaying 12 items.
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation (Q2056778) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← 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)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Universal circuits (Preliminary Report) (Q4140882) (← 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)
