208 search results - page 8 / 42 » Computing Anonymously with Arbitrary Knowledge |
SIGCOMM
2009
ACM
14 years 3 months ago
2009
ACM
For most mobile networks, providers need the current position of their users to provide efficient service. The resulting motion data is not only an invaluable source for analyzing...
CCS
2008
ACM
13 years 11 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
EDBT
2009
ACM
14 years 25 days ago
2009
ACM
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
ISW
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle mod...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information...