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