Pages that link to "Item:Q4140882"
From MaRDI portal
The following pages link to Universal circuits (Preliminary Report) (Q4140882):
Displaying 28 items.
- Models of lower-bounds proofs (Q1107322) (← links)
- Lower bounds for synchronous circuits and planar circuits (Q1114661) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation (Q2056778) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
- Blind polynomial evaluation and data trading (Q2117031) (← links)
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- One-Time Programs with Limited Memory (Q3454868) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions (Q3603006) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- Efficient Universal Quantum Circuits (Q5323090) (← links)
- Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits (Q5738750) (← links)
- Circuit-Private Multi-key FHE (Q5738758) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
