@InProceedings{haitner_et_al:LIPIcs.ITCS.2019.40,
author = {Haitner, Iftach and Mazor, Noam and Oshman, Rotem and Reingold, Omer and Yehudayoff, Amir},
title = {{On the Communication Complexity of Key-Agreement Protocols}},
booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)},
pages = {40:1--40:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-095-8},
ISSN = {1868-8969},
year = {2019},
volume = {124},
editor = {Blum, Avrim},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.40},
URN = {urn:nbn:de:0030-drops-101335},
doi = {10.4230/LIPIcs.ITCS.2019.40},
annote = {Keywords: key agreement, random oracle, communication complexity, Merkle's puzzles}
}