Finding collisions in interactive protocols – A tight lower bound on the round complexity of statistically-hiding commitments (2007)

by Iftach Haitner , Jonathan J. Hoch , Omer Reingold , Gil Segev
Venue:In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Citations:33 - 11 self