<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01684354</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T06:19:51+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Searchable Encryption to Reduce Encryption Degradation in Adjustably Encrypted Databases</title>
            <author role="aut">
              <persName>
                <forename type="first">Florian</forename>
                <surname>Kerschbaum</surname>
              </persName>
              <email type="md5">b056c562df6f0542c84dc11e2b2aacde</email>
              <email type="domain">uwaterloo.ca</email>
              <idno type="idhal" notation="numeric">1026623</idno>
              <idno type="halauthorid" notation="string">950409-1026623</idno>
              <affiliation ref="#struct-301081"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Martin</forename>
                <surname>Härterich</surname>
              </persName>
              <email type="md5">a39f757ebf724a98dfaabec4983ed493</email>
              <email type="domain">sap.com</email>
              <idno type="idhal" notation="numeric">1026624</idno>
              <idno type="halauthorid" notation="string">1149604-1026624</idno>
              <affiliation ref="#struct-457294"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-01-15 14:07:14</date>
              <date type="whenModified">2018-01-15 14:11:13</date>
              <date type="whenReleased">2018-01-15 14:11:13</date>
              <date type="whenProduced">2017-07-19</date>
              <date type="whenEndEmbargoed">2020-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01684354v1/document">
                <date notBefore="2020-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01684354v1/file/453481_1_En_18_Chapter.pdf" id="file-1684354-1724579">
                <date notBefore="2020-01-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01684354</idno>
            <idno type="halUri">https://inria.hal.science/hal-01684354</idno>
            <idno type="halBibtex">kerschbaum:hal-01684354</idno>
            <idno type="halRefHtml">&lt;i&gt;31th IFIP Annual Conference on Data and Applications Security and Privacy (DBSEC)&lt;/i&gt;, Jul 2017, Philadelphia, PA, United States. pp.325-336, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-61176-1_18"&gt;&amp;#x27E8;10.1007/978-3-319-61176-1_18&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">31th IFIP Annual Conference on Data and Applications Security and Privacy (DBSEC), Jul 2017, Philadelphia, PA, United States. pp.325-336, &amp;#x27E8;10.1007/978-3-319-61176-1_18&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1684354-1724579"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-TC11" corresp="IFIP-TC">IFIP TC11: Security and Privacy Protection in Information Processing Systems</idno>
            <idno type="stamp" n="IFIP-WG11-3" corresp="IFIP-WG">WG 11.3: Data and Application Security and Privacy</idno>
            <idno type="stamp" n="IFIP-DBSEC" corresp="IFIP">DBSec: Data and Applications Security</idno>
            <idno type="stamp" n="IFIP-LNCS-10359" corresp="IFIP-LNCS">Data and Applications Security and Privacy XXXI</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 3: Cloud Security</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Searchable Encryption to Reduce Encryption Degradation in Adjustably Encrypted Databases</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Florian</forename>
                    <surname>Kerschbaum</surname>
                  </persName>
                  <email type="md5">b056c562df6f0542c84dc11e2b2aacde</email>
                  <email type="domain">uwaterloo.ca</email>
                  <idno type="idhal" notation="numeric">1026623</idno>
                  <idno type="halauthorid" notation="string">950409-1026623</idno>
                  <affiliation ref="#struct-301081"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Martin</forename>
                    <surname>Härterich</surname>
                  </persName>
                  <email type="md5">a39f757ebf724a98dfaabec4983ed493</email>
                  <email type="domain">sap.com</email>
                  <idno type="idhal" notation="numeric">1026624</idno>
                  <idno type="halauthorid" notation="string">1149604-1026624</idno>
                  <affiliation ref="#struct-457294"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>31th IFIP Annual Conference on Data and Applications Security and Privacy (DBSEC)</title>
                  <date type="start">2017-07-19</date>
                  <date type="end">2017-07-21</date>
                  <settlement>Philadelphia, PA</settlement>
                  <country key="US">United States</country>
                </meeting>
                <editor>Giovanni Livraga</editor>
                <editor>Sencun Zhu</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Data and Applications Security and Privacy XXXI</biblScope>
                  <biblScope unit="volume">LNCS-10359</biblScope>
                  <biblScope unit="pp">325-336</biblScope>
                  <date type="datePub">2017</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-61176-1_18</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Processing queries on encrypted data protects sensitive data stored in cloud databases. CryptDB has introduced the approach of adjustable encryption for such processing. A database column is adjusted to the necessary level of encryption, e.g. order-preserving, for the set of executed queries, but never reversed. This has the drawback that long running cloud databases will eventually transform into only order-preserving encrypted databases. In this paper we propose searchable encryption as an alternative in order to reduce this encryption degradation. It maintains security while only marginally impacting performance when applied only to infrequently used queries for searching. We present a budget-based encryption selection algorithm as part of query planning for making the appropriate choice between searchable and deterministic or order-preserving encryption. We evaluate our algorithm on a long-tail distributed TPC-C benchmark on an experimental implementation of encrypted queries in an in-memory database. In one choice of parameters our algorithm incurs only a $$1.5\%$$ performance penalty, but one of 15 columns is not decrypted to order-preserving or deterministic encryption. Our selection algorithm is configurable, such that higher security gains are possible at the cost of performance.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 11</org>
              <org type="consortium">WG 11.3</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-301081" status="VALID">
          <orgName>University of Waterloo [Waterloo]</orgName>
          <desc>
            <address>
              <addrLine>200 University Avenue West, Waterloo, ON, Canada  N2L 3G1</addrLine>
              <country key="CA"/>
            </address>
            <ref type="url">https://uwaterloo.ca</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-457294" status="VALID">
          <orgName>SAP AG [Germany]</orgName>
          <desc>
            <address>
              <addrLine>Bleichstr. 8 Darmstadt Germany</addrLine>
              <country key="DE"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>