Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev. Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. Electronic Colloquium on Computational Complexity (ECCC), 14(038), 2007. [doi]

Abstract

Abstract is missing.