-
3
-
-
0041783510
-
Privacy-preserving data mining
-
R. Agrawal and R. Srikant. Privacy-preserving data mining. In SIGMOD, 2000.
-
(2000)
SIGMOD
-
-
Agrawal, R.1
Srikant, R.2
-
8
-
-
27944454864
-
Location privacy in mobile systems: A personalized anonymization model
-
B. Gedik and L. Liu. Location privacy in mobile systems: A personalized anonymization model. In ICDCS, 2005.
-
(2005)
ICDCS
-
-
Gedik, B.1
Liu, L.2
-
9
-
-
57149129292
-
Private queries in location based services: Anonymizers are not necessary
-
G. Ghinita, P. Kalnis, A. Khoshgozaran, C. Shahabi, and K. L. Tan. Private queries in location based services: Anonymizers are not necessary. In SIGMOD, 2008.
-
(2008)
SIGMOD
-
-
Ghinita, G.1
Kalnis, P.2
Khoshgozaran, A.3
Shahabi, C.4
Tan, K.L.5
-
10
-
-
0036361105
-
Executing sql over encrypted data in the database-service-provider model
-
H. Hacigumus, B. Iyer, C. Li, and S. Mehrotra. Executing sql over encrypted data in the database-service-provider model. In SIGMOD, 2002.
-
(2002)
SIGMOD
-
-
Hacigumus, H.1
Iyer, B.2
Li, C.3
Mehrotra, S.4
-
11
-
-
16644385952
-
Efficient execution of aggregation queries over encrypted relational databases
-
H. Hacigumus, B. Iyer, and S. Mehrotra. Efficient execution of aggregation queries over encrypted relational databases. In DASFAA, 2004.
-
(2004)
DASFAA
-
-
Hacigumus, H.1
Iyer, B.2
Mehrotra, S.3
-
13
-
-
57149125534
-
Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy
-
A. Khoshgozaran and C. Shahabi. Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy. In SSTD, 2007.
-
(2007)
SSTD
-
-
Khoshgozaran, A.1
Shahabi, C.2
-
14
-
-
34548805858
-
T-closeness: Privacy beyond k-anonymity and l-diversity
-
N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and l-diversity. In ICDE, 2007.
-
(2007)
ICDE
-
-
Li, N.1
Li, T.2
Venkatasubramanian, S.3
-
15
-
-
49749109657
-
An attacker's view of distance preserving maps for privacy preserving data mining
-
K. Liu, C. Giannella, and H. Kargupta. An attacker's view of distance preserving maps for privacy preserving data mining. In PKDD, 2006.
-
(2006)
PKDD
-
-
Liu, K.1
Giannella, C.2
Kargupta, H.3
-
17
-
-
34547720006
-
The new casper: Query processing for location services without compromising privacy
-
M. F. Mokbel, C. Y. Chow, and W. G. Aref. The new casper: Query processing for location services without compromising privacy. In VLDB, 2006.
-
(2006)
VLDB
-
-
Mokbel, M.F.1
Chow, C.Y.2
Aref, W.G.3
-
18
-
-
70849121494
-
Incorporating a secure coprocessor in the database-as-a-service model
-
E. Mykletun and G. Tsudik. Incorporating a secure coprocessor in the database-as-a-service model. In IWIA, 2005.
-
(2005)
IWIA
-
-
Mykletun, E.1
Tsudik, G.2
-
19
-
-
70849133669
-
Aggregation queries in the database-as-a-service model
-
E. Mykletun and G. Tsudik. Aggregation queries in the database-as-a-service model. In ESORICS, 2006.
-
(2006)
ESORICS
-
-
Mykletun, E.1
Tsudik, G.2
-
20
-
-
14244260513
-
Privacy preserving clustering by data transformation
-
Manaus, Amazonas, Brazil
-
S. R. M. Oliveira and O. R. Zaiane. Privacy preserving clustering by data transformation. In SBBD, Manaus, Amazonas, Brazil, 2003.
-
(2003)
SBBD
-
-
Oliveira, S.R.M.1
Zaiane, O.R.2
-
21
-
-
0036811662
-
K-anonymity: A model for protecting privacy
-
L. Sweeney. k-anonymity: A model for protecting privacy. In IJUFKS, 2002.
-
(2002)
IJUFKS
-
-
Sweeney, L.1
-
22
-
-
35448935270
-
Progressive and selective merge: Computing top-k with ad-hoc ranking functions
-
D. Xin, J. Han, and K. C.-C. Chang. Progressive and selective merge: computing top-k with ad-hoc ranking functions. In SIGMOD, 2007.
-
(2007)
SIGMOD
-
-
Xin, D.1
Han, J.2
Chang, K.C.-C.3
-
23
-
-
35448932726
-
Answering topk queries with multidimensional selections: The ranking cube approach
-
D. Xin, J. Han, H. Cheng, and X. Li. Answering topk queries with multidimensional selections: The ranking cube approach. In VLDB, 2006.
-
(2006)
VLDB
-
-
Xin, D.1
Han, J.2
Cheng, H.3
Li, X.4
-
24
-
-
52649092321
-
Dominant graph: An effcient indexing structure to answer top-k queries
-
L. Zou and L. Chen. Dominant graph: An effcient indexing structure to answer top-k queries. In ICDE, 2008.
-
(2008)
ICDE
-
-
Zou, L.1
Chen, L.2
|