The following pages link to David G. Heath (Q1314527):
Displaying 12 items.
- The complexity of finding minimal Voronoi covers with applications to machine learning (Q1314528) (← links)
- (Q2055667) (redirect page) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← 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)
- \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
- (Q4013738) (← links)
- Efficient arithmetic in garbled circuits (Q6637536) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
