Breaking the size barrier: universal circuits meet lookup tables
From MaRDI portal
Publication:6595671
DOI10.1007/978-981-99-8721-4_1zbMATH Open1548.68073MaRDI QIDQ6595671
Maximilian Stillger, Daniel Günther, Y. Disser, Arthur Wigandt, Hossein Yalame, Thomas Schneider
Publication date: 30 August 2024
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Networks and circuits as models of computation; circuit complexity (68Q06) Privacy of data (68P27)
Cites Work
- Title not available (Why is that?)
- More efficient universal circuit constructions
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Efficient and scalable universal circuits
- Valiant’s Universal Circuit is Practical
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Two Halves Make a Whole
- How to Obfuscate Programs Directly
- Constant-Round Private Function Evaluation with Linear Complexity
- Improved Garbled Circuit: Free XOR Gates and Applications
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Secure Two-Party Computation Is Practical
- Making Private Function Evaluation Safer, Faster, and Simpler
- The Problem of Simplifying Truth Functions
- Linear-Complexity Private Function Evaluation is Practical
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)
