Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing
From MaRDI portal
Publication:2942731
DOI10.1145/248052.248090zbMath1321.94038OpenAlexW2005734486MaRDI QIDQ2942731
Mihir Bellare, Juan A. Garay, Tal Rabin
Publication date: 11 September 2015
Published in: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/248052.248090
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items
Our Data, Ourselves: Privacy Via Distributed Noise Generation ⋮ On the (im-)possibility of extending coin toss ⋮ On the (Im-)Possibility of Extending Coin Toss