More efficient universal circuit constructions
From MaRDI portal
Recommendations
- Efficient and scalable universal circuits
- Universal circuits (Preliminary Report)
- Efficient Universal Quantum Circuits
- scientific article; zbMATH DE number 5666680
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Universality considerations in VLSI circuits
- Efficient circuit design of reversible square
- Circuit optimization by rewiring
- Higher dimensional electrical circuits
- Area-time tradeoffs for universal VLSI circuits
Cited in
(15)- Practical attacks against the walnut digital signature scheme
- Masked triples. Amortizing multiplication triples across conditionals
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- Making private function evaluation safer, faster, and simpler
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Improved zero-knowledge argument of encrypted extended permutation
- Constant-round multiparty private function evaluation with (quasi-)linear complexities
- Universal circuits (Preliminary Report)
- Breaking the size barrier: universal circuits meet lookup tables
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- Stacked garbling. Garbled circuit proportional to longest execution path
- Valiant's universal circuit is practical
- Efficient and scalable universal circuits
This page was built for publication: More efficient universal circuit constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703934)
