Pages that link to "Item:Q2912796"
From MaRDI portal
The following pages link to Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits (Q2912796):
Displaying 6 items.
- Optimizing authenticated garbling for faster secure two-party computation (Q775980) (← links)
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited (Q1675724) (← links)
- Privacy-free garbled circuits for formulas: size zero and information-theoretic (Q1675725) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- Secure two-party computation over unreliable channels (Q1796811) (← links)
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost (Q3457064) (← links)