Pages that link to "Item:Q1928765"

The following pages link to Secure two-party computation via cut-and-choose oblivious transfer (Q1928765):

Displaying 14 items.

• Efficient set intersection with simulation-based security (Q271588) (← links)
• Efficient one-sided adaptively secure computation (Q514477) (← 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)
• Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
• Generalizing Efficient Multiparty Computation (Q2947520) (← links)
• Oblivious transfer based on single-qubit rotations (Q5272497) (← links)
• Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
• Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)