Sciweavers

198 search results - page 8 / 40
» Weak Probabilistic Anonymity
Sort
View
COLING
2010
13 years 4 months ago
The Role of Queries in Ranking Labeled Instances Extracted from Text
A weakly supervised method uses anonymized search queries to induce a ranking among class labels extracted from unstructured text for various instances. The accuracy of the extrac...
Marius Pasca
ACSAC
2009
IEEE
14 years 3 months ago
A New Approach for Anonymous Password Authentication
—Anonymous password authentication reinforces password authentication with the protection of user privacy. Considering the increasing concern of individual privacy nowadays, anon...
Yanjiang Yang, Jianying Zhou, Jian Weng, Feng Bao
CSFW
2010
IEEE
14 years 29 days ago
Robustness Guarantees for Anonymity
—Anonymous communication protocols must achieve two seemingly contradictory goals: privacy (informally, they must guarantee the anonymity of the parties that send/receive informa...
Gilles Barthe, Alejandro Hevia, Zhengqin Luo, Tama...
DISCEX
2003
IEEE
14 years 2 months ago
Design and Analysis of an IP-Layer Anonymizing Infrastructure
This paper describes an IP-layer anonymizing infrastructure, called ANON, which allows server addresses to be hidden from clients and vice versa. In providing address anonymity, A...
H. T. Kung, Chen-Mou Cheng, Koan-Sin Tan, Scott Br...
IPL
2011
91views more  IPL 2011»
13 years 14 days ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...