Pages that link to "Item:Q2811152"
From MaRDI portal
The following pages link to A Unified Approach to MPC with Preprocessing Using OT (Q2811152):
Displaying 20 items.
- An efficient structural attack on NIST submission DAGS (Q1633442) (← 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)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- Improved Multiplication Triple Generation over Rings via RLWE-Based AHE (Q3297630) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Faster Secure Multi-party Computation of AES and DES Using Lookup Tables (Q6487205) (← links)
- A new approach to efficient and secure fixed-point computation (Q6547972) (← links)
- Privacy-preserving edit distance computation using secret-sharing two-party computation (Q6619924) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
