Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
Iftach HaitnerJonathan J. HochOmer ReingoldGil SegevPublished in: FOCS (2007)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- average case complexity
- complexity analysis
- objective function
- branch and bound
- np hard
- lower and upper bounds
- optimal solution
- computational complexity
- upper and lower bounds
- lower bounding
- user friendly
- polynomial approximation
- special case
- multiagent systems
- space complexity
- linear programming relaxation
- sufficiently accurate
- web services