메뉴 건너뛰기




Volumn 26, Issue 2, 2014, Pages 322-335

Building confidential and efficient query services in the cloud with RASP data perturbation

Author keywords

kNN query; privacy; Query services in the cloud; range query

Indexed keywords

DATA CONFIDENTIALITY; DATA PERTURBATION METHOD; INDEXING TECHNIQUES; K-NN QUERY; MULTIDIMENSIONAL RANGE; QUERY SERVICE; RANGE QUERY; RANGE QUERY PROCESSING;

EID: 84891790992     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2012.251     Document Type: Article
Times cited : (64)

References (35)
  • 3
    • 79957620464 scopus 로고    scopus 로고
    • Security modeling and analysis
    • May/June
    • J. Bau and J.C. Mitchell, Security Modeling and Analysis, IEEE Security and Privacy, vol. 9, no. 3, pp. 18-25, May/June 2011.
    • (2011) IEEE Security and Privacy , vol.9 , Issue.3 , pp. 18-25
    • Bau, J.1    Mitchell, J.C.2
  • 5
    • 79960850152 scopus 로고    scopus 로고
    • Privacy-preserving multi-keyword ranked search over encrypted cloud Data
    • N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data, Proc. IEEE INFOCOMM, 2011.
    • (2011) Proc. IEEE INFOCOMM
    • Cao, N.1    Wang, C.2    Li, M.3    Ren, K.4    Lou, W.5
  • 7
    • 81155123637 scopus 로고    scopus 로고
    • Geometric data perturbation for outsourced data mining
    • K. Chen and L. Liu, Geometric Data Perturbation for Outsourced Data Mining, Knowledge and Information Systems, vol. 29, pp. 657-695, 2011.
    • (2011) Knowledge and Information Systems , vol.29 , pp. 657-695
    • Chen, K.1    Liu, L.2
  • 22
    • 77958396896 scopus 로고
    • Nearest neighbour searches and the curse of dimensionality
    • R. Marimont and M. Shapiro, Nearest Neighbour Searches and the Curse of Dimensionality, J. Inst. of Math. and Its Applications, vol. 24, pp. 59-70, 1979.
    • (1979) J. Inst. of Math. and Its Applications , vol.24 , pp. 59-70
    • Marimont, R.1    Shapiro, M.2
  • 27
    • 76749128899 scopus 로고    scopus 로고
    • Smallest singular value of a random rectangular matrix
    • M. Rudelson and R. Vershynin, Smallest Singular Value of a random Rectangular Matrix, Comm. Pure and Applied Math., vol. 62, pp. 1707-1739, 2009.
    • (2009) Comm. Pure and Applied Math. , vol.62 , pp. 1707-1739
    • Rudelson, M.1    Vershynin, R.2
  • 31
    • 70349278621 scopus 로고    scopus 로고
    • Building castles out of mud: Practical access pattern privacy and correctness on untrusted storage
    • P. Williams, R. Sion, and B. Carbunar, Building Castles Out of Mud: Practical Access Pattern Privacy and Correctness on Untrusted Storage, Proc. ACM Conf. Computer and Comm. Security, 2008.
    • (2008) Proc. ACM Conf. Computer and Comm. Security
    • Williams, P.1    Sion, R.2    Carbunar, B.3
  • 34
    • 84891785989 scopus 로고    scopus 로고
    • Building confidential and efficient query services in the cloud with rasp data perturbation
    • H. Xu, S. Guo, and K. Chen, Building Confidential and Efficient Query Services in the Cloud with Rasp Data Perturbation, Wright State Technical Report, http://arxiv.org/abs/1212.0610, 2012.
    • (2012) Wright State Technical Report
    • Xu, H.1    Guo, S.2    Chen, K.3
  • 35
    • 52649118020 scopus 로고    scopus 로고
    • Spacetwist: Managing the trade-offs among location privacy, query performance, and query accuracy in mobile services
    • M.L. L, C.S. S, X. Huang, and H. Lu, SpaceTwist: Managing the Trade-Offs among Location Privacy, Query Performance, and Query Accuracy in Mobile Services, Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 366-375, 2008.
    • (2008) Proc. IEEE Int'l Conf. Data Eng. (ICDE) , pp. 366-375
    • Huang, X.1    Lu, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.