The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
This paper introduces SOAR, a service-oriented architecture for the real-estate industry that embeds trust and security, allows for formal correctness proofs of service interactio...
Emerson Ribeiro de Mello, Savas Parastatidis, Phil...
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...