ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2105.01958
  4. Cited By
On the Communication Complexity of Key-Agreement Protocols

On the Communication Complexity of Key-Agreement Protocols

5 May 2021
Iftach Haitner
N. Mazor
R. Oshman
Omer Reingold
Amir Yehudayoff
ArXivPDFHTML

Papers citing "On the Communication Complexity of Key-Agreement Protocols"

1 / 1 papers shown
Title
Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the
  Round and Communication Complexities of Statistically Hiding Commitments
Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
Iftach Haitner
Jonathan J. Hoch
Omer Reingold
Gil Segev
19
32
0
04 May 2021
1