메뉴 건너뛰기




Volumn , Issue , 2012, Pages 451-459

Achieving usable and privacy-assured similarity search over outsourced cloud data

Author keywords

[No Author keywords available]

Indexed keywords

CLOUD DATA; COMPLEX DATA; DATA FILES; DATA SETS; DATA USERS; DATA UTILIZATION; DOCUMENT COLLECTION; ECONOMIC SAVINGS; EDIT DISTANCE; ENCRYPTED DATA; KEYWORD SEARCH; MECHANISM DESIGN; NEW CONSTRUCTIONS; OUTSOURCE; PLAINTEXT; PRIVACY PRESERVING; SEARCH TIME; SERVICE-BASED; SIMILARITY METRICS; SIMILARITY SEARCH; SYSTEM USABILITY;

EID: 84861636543     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195784     Document Type: Conference Paper
Times cited : (268)

References (23)
  • 2
    • 77950347409 scopus 로고    scopus 로고
    • A view of cloud computing
    • April
    • M. Armbrust et al., "A view of cloud computing," Communications of the ACM, vol. 53, no. 4, pp. 50-58, April 2010.
    • (2010) Communications of the ACM , vol.53 , Issue.4 , pp. 50-58
    • Armbrust, M.1
  • 4
    • 85011032600 scopus 로고    scopus 로고
    • Vgram: Improving performance of approximate queries on string collections using variable-length grams
    • C. Li, B. Wang, and X. Yang, "Vgram: Improving performance of approximate queries on string collections using variable-length grams,"in Proc. of VLDB, 2007, pp. 303-314.
    • Proc. of VLDB, 2007 , pp. 303-314
    • Li, C.1    Wang, B.2    Yang, X.3
  • 5
    • 77954747181 scopus 로고    scopus 로고
    • Bed-tree: An all-purpose index structure for string similarity search based on edit distance
    • Z. Zhang, M. Hadjieleftheriou, B. C. Ooi, and D. Srivastava, "Bed-tree: an all-purpose index structure for string similarity search based on edit distance," in Proc. of SIGMOD, 2010, pp. 915-926.
    • Proc. of SIGMOD, 2010 , pp. 915-926
    • Zhang, Z.1    Hadjieleftheriou, M.2    Ooi, B.C.3    Srivastava, D.4
  • 7
    • 33244488406 scopus 로고    scopus 로고
    • Secure indexes
    • ePrint Archive, Report 2003/216
    • E.-J. Goh, "Secure indexes," Cryptology ePrint Archive, Report 2003/216, 2003, http://eprint.iacr.org/.
    • (2003) Cryptology
    • Goh, E.-J.1
  • 9
    • 44049096900 scopus 로고    scopus 로고
    • Privacy preserving keyword searches on remote encrypted data
    • Y.-C. Chang and M. Mitzenmacher, "Privacy preserving keyword searches on remote encrypted data," in Proc. of ACNS, 2005.
    • Proc. of ACNS, 2005
    • Chang, Y.-C.1    Mitzenmacher, M.2
  • 10
    • 34547240272 scopus 로고    scopus 로고
    • Searchable symmetric encryption: Improved definitions and efficient constructions
    • R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, "Searchable symmetric encryption: improved definitions and efficient constructions,"in Proc. of ACM CCS, 2006, pp. 79-88.
    • Proc. of ACM CCS, 2006 , pp. 79-88
    • Curtmola, R.1    Garay, J.A.2    Kamara, S.3    Ostrovsky, R.4
  • 15
    • 0002619432 scopus 로고
    • Binary codes capable of correcting spurious insertions and deletions of ones
    • V. Levenshtein, "Binary codes capable of correcting spurious insertions and deletions of ones," Problems of Information Transmission, vol. 1, no. 1, pp. 8-17, 1965.
    • (1965) Problems of Information Transmission , vol.1 , Issue.1 , pp. 8-17
    • Levenshtein, V.1
  • 16
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. Bloom, "Space/time trade-offs in hash coding with allowable errors,"Communications of the ACM, vol. 13, no. 7, pp. 422-426, 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 18
    • 38049045519 scopus 로고    scopus 로고
    • Conjunctive, subset, and range queries on encrypted data
    • D. Boneh and B. Waters, "Conjunctive, subset, and range queries on encrypted data," in Proc. of TCC, 2007, pp. 535-554.
    • Proc. of TCC, 2007 , pp. 535-554
    • Boneh, D.1    Waters, B.2
  • 19
    • 33745120364 scopus 로고    scopus 로고
    • Secure Conjunctive Keyword Search over Encrypted Data
    • P. Golle, J. Staddon, and B. R. Waters, "Secure Conjunctive Keyword Search over Encrypted Data," in Proc. of ACNS, 2004, pp. 31-45.
    • Proc. of ACNS, 2004 , pp. 31-45
    • Golle, P.1    Staddon, J.2    Waters, B.R.3
  • 20
    • 34547239322 scopus 로고    scopus 로고
    • Achieving efficient conjunctive keyword searches over encrypted data
    • L. Ballard, S. Kamara, and F. Monrose, "Achieving efficient conjunctive keyword searches over encrypted data," in Proc. of ICICS, 2005.
    • Proc. of ICICS, 2005
    • Ballard, L.1    Kamara, S.2    Monrose, F.3
  • 23
    • 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," in Proc. of INFOCOM, 2011, pp. 829-837.
    • Proc. of INFOCOM, 2011 , pp. 829-837
    • Cao, N.1    Wang, C.2    Li, M.3    Ren, K.4    Lou, W.5


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