Efficient and scalable universal circuits
From MaRDI portal
Recommendations
- More efficient universal circuit constructions
- Valiant's universal circuit is practical
- 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
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Cites work
- scientific article; zbMATH DE number 1670848 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 5666680 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- A Depth-Universal Circuit
- A Permutation Network
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- A proof of security of Yao's protocol for two-party computation
- Actively Secure Private Function Evaluation
- Advances in Cryptology - CRYPTO 2003
- Amortizing Garbled Circuits
- Attribute-based encryption for circuits
- Attribute-based encryption for circuits from multilinear maps
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constant-round private function evaluation with linear complexity
- Efficiency of universal parallel computers
- Evaluating Branching Programs on Encrypted Data
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- How to hide circuits in MPC an efficient framework for private function evaluation
- How to obfuscate programs directly
- Improved Garbled Circuit: Free XOR Gates and Applications
- Indistinguishability obfuscation from functional encryption
- More efficient universal circuit constructions
- Non-interactive secure 2PC in the offline/online and batch settings
- Non-interactive secure computation based on cut-and-choose
- On compiling Boolean circuits optimized for secure multi-party computation
- One-time programs with limited memory
- Overlaying conditional circuit clauses for secure computation
- Private Searching on Streaming Data
- Quadratic span programs and succinct NIZKs without PCPs
- Secure circuit evaluation. A protocol based on hiding information from an oracle
- Universal circuits (Preliminary Report)
- 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
Cited in
(14)- Arbitrary-size permutation networks using arbitrary-radix switches
- Making private function evaluation safer, faster, and simpler
- PFE: linear active security, double-shuffle proofs, and low-complexity communication
- Constant-round multiparty private function evaluation with (quasi-)linear complexities
- Breaking the size barrier: universal circuits meet lookup tables
- More efficient universal circuit constructions
- Valiant's universal circuit is practical
- Improved zero-knowledge argument of encrypted extended permutation
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- scientific article; zbMATH DE number 5666680 (Why is no real title available?)
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- Universal circuits (Preliminary Report)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
This page was built for publication: Efficient and scalable universal circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188968)
