Searching for "Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Finding collisions in interactive protocols – A tight lower bound on the round complexity
by Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev — 2007 — In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
…Finding Collisions in Interactive Protocols – A Tight Lower Bound on the Round Complexity…
Cited by 7 (5 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB