Pages that link to "Item:Q5738976"

The following pages link to High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (Q5738976):

Displaying 20 items.

• Secure fast evaluation of iterative methods: with an application to secure PageRank (Q826235) (← links)
• Oblivious TLS via multi-party computation (Q826241) (← links)
• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
• An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
• Secure computation with low communication from cross-checking (Q1710664) (← links)
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
• Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
• Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) (Q2055698) (← links)
• Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
• Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
• An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
• ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
• Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
• High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
• CNF-FSS and Its Applications (Q5087261) (← links)
• On the exact round complexity of secure three-party computation (Q5918099) (← links)
• Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
• High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
• MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
• Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic (Q6176271) (← links)