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: CoRR (2021)
Keyphrases
- lower bound
- upper bound
- communication protocol
- communication protocols
- branch and bound algorithm
- worst case
- np hard
- virtual reality
- objective function
- branch and bound
- lower and upper bounds
- multi party
- communication systems
- sample size
- optimal solution
- quadratic assignment problem
- upper and lower bounds
- multiagent systems
- sample complexity
- linear programming relaxation
- instant messaging
- communication cost
- information sharing