Paper ID | M.1.2 | ||
Paper Title | Communication Efficient Secret Sharing in the Presence of Malicious Adversary | ||
Authors | Rawad Bitar, Rutgers University, United States; Sidharth Jaggi, Chinese University of Hong Kong, China | ||
Session | M.1: Codes for Distributed Storage I | ||
Presentation | Lecture | ||
Track | Coding for Storage and Memories | ||
Manuscript | Click here to download the manuscript | ||
Virtual Presentation | Click here to watch in the Virtual Symposium | ||
Abstract |
Consider the communication efficient secret sharing problem. A dealer wants to share a secret with n parties such that any $k\leq n$ parties can reconstruct the secret and any $z |
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia