Pages that link to "Item:Q2874555"

The following pages link to Dishonest Majority Multi-Party Computation for Binary Circuits (Q2874555):

Displaying 13 items.

• An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
• On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
• High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
• Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
• Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
• Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
• Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
• More efficient oblivious transfer extensions (Q2408589) (← links)
• Network Oblivious Transfer (Q2829221) (← links)
• Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection (Q2975818) (← links)
• More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
• High-throughput secure three-party computation with an honest majority (Q6110385) (← links)