The following pages link to MiniLEGO (Q21845):
Displaying 13 items.
- JIMU: faster LEGO-based secure computation using additive homomorphic hashes (Q1703939) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947) (← links)
- Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique (Q2867169) (← links)
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings (Q2874554) (← 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)
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions (Q4924431) (← 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)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
