Pages that link to "Item:Q1675733"
From MaRDI portal
The following pages link to The price of low communication in secure multi-party computation (Q1675733):
Displaying 12 items.
- Limits of practical sublinear secure computation (Q775973) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
- The Hidden Graph Model (Q2989026) (← links)
- Communication Locality in Secure Multi-party Computation (Q4910288) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- More communication lower bounds for information-theoretic MPC (Q6107250) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Stochastic secret sharing with 1-bit shares and applications to MPC (Q6652972) (← links)