46 citations · 127 across the 25 of their papers we have counts for
9 papers · 1 filter
Tiny Groups Tackle Byzantine Adversaries
Mercy O. Jaiyeola, Kyle Patron, Jared Saia +2
A popular technique for tolerating malicious faults in open distributed systems is to establish small groups of participants, each of which has a non-faulty majority. These groups…
Interactive Communication with Unknown Noise Rate
Varsha Dani, Thomas P. Hayes, Mahnush Movahedi +2
Alice and Bob want to run a protocol over a noisy channel, where a certain number of bits are flipped adversarially. Several results take a protocol requiring bits of noise-fre…
Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation
Varsha Dani, Valerie King, Mahnush Movahedi +1
We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static…
Scalable Mechanisms for Rational Secret Sharing
Varsha Dani, Mahnush Movahedi, Jared Saia
We consider the classical secret sharing problem in the case where all agents are selfish but rational. In recent work, Kol and Naor show that, when there are two players, in the n…
Secure Multi-Party Computation in Large Networks
Varsha Dani, Valerie King, Mahnush Movahedi +2
We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a large number of parties. We consider both the synchronous and the asynchronous c…
Improved Approximation Algorithms for Segment Minimization in Intensity Modulated Radiation Therapy
Therese Biedl, Stephane Durocher, Holger H. Hoos +3
he segment minimization problem consists of finding the smallest set of integer matrices that sum to a given intensity matrix, such that each summand has only one non-zero value, a…