Venue: Bharti 501 Abstract: Suppose Alice uses a t-out-of-n secret sharing to store her secret key on n servers. Her secret key is protected as long as t of them do not collude. However, what if a less-than-t subset of the servers decides to offer the shares they have for sale? In this case, Alice… Read More »Traceable Secret Sharing: Strong Security and Efficient Constructions by Aditi Partap

Venue: Bharti501 Abstract: We study the online busy time scheduling model on heterogeneous machines. In our setting, jobs with uniform length arrive online with a deadline that becomes known to the algorithm at the job's arrival time. An algorithm has access to machines, each with different associated capacities and costs. The goal is to schedule… Read More »Online Flexible Busy Time Scheduling on Heterogeneous Machines by Gruia Calinescu

Venue: Bharti-501/MS Teams Abstract: The goal of error correcting codes is to encode data in a way that allows for this data to be recovered even if the encoded copy is corrupted by an adversary. The usual algorithmic challenge associated with codes, called decoding, is to output the uncorrupted copy of data by looking only at… Read More »Coping with choices – List Decoding in Coding Theory by Dr. Shashank Srivastava