Sciweavers

37 search results - page 7 / 8
» Secure Multi-party Computation Minimizing Online Rounds
Sort
View
SPAA
2005
ACM
14 years 1 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
ICISC
2001
162views Cryptology» more  ICISC 2001»
13 years 9 months ago
Content Extraction Signatures
Motivated by emerging needs in online interactions, we define a new type of digital signature called a `Content Extraction Signature' (CES). A CES allows the owner, Bob, of a...
Ron Steinfeld, Laurence Bull, Yuliang Zheng
CONEXT
2009
ACM
13 years 8 months ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...
COLT
2008
Springer
13 years 9 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
SOUPS
2009
ACM
14 years 2 months ago
flyByNight: mitigating the privacy risks of social networking
Social networking websites are enormously popular, but they present a number of privacy risks to their users, one of the foremost of which being that social network service provid...
Matthew M. Lucas, Nikita Borisov