Pages that link to "Item:Q5149757"
From MaRDI portal
The following pages link to Perfect Secure Computation in Two Rounds (Q5149757):
Displaying 7 items.
- Perfect secure computation in two rounds (Q1629404) (← links)
- Perfectly Secure Message Transmission in Two Rounds (Q3179361) (← links)
- (Q3210139) (← links)
- The Exact Round Complexity of Secure Computation (Q5739211) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
- Robust additive randomized encodings from IO and pseudo-non-linear codes (Q6653025) (← links)