Pages that link to "Item:Q1629404"
From MaRDI portal
The following pages link to Perfect secure computation in two rounds (Q1629404):
Displaying 14 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Towards characterizing securely computable two-party randomized functions (Q1749306) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Perfectly Secure Message Transmission in Two Rounds (Q3179361) (← links)
- (Q3210139) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← 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)