Communication and Randomness Lower Bounds for Secure Computation.
Deepesh DataVinod M. PrabhakaranManoj M. PrabhakaranPublished in: IEEE Trans. Inf. Theory (2016)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound
- worst case
- communication networks
- secure communication
- group communication
- np hard
- upper and lower bounds
- communication systems
- communication channels
- lower and upper bounds
- multi party
- standard model
- quadratic assignment problem
- information sharing
- communication cost
- security requirements
- key management
- online algorithms