Pages that link to "Item:Q2874554"
From MaRDI portal
The following pages link to Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings (Q2874554):
Displaying 14 items.
- 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)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
