Pages that link to "Item:Q1928765"
From MaRDI portal
The following pages link to Secure two-party computation via cut-and-choose oblivious transfer (Q1928765):
Displaying 24 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- A proof of security of Yao's protocol for two-party computation (Q1015361) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Secure linear system computation in the presence of malicious adversaries (Q2335946) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings (Q2874554) (← links)
- Generalizing Efficient Multiparty Computation (Q2947520) (← links)
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer (Q3460103) (← links)
- Oblivious transfer based on single-qubit rotations (Q5272497) (← links)
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (Q5429383) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
- Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
