Sciweavers

2355 search results - page 7 / 471
» Anonymizing Temporal Data
Sort
View
ICDE
2007
IEEE
115views Database» more  ICDE 2007»
14 years 8 months ago
MultiRelational k-Anonymity
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much...
Mehmet Ercan Nergiz, Chris Clifton, A. Erhan Nergi...
GVD
2004
107views Database» more  GVD 2004»
13 years 9 months ago
A Representation of Time Series for Temporal Web Mining
Data with temporal information is constantly generated, sampled, gathered, and analyzed in different domains, such as medicine, finance, engineering, environmental sciences, and e...
Mireille Samia
DBSEC
2009
112views Database» more  DBSEC 2009»
13 years 8 months ago
Distributed Anonymization: Achieving Privacy for Both Data Subjects and Data Providers
There is an increasing need for sharing data repositories containing personal information across multiple distributed and private databases. However, such data sharing is subject t...
Pawel Jurczyk, Li Xiong
IPPS
2006
IEEE
14 years 1 months ago
Shubac: a searchable P2P network utilizing dynamic paths for client/server anonymity
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
A. Brodie, Cheng-Zhong Xu, Weisong Shi
CCS
2003
ACM
14 years 22 days ago
Receiver anonymity via incomparable public keys
We describe a new method for protecting the anonymity of message receivers in an untrusted network. Surprisingly, existing methods fail to provide the required level of anonymity ...
Brent R. Waters, Edward W. Felten, Amit Sahai