메뉴 건너뛰기




Volumn , Issue , 2007, Pages 598-604

Secure similarity search

Author keywords

[No Author keywords available]

Indexed keywords

ENCRYPTED DATA; ENCRYPTED DOCUMENTS; GRANULAR COMPUTING (GRC); INTERNATIONAL CONFERENCES; KEYWORD INDEX; SEARCH SYSTEMS; SECURITY REQUIREMENTS; SENSITIVE INFORMATIONS; SIMILARITY SEARCHES;

EID: 46749089241     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GRC.2007.4403170     Document Type: Conference Paper
Times cited : (36)

References (38)
  • 1
    • 33745134401 scopus 로고    scopus 로고
    • M. Abdalla, M. Bellare, D.Catalano, E.Kiltz, T.Kohno, T.Lange, J.Malone-Lee, G.Neven, P. Paillier, and H.a Shi, Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions, Crypto05, LNCS 3621, pp.205-222, 2005
    • M. Abdalla, M. Bellare, D.Catalano, E.Kiltz, T.Kohno, T.Lange, J.Malone-Lee, G.Neven, P. Paillier, and H.a Shi, Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions, Crypto05, LNCS 3621, pp.205-222, 2005
  • 2
    • 26444513211 scopus 로고    scopus 로고
    • M. J. Atallahl, K.B. Frikkenl, M.T. Goodrich, and R. Tamassia, Secure Biometric Authentication for Weak Computational Devices, FC 2005, LNCS 3570, pp. 357.371, 2005
    • M. J. Atallahl, K.B. Frikkenl, M.T. Goodrich, and R. Tamassia, Secure Biometric Authentication for Weak Computational Devices, FC 2005, LNCS 3570, pp. 357.371, 2005
  • 3
    • 0000942833 scopus 로고
    • Text retrieval: Theory and practice, In 12th IFIP World Computer Congress, Elsevier
    • R. Baeza-Yates, Text retrieval: Theory and practice, In 12th IFIP World Computer Congress, Elsevier Science, vol. I, pp. 465-476, 1992
    • (1992) Science , vol.1 , pp. 465-476
    • Baeza-Yates, R.1
  • 4
    • 17444370055 scopus 로고    scopus 로고
    • Public-key encryption with keyword search, Eurocrypt04
    • Springer-Verlag
    • D.Boneh, G.D.Crescenzo, R.Ostrovsky, and G.Persiano, Public-key encryption with keyword search, Eurocrypt04, LNCS, Springer-Verlag, 2004
    • (2004) LNCS
    • Boneh, D.1    Crescenzo, G.D.2    Ostrovsky, R.3    Persiano, G.4
  • 5
    • 38049001725 scopus 로고    scopus 로고
    • Anonymous multi-attribute encryption with range query and conditional decryption
    • Technical report, CMU-CS- 06-135
    • J. Bethencourt, H. Chan, A. Perrig, E. Shi, and D. Song, Anonymous multi-attribute encryption with range query and conditional decryption, Technical report, CMU-CS- 06-135, 2006.
    • (2006)
    • Bethencourt, J.1    Chan, H.2    Perrig, A.3    Shi, E.4    Song, D.5
  • 7
    • 46749118176 scopus 로고    scopus 로고
    • L.Ballard, M.Green, B.de Medeiros, F.Monrose, Correlation-Resistant Storage via Keyword-Searchable Encryption, SPAR Technical Report TR-SP-BGMM-050705
    • L.Ballard, M.Green, B.de Medeiros, F.Monrose, Correlation-Resistant Storage via Keyword-Searchable Encryption, SPAR Technical Report TR-SP-BGMM-050705
  • 8
    • 33646736337 scopus 로고    scopus 로고
    • Achieving efficient conjunctive keyword searches over encrypted data, ICICS 2005
    • L.Ballad, S.Kamara, and F.Monrose, Achieving efficient conjunctive keyword searches over encrypted data, ICICS 2005, LNCS 3783, pp.414-426, 2005
    • (2005) LNCS , vol.3783 , pp. 414-426
    • Ballad, L.1    Kamara, S.2    Monrose, F.3
  • 9
    • 33746214783 scopus 로고    scopus 로고
    • Efficient conjunctive keyword search on encrypted data storage system, EuroPKI 2006
    • J.W.Byun, D.H.Lee, and J.I. Lim, Efficient conjunctive keyword search on encrypted data storage system, EuroPKI 2006, LNCS 4043 pp.184-196, 2006
    • (2006) LNCS , vol.4043 , pp. 184-196
    • Byun, J.W.1    Lee, D.H.2    Lim, J.I.3
  • 10
    • 0001114905 scopus 로고    scopus 로고
    • Faster approximate string matching
    • R. Baeza-Yates and G.Navarro, Faster approximate string matching, Algorithmica 23, pp. 127-158, 1999
    • (1999) Algorithmica , vol.23 , pp. 127-158
    • Baeza-Yates, R.1    Navarro, G.2
  • 11
    • 46749112844 scopus 로고    scopus 로고
    • D. Boneh, B. Waters, Conjunctive, Subset, and Range Queries on Encrypted Data, In the Proceedings of TCC 07, 2007.
    • D. Boneh, B. Waters, Conjunctive, Subset, and Range Queries on Encrypted Data, In the Proceedings of TCC 07, 2007.
  • 12
    • 0003701129 scopus 로고    scopus 로고
    • Private Information Retrieval by Keywords
    • Technical Report TR CS0917, 1997
    • B.Chor, N.Gilboa, M.Naor, Private Information Retrieval by Keywords, Technical Report TR CS0917, 1997
    • Chor, B.1    Gilboa, N.2    Naor, M.3
  • 14
    • 33847272670 scopus 로고    scopus 로고
    • The String Edit Distance Matching Problem With Moves
    • Article 2
    • G. Cornode and S. Muthukrishnan, The String Edit Distance Matching Problem With Moves, ACM Transactions on Algorithms, Vol. 3, No. 1, Article 2, 2007
    • (2007) ACM Transactions on Algorithms , vol.3 , Issue.1
    • Cornode, G.1    Muthukrishnan, S.2
  • 15
    • 46749138480 scopus 로고    scopus 로고
    • Processing Aggregation Queries over Encrypted Databases, ICDE 2006
    • Sun S.Chung and Gultekin Ozsoyoglu, Processing Aggregation Queries over Encrypted Databases, ICDE 2006, LNCS, 2006.
    • (2006) LNCS
    • Chung, S.S.1    Ozsoyoglu, G.2
  • 17
    • 84945300542 scopus 로고    scopus 로고
    • A Provably Secure Additive and Multiplicative Privacy Homomorphism, ISC
    • J. Domingo-Ferrer, A Provably Secure Additive and Multiplicative Privacy Homomorphism, ISC, LNCS 2433, pp. 471-483, 2002.
    • (2002) LNCS , vol.2433 , pp. 471-483
    • Domingo-Ferrer, J.1
  • 21
    • 24644498674 scopus 로고    scopus 로고
    • H. Hacigumus, B. Iyer, and S. Mehrotra, Query Optimization in Encrypted Database Systems, DASFAA 2005, LNCS 3453, pp. 43.55, 2005.
    • H. Hacigumus, B. Iyer, and S. Mehrotra, Query Optimization in Encrypted Database Systems, DASFAA 2005, LNCS 3453, pp. 43.55, 2005.
  • 23
    • 33745623486 scopus 로고    scopus 로고
    • Execution of Aggregation Queries over Encrypted Relational Databases, DASFAA2004
    • H.Hacigumus, B.Iyer, and S.MehrotraEfficient, Execution of Aggregation Queries over Encrypted Relational Databases, DASFAA2004, LNCS 2793, pp.125-136, 2004
    • (2004) LNCS , vol.2793 , pp. 125-136
    • Hacigumus, H.1    Iyer, B.2    MehrotraEfficient, S.3
  • 24
    • 84881357010 scopus 로고    scopus 로고
    • Aggregation Queries in the Database-As-a-Service Model
    • In the
    • Einar Mykletun and Gene Tsudik, Aggregation Queries in the Database-As-a-Service Model, In the proceedings of DBSEC 2006.
    • (2006) proceedings of DBSEC
    • Mykletun, E.1    Tsudik, G.2
  • 25
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • G.Navarro, A guided tour to approximate string matching. ACM Computing Surveys 33(1), pp. 31-88, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 27
    • 1942420748 scopus 로고    scopus 로고
    • Ogata and K. Kurosawa, Oblivious Keyword Search, Journal of Complexity, 20, pp.356 - 371, 2004
    • Ogata and K. Kurosawa, Oblivious Keyword Search, Journal of Complexity, Volume 20, pp.356 - 371, 2004
  • 28
    • 46749088481 scopus 로고    scopus 로고
    • G.Ozsoyoglu, D.Singer, S.Chung , Anti-Tamper Databases: Querying Encrypted Databases, In the Proceedings of IFIP 11.3 Conference 2003 on Database Security, August 3-6.
    • G.Ozsoyoglu, D.Singer, S.Chung , Anti-Tamper Databases: Querying Encrypted Databases, In the Proceedings of IFIP 11.3 Conference 2003 on Database Security, August 3-6.
  • 30
    • 23944469009 scopus 로고    scopus 로고
    • D.Park, K.Kim, and P.Lee, Public Key Encryption with Conjunctive Field Keyword. Search, WISA 2004, LNCS 3325, pp.73-86, 2004
    • D.Park, K.Kim, and P.Lee, Public Key Encryption with Conjunctive Field Keyword. Search, WISA 2004, LNCS 3325, pp.73-86, 2004
  • 31
    • 33744903955 scopus 로고    scopus 로고
    • H.S.Rhee, J.W.Byun, and D.H.Lee, Oblivious Conjunctive Keyword Search, WISA2005, LNCS3886, pp.318-327, 2006
    • H.S.Rhee, J.W.Byun, and D.H.Lee, Oblivious Conjunctive Keyword Search, WISA2005, LNCS3886, pp.318-327, 2006
  • 32
    • 51349153967 scopus 로고    scopus 로고
    • Office of the Information and Privacy Commissioner (IPC) and Netherlands Registratiekamer
    • Information and Privacy Commissioner and Registratiekamer, at
    • Ontario, Office of the Information and Privacy Commissioner (IPC) and Netherlands Registratiekamer (1995), Privacy-Enhancing Technologies: The Path to Anonymity, Information and Privacy Commissioner and Registratiekamer, at: http://www.ipc.on.ca/english/pubpres/papers/anon-e.htm
    • Privacy-Enhancing Technologies: The Path to Anonymity
    • Ontario1
  • 35
    • 46749103891 scopus 로고    scopus 로고
    • A. Takasu, An Approximate Multi-word Matching Algorithm for Robust Document Retrieval, CIKM06, ACM 1-59593-433-2/06/0011, 2006
    • A. Takasu, An Approximate Multi-word Matching Algorithm for Robust Document Retrieval, CIKM06, ACM 1-59593-433-2/06/0011, 2006
  • 37
    • 46749121213 scopus 로고    scopus 로고
    • know/Strings. shtml, Distance Between Strings
    • know/Strings. shtml, Distance Between Strings


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