Pages that link to "Item:Q2181888"
From MaRDI portal
The following pages link to Valiant's universal circuits revisited: an overall improvement and a lower bound (Q2181888):
Displaying 11 items.
- \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)
- Blind polynomial evaluation and data trading (Q2117031) (← 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)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Count me in! Extendability for threshold ring signatures (Q6113963) (← links)
- Breaking the size barrier: universal circuits meet lookup tables (Q6595671) (← links)
