Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Enabling Semantic Search based on ConceptualGraphs over Encrypted Outsourced Data
Department of Computer and Software, Nanjing University of Information Science and Technology.
Department of Computer and Software, Nanjing University of Information Science and Technology.
Department of Computer and Software, Nanjing University of Information Science and Technology.
Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.ORCID-id: 0000-0003-1902-9877
2019 (engelsk)Inngår i: IEEE Transactions on Services Computing, ISSN 1939-1374, E-ISSN 1939-1374Artikkel i tidsskrift (Fagfellevurdert) Epub ahead of print
Abstract [en]

Currently, searchable encryption is a hot topic in the field of cloud computing. The existing achievements are mainly focused on keyword-based search schemes, and almost all of them depend on predefined keywords extracted in the phases of index construction and query. However, keyword-based search schemes ignore the semantic representation information of users’ retrieval and cannot completely match users’ search intention. Therefore, how to design a content-based search scheme and make semantic search more effective and context-aware is a difficult challenge. In this paper, for the first time, we define and solve the problems of semantic search based on conceptual graphs(CGs) over encrypted outsourced data in clouding computing (SSCG).We firstly employ the efficient measure of ”sentence scoring” in text summarization and Tregex to extract the most important and simplified topic sentences from documents. We then convert these simplified sentences into CGs. To perform quantitative calculation of CGs, we design a new method that can map CGs to vectors. Next, we rank the returned results based on ”text summarization score”. Furthermore, we propose a basic idea for SSCG and give a significantly improved scheme to satisfy the security guarantee of searchable symmetric encryption (SSE). Finally, we choose a real-world dataset – ie., the CNN dataset to test our scheme. The results obtained from the experiment show the effectiveness of our proposed scheme.

sted, utgiver, år, opplag, sider
IEEE, 2019.
Emneord [en]
Searchable encryption, cloud computing, ranked search, semantic search, conceptual graphs
HSV kategori
Forskningsprogram
Distribuerade datorsystem
Identifikatorer
URN: urn:nbn:se:ltu:diva-62874DOI: 10.1109/TSC.2016.2622697OAI: oai:DiVA.org:ltu-62874DiVA, id: diva2:1086812
Tilgjengelig fra: 2017-04-04 Laget: 2017-04-04 Sist oppdatert: 2019-03-18

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Vasilakos, Athanasios

Søk i DiVA

Av forfatter/redaktør
Vasilakos, Athanasios
Av organisasjonen
I samme tidsskrift
IEEE Transactions on Services Computing

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 18 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf