Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

4 May 2021

Papers citing "Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments"

4 / 4 papers shown

Title
Proofs of Quantumness from Trapdoor Permutations T. Morimae Takashi Yamakawa 16 6 0 26 Aug 2022
On the Communication Complexity of Key-Agreement Protocols Iftach Haitner N. Mazor R. Oshman Omer Reingold Amir Yehudayoff 24 9 0 05 May 2021
Distributional Collision Resistance Beyond One-Way Functions Nir Bitansky Iftach Haitner Ilan Komargodski E. Yogev 10 10 0 03 May 2021
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions Iftach Haitner Omer Reingold Salil P. Vadhan H. Wee 13 5 0 12 Oct 2020