Cryptology ePrint Archive: Report 2007/145
Available versions in chronological order
20070423:083824 (posted 23-Apr-2007 08:38:24 UTC)
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
Iftach Haitner and Jonathan J. Hoch and Omer Reingold and Gil Segev
20070518:073329 (posted 18-May-2007 07:33:29 UTC)
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
Iftach Haitner and Jonathan J. Hoch and Omer Reingold and Gil Segev
20070731:031831 (posted 31-Jul-2007 03:18:31 UTC)
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
Iftach Haitner and Jonathan J. Hoch and Omer Reingold and Gil Segev
Publication Info: FOCS '07. This is the full version.
20070731:032111 (posted 31-Jul-2007 03:21:11 UTC)
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
Iftach Haitner and Jonathan J. Hoch and Omer Reingold and Gil Segev
Publication Info: FOCS '07. This is the full version.
[
Cryptology ePrint archive
]