The following pages link to Amortizing Garbled Circuits (Q2874553):
Displaying 11 items.
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost (Q1694723) (← links)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
