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

researchr

You are not signed in
Sign in
Sign up

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. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings. pages 669-679, IEEE Computer Society, 2007. [doi]

This author has not been identified. Look up 'Iftach Haitner' in GoogleThis author has not been identified. Look up 'Jonathan J. Hoch' in GoogleThis author has not been identified. Look up 'Omer Reingold' in GoogleThis author has not been identified. Look up 'Gil Segev' in Google

runs on WebDSL