Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation

DOI10.1137/1.9781611975482.112zbMath1432.68154arXiv1808.08907OpenAlexW2952058148MaRDI QIDQ5236296

Badih Ghazi, Mitali Bafna, Noah Golowich

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.08907

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Communication complexity, information complexity (68Q11)

This page was built for publication: Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation