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