Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
From MaRDI portal
Publication:2874554
DOI10.1007/978-3-662-44381-1_27zbMath1335.94067OpenAlexW258132320MaRDI QIDQ2874554
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_27
Related Items (14)
More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ Adaptive security of practical garbling schemes ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Network Oblivious Transfer ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Hashing Garbled Circuits for Free
Uses Software
This page was built for publication: Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
