Gossiping For Communication-Efficient Broadcast
2 views
Skip to first unread message
Dionysis Zindros
Mar 16, 2021, 4:33:38 PM3/16/21
to decr...@googlegroups.com
Tomorrow, Wednesday, March 17, 2021, 04:00 PM UTC, Giorgos Tsimos from the University of Maryland will present "Gossiping For Communication-Efficient Broadcast".
Abstract: Broadcast (BC) is a crucial ingredient for a plethora of cryptographic protocols such as secret sharing and multiparty computation. In this talk, we present new randomized BC protocols with improved communication complexity and secure against an adversary controlling the majority of parties. We utilize gossiping i.e. propagating a message by sending to a few random parties who in turn do the same, until the message is delivered. We show a protocol for single-sender BC that achieves O (n^2 κ^2) bits of communication and where no trusted setup is required. We also present, to the best of our knowledge, the first non-trivial, adaptively-secure parallel BC protocol (widely used in MPC) with O (n^2 κ^4) communication complexity, improving existing parallel BC protocols of O(n^3) communication.
Join here: https://zoom.us/j/94658788236?pwd=bURlcFU0aEJhSDR3cUI5cXkrbGlOdz09
Password: 6y9Edn
More seminars: https://decrypto.org/seminar
Abstract: Broadcast (BC) is a crucial ingredient for a plethora of cryptographic protocols such as secret sharing and multiparty computation. In this talk, we present new randomized BC protocols with improved communication complexity and secure against an adversary controlling the majority of parties. We utilize gossiping i.e. propagating a message by sending to a few random parties who in turn do the same, until the message is delivered. We show a protocol for single-sender BC that achieves O (n^2 κ^2) bits of communication and where no trusted setup is required. We also present, to the best of our knowledge, the first non-trivial, adaptively-secure parallel BC protocol (widely used in MPC) with O (n^2 κ^4) communication complexity, improving existing parallel BC protocols of O(n^3) communication.
Join here: https://zoom.us/j/94658788236?pwd=bURlcFU0aEJhSDR3cUI5cXkrbGlOdz09
Password: 6y9Edn
More seminars: https://decrypto.org/seminar
Reply all
Reply to author
Forward
0 new messages