Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments.
Iftach HaitnerJonathan J. HochOmer ReingoldGil SegevPublished in: SIAM J. Comput. (2015)
Keyphrases
- lower bound
- upper bound
- communication protocols
- communication protocol
- worst case
- branch and bound algorithm
- branch and bound
- multi party
- np hard
- quadratic assignment problem
- optimal solution
- upper and lower bounds
- lower and upper bounds
- computer graphics
- instant messaging
- objective function
- resource constrained
- optimal cost
- message delivery
- vc dimension
- communication systems
- communication cost
- virtual reality
- mobile robot
- search space
- multi agent systems