MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
From MaRDI portal
Publication:4924431
DOI10.1007/978-3-642-38348-9_32zbMath1312.94049OpenAlexW2204895368MaRDI QIDQ4924431
Jesper Buus Nielsen, Claudio Orlandi, Peter Sebastian Nordholt, Tore Kasper Frederiksen, Thomas Pelle Jakobsen
Publication date: 31 May 2013
Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_32
Related Items (9)
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 ⋮ Scalable Multi-party Private Set-Intersection ⋮ 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 ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings
Uses Software
This page was built for publication: MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
