<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>A Novel Fuzzy Search Approach over Encrypted Data with Improved Accuracy and Efficiency</title>
  </titleInfo>
  <name type="personal">
    <namePart>Jinkun Cao</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">xx</placeTerm>
    </place>
    <dateIssued encoding="marc">2019</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">ng </languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
  </physicalDescription>
  <abstract>As cloud computing becomes prevalent in recent years, more and more enterprises and individuals outsource their data to cloud servers. To avoid privacy leaks, outsourced data usually is encrypted before being sent to cloud servers, which disables traditional search schemes for plain text. To meet both end of security and searchability, search-supported encryption is proposed. However, many previous schemes suffer severe vulnerability when typos and semantic diversity exist in query requests. To overcome such flaw, higher error-tolerance is always expected for search-supported encryption design, sometimes defined as 'fuzzy search'. In this paper, we propose a new scheme of multi-keyword fuzzy search over encrypted and outsourced data. Our approach introduces a new mechanism to map a natural language expression into a word-vector space. Compared with previous approaches, our design shows h</abstract>
  <note>Open access — freely available to read.</note>
  <identifier type="uri">https://arxiv.org/pdf/1904.12111v2</identifier>
  <location>
    <url displayLabel="Read the full paper (PDF)">https://arxiv.org/pdf/1904.12111v2</url>
  </location>
  <accessCondition type="restrictionOnAccess">Open access — freely available to read.</accessCondition>
  <recordInfo>
    <recordCreationDate encoding="marc">250101</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260901030336.0</recordChangeDate>
  </recordInfo>
</mods>
