Pages that link to "Item:Q2867169"
From MaRDI portal
The following pages link to Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique (Q2867169):
Displaying 5 items.
- 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)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
