Secure two-party computation via cut-and-choose oblivious transfer

DOI10.1007/978-3-642-19571-6_20zbMATH Open1281.94037OpenAlexW2119180312MaRDI QIDQ3000547FDOQ3000547

Authors: 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

Recommendations

• Secure two-party computation via cut-and-choose oblivious transfer
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (45)

• Revisiting the Efficiency of Malicious Two-Party Computation
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
• How to circumvent the two-ciphertext lower bound for linear garbling schemes
• A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
• Efficient Two-Party Secure Computation on Committed Inputs
• Constant-round maliciously secure two-party computation in the RAM model
• Cut-and-choose bilateral oblivious transfer
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• On the complexity of additively homomorphic UC commitments
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Automata evaluation and text search protocols with simulation-based security
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• A proof of security of Yao's protocol for two-party computation
• Implicit zero-knowledge arguments and applications to the malicious setting
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• Efficient three-party computation from cut-and-choose
• Faster secure two-party computation in the single-execution setting
• On perfectly secure 2PC in the OT-hybrid model
• Towards secure two-party computation from the wire-tap channel
• Efficient secure two-party protocols. Techniques and constructions
• Secure two-party computation via cut-and-choose oblivious transfer
• Computationally secure pattern matching in the presence of malicious adversaries
• Constant-round maliciously secure two-party computation in the RAM model
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Encryption switching protocols
• More efficient constant-round multi-party computation from BMR and SHE
• Low cost constant round MPC combining BMR and oblivious transfer
• Efficient secure two-party computation using symmetric cut-and-choose
• Automatic protocol selection in secure two-party computations
• Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)
• Fast large-scale honest-majority MPC for malicious adversaries
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Hashing garbled circuits for free
• Generalizing efficient multiparty computation
• Fully malicious authenticated PIR
• More efficient oblivious transfer extensions
• Privacy-enhanced attribute-based private information retrieval
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• Secure two-party computation in applied pi-calculus: models and verification
• Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
• On cut-and-choose oblivious transfer and its variants
• Oblivious transfer based on single-qubit rotations
• High-throughput secure three-party computation with an honest majority
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer

This page was built for publication: Secure two-party computation via cut-and-choose oblivious transfer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000547)