Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
Danny Bickson, Danny Dolev, Genia Bezman, Benny Pi...
Mobile technology is particularly suited to a fully distributed (replicated) architecture for collaborative work. Users can maintain their own document copies, and can continue to...
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...