Pages that link to "Item:Q1629402"
From MaRDI portal
The following pages link to Two-round MPC: information-theoretic and black-box (Q1629402):
Displaying 20 items.
- Perfect secure computation in two rounds (Q1629404) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
- GUC-secure commitments via random oracles: new impossibility and feasibility (Q6175972) (← links)
- Endemic oblivious transfer via random oracles, revisited (Q6178789) (← links)
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) (Q6190138) (← links)