The Hidden Graph Model
From MaRDI portal
Publication:2989026
DOI10.1145/2688073.2688102zbMath1365.68255OpenAlexW2157504673WikidataQ130981670 ScholiaQ130981670MaRDI QIDQ2989026
Wutichai Chongchitmate, Vassilis Zikas, Rafail Ostrovsky, Juan A. Garay, Nishanth Chandran
Publication date: 19 May 2017
Published in: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2688073.2688102
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Is information-theoretic topology-hiding computation possible? ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Formalizing delayed adaptive corruptions and the security of flooding networks ⋮ Practical provably secure flooding for blockchains ⋮ Communication complexity of Byzantine agreement, revisited ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Topology-hiding computation on all graphs ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Network-Hiding Communication and Applications to Multi-party Protocols ⋮ Topology-Hiding Computation Beyond Logarithmic Diameter
This page was built for publication: The Hidden Graph Model
