Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing.
Ivan DamgårdKasper Green LarsenJesper Buus NielsenPublished in: CRYPTO (2) (2019)
Keyphrases
- lower bound
- preprocessing
- upper bound
- secure communication
- branch and bound algorithm
- post processing
- objective function
- group communication
- multi party
- communication networks
- feature extraction
- communication systems
- branch and bound
- dynamic model
- lower and upper bounds
- closed loop
- information sharing
- online learning
- worst case
- vc dimension
- np hard
- upper and lower bounds
- computer networks
- resource constrained
- online algorithms
- search algorithm
- preprocessing phase
- feature selection