Efficient and scalable universal circuits
From MaRDI portal
Publication:2188968
DOI10.1007/s00145-020-09346-zzbMath1462.94027OpenAlexW2942323878MaRDI QIDQ2188968
Thomas Schneider, Masaud Y. Alhassan, Daniel Günther, Ágnes Kiss
Publication date: 15 June 2020
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-020-09346-z
Related Items (5)
Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Arbitrary-size permutation networks using arbitrary-radix switches ⋮ \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure circuit evaluation. A protocol based on hiding information from an oracle
- A proof of security of Yao's protocol for two-party computation
- Efficiency of universal parallel computers
- On compiling Boolean circuits optimized for secure multi-party computation
- More efficient universal circuit constructions
- Overlaying conditional circuit clauses for secure computation
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Valiant’s Universal Circuit is Practical
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Amortizing Garbled Circuits
- Actively Secure Private Function Evaluation
- How to Obfuscate Programs Directly
- Constant-Round Private Function Evaluation with Linear Complexity
- One-Time Programs with Limited Memory
- Improved Garbled Circuit: Free XOR Gates and Applications
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Evaluating Branching Programs on Encrypted Data
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- A Depth-Universal Circuit
- Universal circuits (Preliminary Report)
- Indistinguishability Obfuscation from Functional Encryption
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings
- Non-Interactive Secure Computation Based on Cut-and-Choose
- Advances in Cryptology - CRYPTO 2003
- Private Searching on Streaming Data
- Attribute-based encryption for circuits
- A Permutation Network
This page was built for publication: Efficient and scalable universal circuits
