Sciweavers

6137 search results - page 1175 / 1228
» Securing Collaborative Applications
Sort
View
PKC
2009
Springer
210views Cryptology» more  PKC 2009»
14 years 9 months ago
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
In this work, we consider the task of allowing a content provider to enforce complex access control policies on oblivious protocols conducted with anonymous users. As our primary ...
Scott E. Coull, Matthew Green, Susan Hohenberger
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 9 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
MOBISYS
2009
ACM
14 years 9 months ago
xShare: supporting impromptu sharing of mobile phones
Loaded with personal data, e.g. photos, contacts, and call history, mobile phones are truly personal devices. Yet it is often necessary or desirable to share our phones with other...
Yunxin Liu, Ahmad Rahmati, Yuanhe Huang, Hyukjae J...
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
14 years 9 months ago
Transforming data to satisfy privacy constraints
Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the individual (e.g., social security number). Data can ...
Vijay S. Iyengar
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 9 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
« Prev « First page 1175 / 1228 Last » Next »