We analyze the fingerprinting method in [1] and suggest attacks that are better than the ones presented therein. To do this, we observe and use some extra information available i...
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...