<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01418nam a2200169 a 4500</leader>
  <controlfield tag="005">20260901030336.0</controlfield>
  <controlfield tag="008">250101s2019    xx     o     000 0 eng d</controlfield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Jinkun Cao</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">A Novel Fuzzy Search Approach over Encrypted Data with Improved Accuracy and Efficiency</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="b">arXiv</subfield>
    <subfield code="c">2019</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">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</subfield>
  </datafield>
  <datafield tag="506" ind1="0" ind2=" ">
    <subfield code="a">Open access &#x2014; freely available to read.</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://arxiv.org/pdf/1904.12111v2</subfield>
    <subfield code="y">Read the full paper (PDF)</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">ERES</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">654</subfield>
    <subfield code="d">654</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">3</subfield>
    <subfield code="8">CYB</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">SCICOMP</subfield>
    <subfield code="d">2026-09-01</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">YGE000915</subfield>
    <subfield code="r">2026-09-01 03:03:37</subfield>
    <subfield code="u">https://arxiv.org/pdf/1904.12111v2</subfield>
    <subfield code="w">2026-09-01</subfield>
    <subfield code="y">PAPER</subfield>
  </datafield>
</record>
