Sciweavers

PODC
2011
ACM
13 years 2 months ago
Securing social networks
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
Michael Backes, Matteo Maffei, Kim Pecina
PODC
2011
ACM
13 years 2 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
PODC
2011
ACM
13 years 2 months ago
Analyzing consistency properties for fun and profit
:  Analyzing Consistency Properties for Fun and Profit Wojciech Golab, Xiaozhou Li, Mehul A. Shah HP Laboratories HPL-2011-6 data consistency, algorightms, key-value stores Moti...
Wojciech M. Golab, Xiaozhou Li, Mehul A. Shah
PODC
2011
ACM
13 years 2 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
PODC
2011
ACM
13 years 2 months ago
A theory of goal-oriented communication
We put forward a general theory of goal-oriented communication, where communication is not an end in itself, but rather a means to achieving some goals of the communicating partie...
Oded Goldreich, Brendan Juba, Madhu Sudan