Securecomm
Our paper Byzantine Protocols with Asymptotically Optimal Communication Complexity has been accepted at EAI SecureComm 2023.
Ph.D. Candidate · Computer Science
University of California, Davis
Our paper Byzantine Protocols with Asymptotically Optimal Communication Complexity has been accepted at EAI SecureComm 2023.