메뉴 건너뛰기




Volumn , Issue , 2011, Pages 273-281

Privacy-aware bedtree based solution for fuzzy multi-keyword search over encrypted data

Author keywords

co incurrence probability; encrypted cloud data; fuzzy keyword search; multi keyword search

Indexed keywords

CO-INCURRENCE PROBABILITY; COMPUTING TECHNOLOGY; CONSTRUCTION TIME; ENCRYPTED CLOUD DATA; ENCRYPTED DATA; ENCRYPTION SCHEMES; EVALUATION RESULTS; INCREMENTAL UPDATES; INDEX TREES; KEYWORD SEARCH; MULTI-KEYWORD SEARCH; PERSONAL HEALTH RECORD; SEARCH SCHEME; SEARCH TIME; SENSITIVE DATAS; TREE-BASED APPROACH; WILD CARDS;

EID: 80052398037     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2011.11     Document Type: Conference Paper
Times cited : (113)

References (20)
  • 2
    • 80052418648 scopus 로고    scopus 로고
    • Determinstic and efficiently searchable encryption
    • Proceedings of Crypto 2007
    • M. Bellare, A. Boldyreva, and A. O. Neil,"Determinstic and efficiently searchable encryption", Proceedings of Crypto 2007, LCNS, Vol 4622, 2007.
    • LCNS , vol.4622 , pp. 2007
    • Bellare, M.1    Boldyreva, A.2    Neil, A.O.3
  • 8
    • 38049045519 scopus 로고    scopus 로고
    • Conjunctive, subset and range queries on encrypted data
    • B. Boneh, B. Waters, "Conjunctive, subset and range queries on encrypted data", Proceedings of TCC, 2007 pp 535-554
    • Proceedings of TCC, 2007 , pp. 535-554
    • Boneh, B.1    Waters, B.2
  • 9
    • 77953308681 scopus 로고    scopus 로고
    • Fuzzy Keyword Search over Encrypted Data in Cloud Computing
    • J. Li et al, "Fuzzy Keyword Search over Encrypted Data in Cloud Computing", Proceedings of IEEE Infocom, April, 2010
    • Proceedings of IEEE Infocom, April, 2010
    • Li, J.1
  • 10
    • 79960850152 scopus 로고    scopus 로고
    • Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud Data
    • to appear
    • N. Cao et al, "Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud Data", to appear IEEE Infocom, 2011.
    • (2011) IEEE Infocom
    • Cao, N.1
  • 11
    • 43349086436 scopus 로고    scopus 로고
    • Zerber: R-confidential indexing for distributed documents
    • S. Zerr et al, "Zerber: r-confidential indexing for distributed documents", Proceedings of EDBT, 2008 pp 287-298.
    • Proceedings of EDBT, 2008 , pp. 287-298
    • Zerr, S.1
  • 12
    • 77954747181 scopus 로고    scopus 로고
    • ed-Tree: An All Purpose Index Structure for String Similiarity Search Based on Edit Distance
    • ed-Tree: An All Purpose Index Structure for String Similiarity Search Based on Edit Distance", Proceedings of ACM SIGMOD 2010.
    • Proceedings of ACM SIGMOD 2010
    • Zhang, Z.1
  • 14
    • 84882985846 scopus 로고    scopus 로고
    • The Semantic GrowBag Algorithm: Automatically Deriving Categorization Systems
    • J. Diederich, W.T. Balke, "The Semantic GrowBag Algorithm: Automatically Deriving Categorization Systems", Proceedings of ECDL, 2007.
    • Proceedings of ECDL, 2007
    • Diederich, J.1    Balke, W.T.2
  • 15
    • 52649086729 scopus 로고    scopus 로고
    • Efficient merging and filtering algorithms for approximate string searches
    • C. Li, J. Lu, Y. Lu, "Efficient merging and filtering algorithms for approximate string searches", Proceedings of ICDE, 2008
    • Proceedings of ICDE, 2008
    • Li, C.1    Lu, J.2    Lu, Y.3
  • 16
    • 67649641448 scopus 로고    scopus 로고
    • Space-constrained gram-based indexing for efficient approximate string search
    • A. Behm, S. Ji, C. Li, J. Lu, "Space-constrained gram-based indexing for efficient approximate string search", Proceedings of ICDE, 2009
    • Proceedings of ICDE, 2009
    • Behm, A.1    Ji, S.2    Li, C.3    Lu, J.4


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