MiniLEGO
From MaRDI portal
Software:21845
swMATH9866MaRDI QIDQ21845FDOQ21845
Author name not available (Why is that?)
Cited In (13)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead
- Faster Secure Two-Party Computation in the Single-Execution Setting
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
- On the Complexity of Additively Homomorphic UC Commitments
- Rate-1, Linear Time and Additively Homomorphic UC Commitments
- Reactive Garbling: Foundation, Instantiation, Application
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Scalable Multi-party Private Set-Intersection
- Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
- JIMU: faster LEGO-based secure computation using additive homomorphic hashes
This page was built for software: MiniLEGO
