Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

DOI10.1007/978-3-642-19571-6_20zbMath1281.94037OpenAlexW2119180312MaRDI QIDQ3000547

Yehuda Lindell, Benny Pinkas

Publication date: 19 May 2011

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (26)

Automata evaluation and text search protocols with simulation-based security ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting ⋮ More efficient oblivious transfer extensions ⋮ Generalizing Efficient Multiparty Computation ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ High-throughput secure three-party computation with an honest majority ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Privacy-enhanced attribute-based private information retrieval ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Encryption Switching Protocols ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Hashing Garbled Circuits for Free ⋮ Oblivious transfer based on single-qubit rotations

This page was built for publication: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer