Universal circuits (Preliminary Report)
From MaRDI portal
Recommendations
- More efficient universal circuit constructions
- Efficient and scalable universal circuits
- Universality considerations in VLSI circuits
- A Depth-Universal Circuit
- scientific article; zbMATH DE number 7699974
- Generalized circuits. Elements of a mathematical theory
- A universal circuit for studying chaotic phenomena
- The lower reaches of circuit uniformity
- Valiant's universal circuit is practical
- scientific article; zbMATH DE number 1161568
Cited in
(50)- Models of lower-bounds proofs
- Lower bounds for synchronous circuits and planar circuits
- Parallel solutions to geometric problems in the scan model of computation
- Practical attacks against the walnut digital signature scheme
- On the limits of gate elimination
- More efficient universal circuit constructions
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- Logic circuits from zero forcing
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Masked triples. Amortizing multiplication triples across conditionals
- Stacked garbling. Garbled circuit proportional to longest execution path
- Blind polynomial evaluation and data trading
- Zero-knowledge proofs for committed symmetric Boolean functions
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Improved zero-knowledge argument of encrypted extended permutation
- Garbled circuits with sublinear evaluator
- Efficient and scalable universal circuits
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Breaking the circuit size barrier for secure computation under DDH
- How to circumvent the two-ciphertext lower bound for linear garbling schemes
- The complexity of word circuits
- scientific article; zbMATH DE number 3887074 (Why is no real title available?)
- One-time programs with limited memory
- Improved Garbled Circuit: Free XOR Gates and Applications
- The complexity of word circuits
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- A Depth-Universal Circuit
- scientific article; zbMATH DE number 3941436 (Why is no real title available?)
- Cyclic Boolean circuits
- Making private function evaluation safer, faster, and simpler
- Hashing garbled circuits for free
- Efficient Universal Quantum Circuits
- Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
- Circuit-private multi-key FHE
- Obfustopia built on secret-key functional encryption
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs
- Time-release cryptography from minimal circuit assumptions
- More efficient construction of bounded KDM secure encryption
- Constant-round multiparty private function evaluation with (quasi-)linear complexities
- Compact NIZKs from standard assumptions on bilinear maps
- Lattice-based obfuscation from NTRU and equivocal LWE
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Reducing garbled circuit size while preserving circuit gate privacy
- Subgraph-universal planar graphs for trees
- Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more
- On circuit private, multikey and threshold approximate homomorphic encryption
- Area-time tradeoffs for universal VLSI circuits
- Underapproximation for model-checking based on universal circuits
This page was built for publication: Universal circuits (Preliminary Report)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140882)
