Showing cs.ITShow all
2 papers · 1 filter
cs.IT2025
Byzantine-Resilient Distributed Computation via Task Replication and Local Computations
Aayush Rajesh, Nikhil Karamchandani, Vinod M. Prabhakaran
We study a distributed computation problem in the presence of Byzantine workers where a central node wishes to solve a task that is divided into independent sub-tasks, each of whic…
cs.IT2023
Randomness Requirements for Three-Secret Sharing
Hari Krishnan P. Anilkumar, Aayush Rajesh, Varun Narayanan +2
We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted.…