메뉴 건너뛰기




Volumn , Issue , 2014, Pages 664-675

Secure k-nearest neighbor query over encrypted data in outsourced environments

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA PROCESSING; INFORMATION MANAGEMENT; MOBILE DEVICES; QUERY PROCESSING;

EID: 84901750940     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2014.6816690     Document Type: Conference Paper
Times cited : (339)

References (25)
  • 1
    • 79957834847 scopus 로고    scopus 로고
    • Processing private queries over untrusted data cloud through privacy homomorphism
    • H. Hu, J. Xu, C. Ren, and B. Choi, "Processing private queries over untrusted data cloud through privacy homomorphism," in ICDE. IEEE, 2011, pp. 601-612.
    • (2011) ICDE. IEEE , pp. 601-612
    • Hu, H.1    Xu, J.2    Ren, C.3    Choi, B.4
  • 2
    • 84861307113 scopus 로고    scopus 로고
    • The nist definition of cloud computing (draft)
    • P. Mell and T. Grance, "The nist definition of cloud computing (draft)," NIST special publication, vol. 800, p. 145, 2011.
    • (2011) NIST Special Publication , vol.800 , pp. 145
    • Mell, P.1    Grance, T.2
  • 3
    • 84866351451 scopus 로고    scopus 로고
    • Toward privacy-assured cloud data services with flexible search functionalities
    • M. Li, S. Yu, W. Lou, and Y. T. Hou, "Toward privacy-assured cloud data services with flexible search functionalities," in ICDCSW. IEEE, 2012, pp. 466-470.
    • (2012) ICDCSW. IEEE , pp. 466-470
    • Li, M.1    Yu, S.2    Lou, W.3    Hou, Y.T.4
  • 4
    • 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," in CCS. ACM, 2008, pp. 139-148.
    • (2008) CCS. ACM , pp. 139-148
    • Williams, P.1    Sion, R.2    Carbunar, B.3
  • 5
    • 85179556059 scopus 로고    scopus 로고
    • Access pattern disclosure on searchable encryption: Ramification, attack and mitigation
    • M. S. Islam, M. Kuzu, and M. Kantarcioglu, "Access pattern disclosure on searchable encryption: Ramification, attack and mitigation," in NDSS, 2012.
    • (2012) NDSS
    • Islam, M.S.1    Kuzu, M.2    Kantarcioglu, M.3
  • 6
    • 85065578926 scopus 로고    scopus 로고
    • A privacy-preserving index for range queries
    • B. Hore, S. Mehrotra, and G. Tsudik, "A privacy-preserving index for range queries," in VLDB, 2004, pp. 720-731.
    • (2004) VLDB , pp. 720-731
    • Hore, B.1    Mehrotra, S.2    Tsudik, G.3
  • 8
    • 84861186664 scopus 로고    scopus 로고
    • Secure multidimensional range queries over outsourced data
    • B. Hore, S. Mehrotra, M. Canim, and M. Kantarcioglu, "Secure multidimensional range queries over outsourced data," The VLDB Journal, vol. 21, no. 3, pp. 333-358, 2012.
    • (2012) The VLDB Journal , vol.21 , Issue.3 , pp. 333-358
    • Hore, B.1    Mehrotra, S.2    Canim, M.3    Kantarcioglu, M.4
  • 9
    • 33745623486 scopus 로고    scopus 로고
    • Efficient execution of aggregation queries over encrypted relational databases
    • Springer
    • H. Hacigümüş, B. Iyer, and S. Mehrotra, "Efficient execution of aggregation queries over encrypted relational databases," in Database Systems for Advanced Applications. Springer, 2004, pp. 125-136.
    • (2004) Database Systems for Advanced Applications , pp. 125-136
    • Hacigümüş, H.1    Iyer, B.2    Mehrotra, S.3
  • 10
    • 33746748166 scopus 로고    scopus 로고
    • Aggregation queries in the database-as-aservice model
    • Springer
    • E. Mykletun and G. Tsudik, "Aggregation queries in the database-as-aservice model," in Data and Applications Security XX. Springer, 2006, pp. 89-103.
    • (2006) Data and Applications Security XX , pp. 89-103
    • Mykletun, E.1    Tsudik, G.2
  • 11
    • 70849131456 scopus 로고    scopus 로고
    • Secure knn computation on encrypted databases
    • W. K. Wong, D. W.-l. Cheung, B. Kao, and N. Mamoulis, "Secure knn computation on encrypted databases," in SIGMOD, 2009, pp. 139-152.
    • (2009) SIGMOD , pp. 139-152
    • Wong, W.K.1    Cheung, D.W.-L.2    Kao, B.3    Mamoulis, N.4
  • 12
    • 84878495668 scopus 로고    scopus 로고
    • Secure k-nn computation on encrypted cloud data without sharing key with query users
    • ACM
    • Y. Zhu, R. Xu, and T. Takagi, "Secure k-nn computation on encrypted cloud data without sharing key with query users," in Cloud Computing. ACM, 2013, pp. 55-60.
    • (2013) Cloud Computing , pp. 55-60
    • Zhu, Y.1    Xu, R.2    Takagi, T.3
  • 13
    • 84901758297 scopus 로고    scopus 로고
    • Secure nearest neighbor revisited
    • Brisbane, Australia, April
    • B. Yao, F. Li, and X. Xiao, "Secure nearest neighbor revisited," in IEEE ICDE, Brisbane, Australia, April 2013.
    • (2013) IEEE ICDE
    • Yao, B.1    Li, F.2    Xiao, X.3
  • 14
    • 33645593031 scopus 로고    scopus 로고
    • Cambridge, University Press ch. General Cryptographic Protocols
    • O. Goldreich, The Foundations of Cryptography. Cambridge, University Press, 2004, vol. 2, ch. General Cryptographic Protocols, pp. 599-746.
    • (2004) The Foundations of Cryptography , vol.2 , pp. 599-746
    • Goldreich, O.1
  • 15
    • 0000277371 scopus 로고    scopus 로고
    • Public-key cryptosystems based on composite degree resid-uosity classes
    • Springer-Verlag
    • P. Paillier, "Public-key cryptosystems based on composite degree resid-uosity classes," in EUROCRYPT. Springer-Verlag, 1999.
    • (1999) EUROCRYPT
    • Paillier, P.1
  • 17
    • 84945300542 scopus 로고    scopus 로고
    • A provably secure additive and multiplicative privacy homomorphism
    • J. Domingo-Ferrer, "A provably secure additive and multiplicative privacy homomorphism," Information Security, pp. 471-483, 2002.
    • (2002) Information Security , pp. 471-483
    • Domingo-Ferrer, J.1
  • 19
    • 51849139413 scopus 로고    scopus 로고
    • Efficient privacy-preserving k-nearest neighbor search
    • Y. Qi and M. J. Atallah, "Efficient privacy-preserving k-nearest neighbor search," in ICDCS. IEEE, 2008, pp. 311-319.
    • (2008) ICDCS. IEEE , pp. 311-319
    • Qi, Y.1    Atallah, M.J.2
  • 20
    • 28444436573 scopus 로고    scopus 로고
    • Privacy-preserving top-k queries
    • J. Vaidya and C. Clifton, "Privacy-preserving top-k queries," in ICDE. IEEE, 2005, pp. 545-546.
    • (2005) ICDE. IEEE , pp. 545-546
    • Vaidya, J.1    Clifton, C.2
  • 21
    • 57149129292 scopus 로고    scopus 로고
    • 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. ACM, 2008, pp. 121-132.
    • (2008) SIGMOD. ACM , pp. 121-132
    • Ghinita, G.1    Kalnis, P.2    Khoshgozaran, A.3    Shahabi, C.4    Tan, K.-L.5
  • 22
    • 0024611659 scopus 로고
    • The knowledge complexity of interactive proof systems
    • February
    • S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM Journal of Computing, vol. 18, pp. 186-208, February 1989.
    • (1989) SIAM Journal of Computing , vol.18 , pp. 186-208
    • Goldwasser, S.1    Micali, S.2    Rackoff, C.3
  • 23
    • 84877991754 scopus 로고    scopus 로고
    • An efficient and probabilistic secure bit-decomposition
    • B. K. Samanthula and W. Jiang, "An efficient and probabilistic secure bit-decomposition," in ACM ASIACCS, 2013, pp. 541-546.
    • (2013) ACM ASIACCS , pp. 541-546
    • Samanthula, B.K.1    Jiang, W.2


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