<?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-01490715</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-18T20:08:37+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Database Fragmentation with Encryption: Under Which Semantic Constraints and A Priori Knowledge Can Two Keep a Secret?</title>
            <author role="aut">
              <persName>
                <forename type="first">Joachim</forename>
                <surname>Biskup</surname>
              </persName>
              <email type="md5">8ea5513f5d8e095fb94cc273eed04e4b</email>
              <email type="domain">ls6.cs.tu-dortmund.de</email>
              <idno type="idhal" notation="numeric">1004162</idno>
              <idno type="halauthorid" notation="string">854841-1004162</idno>
              <affiliation ref="#struct-133089"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Marcel</forename>
                <surname>Preuss</surname>
              </persName>
              <email type="md5">28cb3a902e1bdaf389e1d2280b0e719c</email>
              <email type="domain">ls6.cs.tu-dortmund.de</email>
              <idno type="idhal" notation="numeric">1004163</idno>
              <idno type="halauthorid" notation="string">1149623-1004163</idno>
              <affiliation ref="#struct-133089"/>
            </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">2017-03-15 17:16:15</date>
              <date type="whenModified">2026-04-13 09:42:02</date>
              <date type="whenReleased">2017-03-16 09:24:24</date>
              <date type="whenProduced">2013-07-15</date>
              <date type="whenEndEmbargoed">2016-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01490715v1/document">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01490715v1/file/978-3-642-39256-6_2_Chapter.pdf" id="file-1490715-1555038">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-39256-6_2.pdf"/>
            </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-01490715</idno>
            <idno type="halUri">https://inria.hal.science/hal-01490715</idno>
            <idno type="halBibtex">biskup:hal-01490715</idno>
            <idno type="halRefHtml">&lt;i&gt;27th Data and Applications Security and Privacy (DBSec)&lt;/i&gt;, Jul 2013, Newark, NJ, United States. pp.17-32, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-39256-6_2"&gt;&amp;#x27E8;10.1007/978-3-642-39256-6_2&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">27th Data and Applications Security and Privacy (DBSec), Jul 2013, Newark, NJ, United States. pp.17-32, &amp;#x27E8;10.1007/978-3-642-39256-6_2&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1490715-1555038"/></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-7964" corresp="IFIP-LNCS">Data and Applications Security and Privacy XXVII</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 1: Privacy I</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">Database Fragmentation with Encryption: Under Which Semantic Constraints and A Priori Knowledge Can Two Keep a Secret?</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Joachim</forename>
                    <surname>Biskup</surname>
                  </persName>
                  <email type="md5">8ea5513f5d8e095fb94cc273eed04e4b</email>
                  <email type="domain">ls6.cs.tu-dortmund.de</email>
                  <idno type="idhal" notation="numeric">1004162</idno>
                  <idno type="halauthorid" notation="string">854841-1004162</idno>
                  <affiliation ref="#struct-133089"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Marcel</forename>
                    <surname>Preuss</surname>
                  </persName>
                  <email type="md5">28cb3a902e1bdaf389e1d2280b0e719c</email>
                  <email type="domain">ls6.cs.tu-dortmund.de</email>
                  <idno type="idhal" notation="numeric">1004163</idno>
                  <idno type="halauthorid" notation="string">1149623-1004163</idno>
                  <affiliation ref="#struct-133089"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>27th Data and Applications Security and Privacy (DBSec)</title>
                  <date type="start">2013-07-15</date>
                  <date type="end">2013-07-17</date>
                  <settlement>Newark, NJ</settlement>
                  <country key="US">United States</country>
                </meeting>
                <editor>Lingyu Wang</editor>
                <editor>Basit Shafiq</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Data and Applications Security and Privacy XXVII</biblScope>
                  <biblScope unit="volume">LNCS-7964</biblScope>
                  <biblScope unit="pp">17-32</biblScope>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-39256-6_2</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Semi-Honest Server</term>
                <term xml:lang="en">Outsourcing</term>
                <term xml:lang="en">Logic</term>
                <term xml:lang="en">Inference-Proofness</term>
                <term xml:lang="en">Fragmentation</term>
                <term xml:lang="en">Confidentiality Constraint</term>
                <term xml:lang="en">A Priori Knowledge</term>
              </keywords>
              <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>Database outsourcing to semi-honest servers raises concerns against the confidentiality of sensitive information. To hide such information, an existing approach splits data among two supposedly mutually isolated servers by means of fragmentation and encryption. This approach is modelled logic-orientedly and then proved to be confidentiality preserving, even if an attacker employs some restricted but nevertheless versatile class of a priori knowledge to draw inferences. Finally, a method to compute a secure fragmentation schema is developed.</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-133089" status="VALID">
          <idno type="ROR">https://ror.org/01k97gp34</idno>
          <orgName>Technische Universität Dortmund = TU Dortmund University</orgName>
          <orgName type="acronym">TU</orgName>
          <desc>
            <address>
              <addrLine>August-Schmidt-Straße 1, 44227 Dortmund</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://www.tu-dortmund.de/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>