Breaking the size barrier: universal circuits meet lookup tables
From MaRDI portal
Publication:6595671
Recommendations
- Efficient and scalable universal circuits
- Valiant's universal circuit is practical
- More efficient universal circuit constructions
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Cites work
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- Attribute-based encryption for circuits from multilinear maps
- Constant-round private function evaluation with linear complexity
- Efficient and scalable universal circuits
- How to obfuscate programs directly
- Improved Garbled Circuit: Free XOR Gates and Applications
- Linear-Complexity Private Function Evaluation is Practical
- Making private function evaluation safer, faster, and simpler
- More efficient universal circuit constructions
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Secure two-party computation is practical
- The Problem of Simplifying Truth Functions
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Valiant's universal circuit is practical
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
This page was built for publication: Breaking the size barrier: universal circuits meet lookup tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595671)
