搜索结果: 1-1 共查到“Complexity of Statistically-Hiding”相关记录1条 . 查询时间(0.062 秒)
Finding Collisions in Interactive Protocols-A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
Collisions Protocols-A Tight Complexity of Statistically-Hiding Commitments
2008/9/3
We study the round complexity of various cryptographic protocols. Our main result is a tight
lower bound on the round complexity of any fully-black-box construction of a statistically-hiding commitme...