Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
Iftach HaitnerJonathan J. HochOmer ReingoldGil SegevPublished in: IACR Cryptol. ePrint Arch. (2007)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- complexity analysis
- branch and bound
- average case complexity
- objective function
- np hard
- lower and upper bounds
- lower bounding
- upper and lower bounds
- space complexity
- user interaction
- vc dimension
- optimal solution
- multiagent systems
- computer graphics
- security protocols
- computational cost
- user friendly
- virtual reality
- average case
- network flow
- linear programming relaxation
- learning algorithm