Sciweavers

198 search results - page 12 / 40
» Weak Probabilistic Anonymity
Sort
View
SDM
2009
SIAM
125views Data Mining» more  SDM 2009»
14 years 6 months ago
Identifying Unsafe Routes for Network-Based Trajectory Privacy.
In this paper, we propose a privacy model that offers trajectory privacy to the requesters of Location-Based Services (LBSs), by utilizing an underlying network of user movement. ...
Aris Gkoulalas-Divanis, Mohamed F. Mokbel, Vassili...
IJISEC
2007
87views more  IJISEC 2007»
13 years 9 months ago
Breaking four mix-related schemes based on Universal Re-encryption
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...
George Danezis
IJCAI
2001
13 years 10 months ago
Context-specific Sign-propagation in Qualitative Probabilistic Networks
ive probabilistic networks are qualitative abstractions of probabilistic networks, summarising probabilistic influences by qualitative signs. As qualitative networks model influen...
Silja Renooij, Simon Parsons, Linda C. van der Gaa...
JASIS
2006
108views more  JASIS 2006»
13 years 9 months ago
Fuzzy techniques for trust and reputation management in anonymous peer-to-peer systems
P2P applications are rapidly gaining acceptance among users of Internet-based services, especially because of their capability of exchanging resources while preserving the anonymi...
Roberto Aringhieri, Ernesto Damiani, Sabrina De Ca...
FOSSACS
2008
Springer
13 years 10 months ago
Compositional Methods for Information-Hiding
Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provide...
Christelle Braun, Konstantinos Chatzikokolakis, Ca...