Pages that link to "Item:Q2914295"
From MaRDI portal
The following pages link to A New Approach to Practical Active-Secure Two-Party Computation (Q2914295):
Displaying 25 items.
- 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)
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory (Q3304808) (← links)
- Secure Computation from Leaky Correlated Randomness (Q3457091) (← links)
- Actively Secure OT Extension with Optimal Overhead (Q3457136) (← links)
- Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN (Q5087258) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (Q5738976) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
- Secure non-interactive simulation from arbitrary joint distributions (Q6114278) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
- Faster Secure Multi-party Computation of AES and DES Using Lookup Tables (Q6487205) (← links)
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT (Q6488028) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head (Q6635752) (← links)
- Toward malicious constant-rate 2PC via arithmetic garbling (Q6637552) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
- Privacy-preserving Dijkstra (Q6653041) (← links)
