On the Communication Complexity of Key-Agreement Protocols.
From MaRDI portal
Publication:5090417
DOI10.4230/LIPIcs.ITCS.2019.40OpenAlexW2914109078MaRDI QIDQ5090417
Omer Reingold, Amir Yehudayoff, Iftach Haitner, Noam Mazor, Rotem Oshman
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2105.01958
Related Items (4)
The function-inversion problem: barriers and opportunities ⋮ On the impossibility of key agreements from quantum random oracles ⋮ Distributed Merkle's puzzles ⋮ Key establishment à la Merkle in a quantum world
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits on the usefulness of random oracles
- On the distributional complexity of disjointness
- Secure communications over insecure channels
- Limits of random oracles in secure computation
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- A Zero-One Law for Boolean Privacy
- Exponential Separation of Information and Communication for Boolean Functions
This page was built for publication: On the Communication Complexity of Key-Agreement Protocols.
