Two-Output Secure Computation with Malicious Adversaries
From MaRDI portal
Publication:3003394
DOI10.1007/978-3-642-20465-4_22zbMath1282.68086OpenAlexW1521730416MaRDI QIDQ3003394
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_22
Related Items (14)
Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Round optimal black-box ``commit-and-prove ⋮ Garbling XOR gates ``for free in the standard model ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting ⋮ Enforcing input correctness via certification in garbled circuit evaluation ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Secure linear system computation in the presence of malicious adversaries ⋮ 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 ⋮ Oblivious transfer based on single-qubit rotations
This page was built for publication: Two-Output Secure Computation with Malicious Adversaries
