<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-015-15-3019</article-id>
      <article-id pub-id-type="publisher-id">29534</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>C.4 - PERFORMANCE OF SYSTEMS</subject>
          <subject>H.3 - INFORMATION STORAGE AND RETRIEVAL</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Optimizations for Risk-Aware Secure Supply Chain Master Planning</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Schröpfer</surname>
            <given-names>Axel</given-names>
          </name>
          <email xlink:type="simple">axel.schroepfer@sap.com</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Kerschbaum</surname>
            <given-names>Florian</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Schütz</surname>
            <given-names>Christoph</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Pibernik</surname>
            <given-names>Richard</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">SAP Research Karlsruhe, Karlsruhe, Germany</addr-line>
        <institution>SAP Research Karlsruhe</institution>
        <addr-line content-type="city">Karlsruhe</addr-line>
        <country>Germany</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">EBS Wiesbaden, Wiesbaden, Germany</addr-line>
        <institution>EBS Wiesbaden</institution>
        <addr-line content-type="city">Wiesbaden</addr-line>
        <country>Germany</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Axel Schröpfer (<email xlink:type="simple">axel.schroepfer@sap.com</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2009</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>09</month>
        <year>2009</year>
      </pub-date>
      <volume>15</volume>
      <issue>15</issue>
      <fpage>3019</fpage>
      <lpage>3037</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/EDF06955-AA82-5AFC-A64A-089FE93FC7CE">EDF06955-AA82-5AFC-A64A-089FE93FC7CE</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/7000987">7000987</uri>
      <permissions>
        <copyright-statement>Axel Schröpfer, Florian Kerschbaum, Christoph Schütz, Richard Pibernik</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Supply chain master planning strives for optimally aligned production, warehousing and transportation decisions across a multiple number of partners. Its execution in practice is limited by business partners' reluctance to share their vital business data. Secure Multi-Party Computation (SMC) can be used to make such collaborative computations privacy-preserving by applying cryptographic techniques. Thus, computation becomes acceptable in practice, but the performance of SMC remains critical for real world-sized problems. We assess the disclosure risk of the input and output data and then apply a protection level appropriate for the risk under the assumption that SMC at lower protection levels can be performed faster. This speeds up the secure computation and enables significant improvements in the supply chain.</p>
      </abstract>
    </article-meta>
  </front>
</article>
