Pages that link to "Item:Q1703937"
From MaRDI portal
The following pages link to Overlaying conditional circuit clauses for secure computation (Q1703937):
Displaying 10 items.
- Practical attacks against the walnut digital signature scheme (Q1633439) (← 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)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← 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)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation (Q6157518) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
