<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>M. Sellami);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Interaction Patterns for Regulatory Compliance in Federated Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mahdi Sellami</string-name>
          <email>sellami@fortiss.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tomas Bueno Momčilović</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Peter Kuhn</string-name>
          <email>kuhn@fortiss.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dian Balta</string-name>
          <email>balta@fortiss.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>fortiss GmbH</institution>
          ,
          <addr-line>Guerickestraße 25, Munich</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>Organizations in highly regulated domains often struggle to build well-performing machine learning (ML) models due to restrictions from data protection regulation. Federated learning (FL) has recently been introduced as a potential remedy, whereby organizations share local models while keeping data on premise. Still, regulatory compliance remains challenging in FL settings: training data needs to be shared to some extent, and models can be reverse engineered or misused towards violation of data privacy by each participating organization. Guided by design science methodology, we introduce four interaction patterns that allow for compliance-by-design and trust-context-sensitive analysis of an FL system by combining different approaches to privacy preservation. We match the patterns to privacy principles and exemplify how verifiable claims about compliance at design- and operation-time FL can be generated to make all participating organizations accountable.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Federated Learning</kwd>
        <kwd>Privacy</kwd>
        <kwd>Compliance</kwd>
        <kwd>Design Patterns 1</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Organizations in highly regulated domains, such as the government, health or banking, explore
applications of machine learning (ML) with high intensity to gain efficiency, effectiveness, and a
competitive edge (cf. e.g., [
        <xref ref-type="bibr" rid="ref1 ref2">1-2</xref>
        ]). Unfortunately, they often struggle with having a sufficient
amount of data [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. This insufficiency of data is often the leading cause of underperforming
models of ML [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], thereby undermining the value proposition.
      </p>
      <p>
        One remedy is to federate the learning process between different organizations and their data,
in order to train a common (and higher quality) model that benefits the knowledge of all parties
involved (cf. e.g., [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]). A prerequisite for such an approach is that the parties have to share some
of the data or at least model training parameters. This is not an easy task, given strong regulatory
constraints resulting from e.g., GDPR, HIPAA, and similar (cf. e.g., [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]). Implementing federated
learning (FL) would mean that they have to be compliant, i.e. that 1) they have a corresponding,
suitable design that complies with regulation; and 2) they operate according to it. While
compliance needs to be upheld throughout the whole process of setting up the federation, model
training and processing, an approach is required to design corresponding information systems
(IS) that hold every participating organization accountable to preservation of privacy in every
stage of ML.
      </p>
      <p>In this paper, we address the following question: How to design an architecture for accountable
privacy-preserving data sharing in the entire ML process? We propose interaction patterns for
the architecture design of IS involved in inter-organizational ML with a focus on the level of trust
between organizations. In terms of implications, the patterns lay the ground for (1) an academic
discussion in mapping legal regulation requirements to technology, and (2) a practical guideline
for designing such systems. In order to evaluate the patterns, we present a prototypical
implementation and discuss how one can make and prove claims of what was designed and
promised.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <sec id="sec-2-1">
        <title>2.1. Federated Learning</title>
        <p>
          Federated learning (FL) is a novel machine learning (ML) method that allows a set of distributed
parties to jointly train a shared model while keeping their data on premise. The FL process
involves an aggregator who provides specifications for applying an ML model, sends them to the
parties to train the model on their own private data, and then combines the information from
many different local models using an algorithm for aggregating training parameters [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. The most
common approach relies on a client-server or star network [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] comprising the Federated
Averaging algorithm proposed by [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], where a central server orchestrates the contributions of
clients (participants such as organizations or edge devices).
        </p>
        <p>
          FL system designs vary in six main aspects [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]: 1. data partitioning (horizontal vs. vertical), 2.
ML model, 3. scale of federation (cross-silo vs. cross-device), 4. communication architecture
(centralized vs. decentralized), 5. privacy mechanism, and 6. motivation. To illustrate our results,
we limit our scope to: 1. horizontal data partitioning; 2. neural network; 3. cross-silo scale; 4.
centralized communication; 5. no privacy mechanism beyond the learning pipeline; and 6. a
motivation for federation primarily driven by the need to comply with data protection regulation.
Furthermore, we consider that the FL process contains four stages [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]: setup to specify the data,
purpose of collaboration, and the ML pipeline; preprocessing to prepare the training data of each
participant; processing, to optimize the model iteratively; and optional postprocessing for
applying a privacy-enhancing technique, mitigate bias and similar.
        </p>
        <p>
          With regard to compliance, privacy mechanisms are of particular importance. Even though
each party’s data remains on-premise during training, attackers may still extract sensitive
information from the exchanged model updates. Several attacks including membership inference
attacks [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] and model inversion attacks [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] can lead to data leakage. Thus, different privacy
techniques (e.g., differential privacy [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]; cryptographic methods [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]) and trusted execution
environments [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] can be independently combined with FL to provide stronger privacy
guarantees. The motivation for FL is also an important compliance requirement in real-world
scenarios, ensuring the involvement of participating parties. This motivation is based on
regulations, incentives, or a combination of both. Applying FL within an organization (e.g.,
governments, companies, etc.) is generally driven by a need to comply with regulation [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Compliance based on accountability and verifiable claims</title>
        <p>
          Interpreting and complying with legal requirements is a resource-intensive problem [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
Accountability helps to address this challenge in FL setups. Implying different domains and
stakeholders [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], accountability has been introduced in the 1960s as an important design
principle for systems [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], with different operationalizations emerging throughout the decades
since (e.g., “code is law”; [
          <xref ref-type="bibr" rid="ref17 ref18">17-18</xref>
          ]).
        </p>
        <p>
          In this work, we consider accountability as a mechanism for enabling trust and legal
compliance in FL systems. We adopt a definition that is applicable to distributed systems [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], i.e.
“the transparent assignment and ownership of responsibilities (…) enabling [the distribution of]
business goals across multiple organizations.” We tackle accountability from an engineering
perspective by introducing verifiable claims to FL systems, aiming to-wards trustworthy AI
development [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] by emphasizing the following dimensions [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]:

        </p>
        <p>Verifiable: Every step of the learning process must be documented by specific claims.
Each claim should be transparent and supported by evidence, that the corresponding step
was conducted correctly with respect to a predefined specification.</p>
        <p>Undeniable consent: The executed learning process must be aligned with the
expectations of all participants, who must give their explicit consent to the specification
of the process. Furthermore, the execution of the process should be non-repudiable and
provable.</p>
        <p>Auditable: Any deviation from the specification (e.g., system attacks) must be detectable
and provable by any third party, based on the recorded claims and their corresponding
evidence.</p>
        <p>Tamper-evident: All the interactions between the participants must have a
corresponding record according to a predefined specification. Furthermore, any intended
corruption of the shared knowledge of the participants should be detectable.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Data Protection and Privacy Principles</title>
        <p>
          Privacy-related regulatory requirements in the EU center almost exclusively on the General Data
Protection Regulation (GDPR; [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]), which came into force in 2016 and repealed an earlier
framework from 1995. The draft EU Act on Artificial Intelligence [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] directly refers to the GDPR
for all privacy-related requirements in AI systems development and deployment (Sec. 3 Sub. 2
Art. 10 Para. 5), and so do national laws (e.g., German Federal Data Protection Act; [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]) that
harmonize (i.e., adapt) the stipulations to the national context.
        </p>
        <p>GDPR is concerned with the protection of personal data, i.e., “any information relating to an
identified or identifiable natural person” (Art. 4 Paragraph 1). It comprises six core privacy
principles in Article 5. Lawfulness, fairness, and transparency refers to obtaining consent
from the data subject and defining the legitimate reason for processing personal data. Purpose
limitation refers to specifying explicit and unexceedable boundaries for processing data,
whereas data minimization refers to explicit and unexceedable boundaries for collecting data.
Accuracy refers to keeping data up-to-date and rectifying deviations, and storage limitation
refers to specifying an explicit time limit when storing collected data. Integrity and
confidentiality represent security “using appropriate technical or organizational measures.”
Finally, the point on accountability designates the data controller as responsible for ensuring
compliance with the six principles.</p>
        <p>
          These principles in GDPR correspond to a widely accepted set of best privacy practices. Legal
scholars [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] provide seven overarching principles, of which six directly map to GDPR: respect
for context with purpose limitation; consent, legitimacy and transparency with lawfulness,
fairness and transparency; transparency with accuracy; proportionality with data minimization;
and accountability with its GDPR counterpart. The unique principle that remains is privacy by
design – a requirement to address data privacy concerns in the initial design stages and
throughout the whole lifecycle of products, processes, and services, which is compatible with the
notion of data protection by design in GDPR (Art. 25 paragraph 1, GDPR). Thus, a set of eight
principles comprises the privacy requirements from the regulatory standpoint.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Research Approach: Pattern-based Design Research</title>
      <p>
        We follow the pattern-based design research (PDR) method [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] to specify reusable patterns for
privacy-preserving interactions between at least two parties who want to share knowledge, but
not their private data. Patterns are “best practices that are bound to a specific context in which
the provided solution has been proven to work” (p. 75, [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]); they represent empirically founded
models that are defined in iterations between theory and practice.
      </p>
      <p>
        Interaction patterns is a term we propose to describe an approach in information systems
research for modelling a controlled sequence of information flow between parties with
predefined roles (see, e.g., [
        <xref ref-type="bibr" rid="ref26 ref27">26-27</xref>
        ]). Interaction refers to an exchange of information between
two or more parties for the purpose of achieving a common goal, whereas interaction patterns
are design patterns which describe recurring interactions. These interactions correspond to the
following simplified scenario of interest. The data processor wants to use the private data of the
data provider for some computation: e.g., data aggregation or pattern recognition. The data
provider wants to make sure its private data is protected and correctly handled (e.g., that there
is no data leakage).
      </p>
      <p>
        The process of PDR comprises four stages [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. First, input is collected from an existing
scientific foundation or practical observations. Second, this input is used to generate pattern
candidates, their description language, and/or the design theories to support the design
activities. Third, pattern candidates are instantiated as tangible solutions to practical problems,
and these instances may deviate from each other based on the context they are applied in. Finally,
these deviations are evaluated and used as further input to refine existing candidates or define
new patterns for the next cycle.
      </p>
      <p>
        We completed an entire cycle of the PDR method, finishing with new pattern candidates (see:
Figure 1). We compiled relevant ‘observations’ from a literature review: FL and classic ML
methods [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]; privacy enhancing techniques for ML tasks [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]; design science research, a discipline
for studying software architectures [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]; and accountability through verifiable claims [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. With
this input, we specified five initial pattern candidates, which reflect the general solutions that are
commonly applied to privacy-oriented problems (e.g., [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]).
      </p>
      <p>
        1. Right to erasure: One party shares its data with another party, under the expectation
that the latter will delete the data once the purpose for which it was shared no longer
exists (Article 17 paragraph 1, [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]).
2. (Trusted) Cloud services: A trusted entity hosts the data, performs the computation for
all parties, and then deletes the data [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ].
3. Classic FL: One party sends the model specifications to another party in the processing
stage, and aggregates the results from training [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
4. Differential privacy: Parties hide personal identifiable information with
typeappropriate noise that does not affect ML model results [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ].
5. Homomorphic encryption: Parties hide personal identifiable information by
transforming it into ciphertext without affecting ML model results [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ].
      </p>
      <p>
        Using privacy by design (i.e., privacy in all stages; [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]) and accountable FL (i.e., federation
that can be verified; IBM, [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]) as general guidelines, we created a blueprint of an “accountable
federated machine learning” (AFML) system. With it, we developed a prototype for conducting
experiments with three Bavarian municipalities – Munich, Augsburg, and Nuremberg.
      </p>
      <p>
        Input from the experiments and stakeholders helped us restructure the pattern candidates
into four patterns which we present below. First, we excluded differential privacy once we
determined that adding noise does not solve the trust problems between the parties themselves,
nor excludes the need for data erasure. Second, we added the precondition of secure
communication, as successful man-in-the-middle attacks invalidate any privacy claim. Third, we
abstracted away from specific implementations. Cloud services are an instance of a pattern of
delegating to a third party, and so is homomorphic encryption an instance of a pattern of isolating
information without affecting the results. The classical FL has been extended to also include
preand post-processing specification of computation. Right-to-erasure has become a data sharing
pattern, since according to [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], data providers can share data with other parties (e.g.,
processors), but must delete and enforce deletion of all relevant instances upon a user’s request.
In ML scenarios, this can involve running a resource-intensive process to “unlearn” (i.e., retrain)
any model to exclude the user’s data [41].
      </p>
      <p>
        We added four dimensions to distinguish patterns: the trust scenario, architectural model,
claim, and exemplary application. Trust scenarios (similar to threat models; cf. e.g., [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) describe
the trust between the parties, and the challenge that the pattern is addressing. The architectural
model is a diagram visualized in design science templates (4+1 view; UML), and contains the
systems, the actors, and their interactions. Claims are short texts describing the promised way of
private data handling, which can be linked with verifiable evidence. Finally, the exemplary
application provides the instance of the pattern in industry or research.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Interaction Patterns</title>
      <sec id="sec-4-1">
        <title>4.1. Patterns</title>
        <p>In this section, we introduce four interaction patterns as solutions for private data handling
issues: share data, specify computation, delegate and isolate. The visual structure in Figure 2
represents the minimal requirements for the interaction to be completed correctly, such as:
necessary actors (i.e., the data provider, the data processor and in one case, a third party),
technical components (i.e., modules for computation and a database of private data), and
sequential actions for the exchange and processing of data. The names of the patterns reflect the
overarching process taking place. Additionally, when implemented correctly, each pattern
generates a privacy claim against which we verify that the private data indeed remains private,
while maintaining the important assumption that parties have established secure
communication.</p>
        <p>The share data pattern relies on the provider trusting the processor to handle its data properly
(i.e., behaves in a trustworthy manner). This pattern is widely observed in highly regulated areas
like healthcare and government. In fact, since the introduction of the “right to erasure” or the
“right to be forgotten” in the GDPR, this pattern has been adopted by a variety of developers
whose applications depend on private data, or it is at least offered to the users as an option.</p>
        <p>The specify computation pattern also relies on trust. Here, the processor trusts the provider
(and its computation system) to execute the computation correctly: with the right data, in the
prearranged manner, and without tampering of results. This is exemplified in a classical FL
scenario. In the delegate pattern, by contrast, neither the provider nor the processor trust each
other, but they both trust a third party. This party can be any entity which is deemed trustworthy
enough to store and handle data securely, and execute computation steps. Put simply, the core
parties shift their trust to an intermediary.</p>
        <p>
          Finally, the isolate pattern requires the parties to trust the technology instead of one another.
Although this can solve concerns related to trust, it is the most complex and resource-intensive
approach. For example, homomorphic encryption [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ] allows the provider to encrypt its data
before sending it to the processor, who then performs the computation on ciphertext (i.e., the
encryption space). The resulting output, when decrypted, equals the output of the computation
in plaintext (i.e., original space). However, fully homomorphic encryption methods are still not
practical due to storage, configuration, and efficiency issues [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ].
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Deciding Criteria and Preconditions</title>
        <p>
          The additional outcome of refining pattern candidates has been a small framework for
decisionmaking. Namely, deciding on applicable patterns depends on three criteria and five
preconditions. Regarding criterions, first, the level of trust between parties is key. If the provider
and processor trust that the other has capability and intent to handle information accordingly,
then sharing the data or the model parameters is always a possibility. In other words, a simple
verifiable promise that the data will be deleted or the computation will be executed suffices.
Second, if either one or both parties are mistrustful, information sharing can still be
intermediated by a third party. Finally, if no third party is trusted or available, more
privacyprotective ‘trustless’ solutions are needed (cf. e.g., [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]). However, as Table 1 shows, introducing
complexity (such as homomorphic encryption) is only justifiable in the strictest cases, because
multiple options are available in less strict contexts [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>
          Regarding preconditions, first, neither party has both the necessary components (i.e.,
sufficient data and computation specifications) nor the capability (i.e., data collection or
processing capacity) to execute the process; thus, they have complementary roles [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Second,
vulnerabilities are substantial enough (e.g., personally identifiable information cannot be
anonymized without information loss) to prevent the parties from applying an easy solution.
Third, the expected value is high enough to incentivize parties to collaborate (e.g., generated
output is significantly more useful than the raw data itself; e.g., [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]). Fourth, expected costs of
non-compliance are high enough to disincentivize it (e.g., punishment under GDPR that can reach
up to 4% of revenue). Fifth and final, secure communication prevents man-in-the-middle attacks
but is itself insufficient for verifying privacy is protected.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Exemplary Application of the Interaction Patterns</title>
      <p>
        We evaluated the applicability of the interaction patterns during an FL project for German public
services. In collaboration with Munich, Augsburg and Nuremberg, we designed and configured a
system based on IBM FL [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] and used it to train a neural network for a multi-class text
classification task. The dataset encompasses textual user feedback on their experiences and
suggestions of using the German online public services as well as the usability rating in an ordinal
range from 0 to 5. In our work, we used the raw text as input for the model and the categories as
output (i.e., prediction). The municipalities are interested in collaborative training to
automatically forward future feedback to the department corresponding to the category, such
that, e.g., feedback about the user interface of the service is forwarded to the user experience (UX)
team. Since the free texts may contain sensitive information, and it is not possible to detect all
identifier entities (see, e.g.: [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ]), we used the interaction patterns to provide data privacy
guarantees.
      </p>
      <p>
        The setup stage included three workshops with the cities to define the learning task, select the
learning features of the data, and choose the architecture of the ML model. It is the only stage
where an exchange of sensitive data is not needed. We used a character-level convolutional neural
network as model architecture, inspired by the work of [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ] and conducted two main training
experiments. The first experiment was conducted on one municipality dataset to prove the
usability of ML and the model architecture, with the accuracy of the fine-tuned model reaching
77,8%. The second experiment involved the FL system to train the model with all three datasets
in a federated manner. The model’s accuracy improved to 93,8%, confirming the hypothesis that
sharing the data of the cities enhances the performance of the model.
      </p>
      <p>We applied the patterns in the preprocessing and training stages (cf. Table 2), as these stages
involved sensitive data. Postprocessing was not included, as the project did not require any
additional (e.g., robustness or fairness) checks. For preprocessing, we used the share data pattern
because at the time, the municipalities lacked the necessary expertise or resources to preprocess
their data. With the help of a contract and the verifiable claim that we will delete the data after
the goal is completed, we received the raw data from the municipalities as an upload to a secure
cloud. Preprocessing involved excluding the empty rows, cleaning the freetext from special
characters, and fixing the misspelled words, with the help of the pandas Python package.</p>
      <p>
        For the training, we applied the specify computation pattern. Taking the role of the aggregator,
we specified computations by providing a containerized application using Docker for three
municipalities to execute. The training of local models has been performed using the keras
interface of the tensorflow Python package and aggregated into a common model according to
steps in [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], using. Given the incomplete IT infrastructure at the time, we simulated the scenario
of FL: we ran the application containers and provided the preprocessed training data as input to
assure that the training is federated. In future training sessions, cities will have configured the IT
infrastructure.
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Discussion</title>
      <sec id="sec-6-1">
        <title>6.1. Evaluation</title>
        <p>Interaction patterns ideally help organizations pursue privacy-compliant ML. However, knowing
which interaction to set up is not enough to satisfy the proposed principles (cf. Section 2.3). The
table below evaluates whether a pattern satisfies a principle automatically or needs an additional
mechanism to do so. Such mechanisms include internal policies within an organization with
penalties for non-compliance; legally enforceable contracts for external entities; or other
unspecified mechanisms. Since data providers are ultimately accountable, the onus is on them to
set and enforce mechanisms.</p>
        <p>
          In the principle of lawful processing, if consent for data collection from users is not obtained
(Article 18 paragraph 1 point (a), [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]), or the reason for processing is not considered legitimate,
patterns cannot help. In our case, legitimacy lies in “the performance of a task carried out in the
public interest” (Article 18 paragraph 1 point I, [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]), which was already present before our
involvement. The legality of the ML application is an implicit precondition for which provider is
ultimately accountable.
        </p>
        <p>Purpose and data limitation show that limits are easier to enforce when data remains on-site.
Specify computation pattern requires a policy to ensure that the dataset is filtered beforehand,
and that the computation parameters do not exceed the predefined purpose. When data is
forwarded off-site, the provider can ensure that it has been filtered, but otherwise only enforce
compliance with a contract. By contrast, the isolate pattern (when instantiated as homomorphic
encryption) automatically ensures that an honest-but-curious, infected, or malicious processor
cannot see the output, infer what the input consists of, or stretch the processing beyond the
predefined purpose.</p>
        <p>Principles</p>
        <sec id="sec-6-1-1">
          <title>Purpose limitation</title>
        </sec>
        <sec id="sec-6-1-2">
          <title>Data minimization</title>
        </sec>
        <sec id="sec-6-1-3">
          <title>Accuracy</title>
        </sec>
        <sec id="sec-6-1-4">
          <title>Storage limitation</title>
        </sec>
        <sec id="sec-6-1-5">
          <title>Accountability</title>
        </sec>
        <sec id="sec-6-1-6">
          <title>Privacy by design</title>
          <p>Patterns
share
data
contract</p>
          <p>policy
contract
contract
contract
contract
Lawful processing
not enough
not enough
not enough</p>
          <p>not enough
specify
computation
delegate</p>
          <p>isolate
policy
policy
policy
policy
policy
automatic
contract</p>
          <p>policy
contract
contract
contract
contract
automatic
automatic
policy
policy
policy
automatic</p>
          <p>
            Accuracy and storage limitation deal with data maintenance, which are not directly addressed
by interaction patterns. Instead, the data provider must have policies for repairing
inconsistencies and deleting data after the allotted time. Integrity and confidentiality require
more intensive data protection, which is only partly achieved by secure communication.
Retaining the data on-site lowers the security risk from external attacks, but the provider can still
be vulnerable to reconstruction attacks from an honest-but-curious or malicious processor – i.e.,
reconstructions of raw data points from model parameters or aggregate information [
            <xref ref-type="bibr" rid="ref31">31</xref>
            ]. As the
processor is also at risk of being infected or having its results exploited, a risk assessment would
be needed to determine vulnerability to such scenarios, and the selection of mechanisms that
would guarantee privacy alongside the appropriate interaction pattern (e.g., differential privacy;
[
            <xref ref-type="bibr" rid="ref31">31</xref>
            ]). If the collected data is immediately isolated, however, the only security measure that is
needed is the protection of private keys.
          </p>
          <p>
            Finally, privacy by design can be interpreted in two ways. Using a relaxed interpretation, a
provider who demonstrates a conscious and institutionalized concern for protecting private data
through pattern selection would be compliant, even when such protection cannot be easily
operationalized in technical terms [
            <xref ref-type="bibr" rid="ref37">37</xref>
            ]. A stricter interpretation could only certify patterns in
which the raw data does not leave the premises, or where more extensive protection exists. Thus,
using only share data or delegate patterns without contracts or additional mechanisms would
violate the “proactive, not reactive, preventative not remedial” foundation of the principle (p. 5,
[
            <xref ref-type="bibr" rid="ref38">38</xref>
            ]). We assess our patterns in line with the stricter approach.
          </p>
        </sec>
      </sec>
      <sec id="sec-6-2">
        <title>6.2. Connections with Related Work</title>
        <p>
          Work connecting privacy, architecture design, and data processing provides two premises to
support the use of interaction patterns. First premise is a need for operationalizing
privacyoriented legalese into technically legible steps, and documenting interactions. [
          <xref ref-type="bibr" rid="ref39">39-40</xref>
          ] uses
privacy engineering methods, empirical validation and PDR to translate GDPR articles into a
process model named Protection of Personal Data (ProPerData), sketching out an exemplary
pattern candidate for documenting interactions. [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] conclude that despite attempts to satisfy
GDPR requirements with privacy-enhancing techniques (e.g., homomorphic encryption or secure
multiparty computation), the gap in processor-provider interactions can only be solved by having
rules for documenting them.
        </p>
        <p>
          Second premise is a need for verifying claims that the proposed architecture is truly
privacypreserving. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] modelled the threats to which default FL processing is vulnerable, concluding that
FL alone cannot satisfy two (data minimization and anonymization) out of three (transparency
and consent) core aspects of privacy. To verifiably guarantee protection, FL would need to be
combined with additional techniques (e.g., secure enclaves, cryptography, differential privacy),
based on trade-offs between accuracy, computational costs and competing objectives.
        </p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>We propose patterns for designing information systems architectures around parties interacting
in privacy-preserving contexts. Following a design science methodology, we describe four
interaction patterns that involve data processors, providers and third parties, and provide claims
as the basis for keeping parties accountable. With an exemplary application, we sketch how
patterns can be applied, and discuss how they map to existing privacy principles. The intended
benefit of our contribution is to structure the operationalization of privacy principles via a
taxonomy of patterns, making preconditions and differences between core and non-core
components explicit, and clarifying trade-offs between technical extensions and rule-building
activities.</p>
      <p>We identify the following limitations. First, preconditions that motivate parties to interact –
vulnerability, complementarity, high expected value from collaboration, and high expected costs
from non-compliance – might have degrees of interpretation. Our case involved parties with an
incentive to improve efficiency, and freedom to establish trust via agreements; other cases may
require stricter proofs of satisfied preconditions. Second, secure communication (the fifth
precondition) cannot always be expected. Where data, computation specifications or
cryptographic keys are vulnerable, patterns may require additional security components. Third,
implicit assumptions may be present. We do not specify what policies or contracts should contain,
and assume that organizational resistance is minimal. In reality, despite high expected value and
low expected risk, data providers may still be reluctant to share data, opting instead for more
intensive isolate methods or performing no learning at all.</p>
      <p>Future work involves three areas. First, another iteration of PDR in different contexts will help
operationalize decision-making and explore extensions of privacy-preserving design patterns.
We expect that validation will introduce objectives, preconditions, and theories to expand our
taxonomy. Second, further specification of tools for assessment and decision-making is needed;
we are striving to build a corresponding web tool. Finally, different stages of ML and different
assumptions may require different patterns. Combinations with the specify computation pattern
in the training stage may reveal different ways of instantiating the federated learning concept,
depending on other conditions beyond overall trust. We expect the patterns to be a useful
conceptualization of privacy-preserving learning outside of our cross-silo scope, and invite
research contributions to test the assumption.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgements</title>
      <p>This research was partially funded by the Bavarian Ministry of Ministry of Economic Affairs,
Regional Development and Energy. We thank IBM Research Almaden, IBM Research Ireland and
the public city administrations of Munich, Augsburg, and Nuremberg for their cooperation and
advice. We thank our reviewers for their careful reading and constructive remarks.
[40] M. Arnold, R. K. E. Bellamy, M. Hind, et al., FactSheets: Increasing trust in AI services through
supplier's declarations of conformity, IBM Journal of Research and Development 63.4/5
(2019) 1-13.
[41] L. Bourtoule, V. Chandrasekaran, C. A. Choquette-Choo, H. Jia, A. Travers, B. Zhang, D. Lie, N.</p>
      <p>Papernot, Machine unlearning, Proceedings of the IEEE Symposium on Security and Privacy,
2021, pp. 141–159.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Miotto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Dudley</surname>
          </string-name>
          ,
          <article-title>Deep learning for healthcare: Review, opportunities and challenges</article-title>
          ,
          <source>Briefings in Bioinformatics 19.6</source>
          (
          <year>2017</year>
          )
          <fpage>1236</fpage>
          -
          <lpage>1246</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Flah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Nunez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. W.</given-names>
            <surname>Chaabene</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Nehdi</surname>
          </string-name>
          .
          <article-title>Machine Learning Algorithms in Civil Structural Health Monitoring: A Systematic Review</article-title>
          ,
          <source>Archives of Computational Methods in Engineering 28.4</source>
          (
          <year>2021</year>
          )
          <fpage>2621</fpage>
          -
          <lpage>2643</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Courtiol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Maussion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Moarii</surname>
          </string-name>
          , et al.,
          <article-title>Deep learning-based classification of mesothelioma improves prediction of patient outcome</article-title>
          ,
          <source>Nature Medicine 25.10</source>
          (
          <year>2019</year>
          )
          <fpage>1519</fpage>
          -
          <lpage>1525</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>B.</given-names>
            <surname>McMahan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Moore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ramage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hampson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. A.</given-names>
            ,
            <surname>Arcas</surname>
          </string-name>
          ,
          <article-title>Communication-Efficient Learning of Deep Networks from Decentralized Data</article-title>
          ,
          <source>Proceedings of the 20th International Conference on Artificial Intelligence and Statistics</source>
          , AISTATS,
          <year>2017</year>
          , pp.
          <fpage>1273</fpage>
          -
          <lpage>1282</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bonawitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kairouz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>McMahan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ramage</surname>
          </string-name>
          ,
          <article-title>Federated Learning and Privacy: Building privacy-preserving systems for machine learning and data science on decentralized data</article-title>
          ,
          <source>Queue 19.5</source>
          (
          <year>2021</year>
          )
          <fpage>87</fpage>
          -
          <lpage>114</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Sahu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Talwalkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Smith</surname>
          </string-name>
          , Federated Learning: Challenges, Methods, and Future Directions,
          <source>IEEE Signal Processing Magazine 37.3</source>
          (
          <year>2020</year>
          )
          <fpage>50</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          <article-title>Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection, IEEE Transactions on Knowledge and Data Engineering</article-title>
          , published online,
          <year>2021</year>
          . URL: https://ieeexplore.ieee.org/document/9599369
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Baracaldo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Anwar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Purcell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rawat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sinn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Altakrouri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Balta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sellami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kuhn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Schopp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Buchinger</surname>
          </string-name>
          ,
          <article-title>Towards an Accountable and Reproducible Federated Learning: A FactSheets Approach</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2202</volume>
          .12443. URL: https://arxiv.org/abs/2202.12443
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R.</given-names>
            <surname>Shokri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Stronati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Shmatikov</surname>
          </string-name>
          ,
          <source>Membership Inference Attacks Against Machine Learning Models, IEEE Symposium on Security and Privacy</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>18</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fredrikson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jha</surname>
          </string-name>
          , T. Ristenpart,
          <article-title>Model inversion attacks that exploit confidence information and basic countermeasures</article-title>
          ,
          <source>Proceedings of the 22nd ACM SIGSAC conference on computer and communications security</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>1322</fpage>
          -
          <lpage>1333</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>K.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ding</surname>
          </string-name>
          , C. Ma,
          <string-name>
            <given-names>H. H.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Farokhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Q.</given-names>
            <surname>Quek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. V.</given-names>
            <surname>Poor</surname>
          </string-name>
          ,
          <article-title>Federated learning with differential privacy: Algorithms and performance analysis</article-title>
          ,
          <source>IEEE Transactions on Information Forensics and Security</source>
          <volume>15</volume>
          (
          <year>2020</year>
          )
          <fpage>3454</fpage>
          -
          <lpage>3469</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Truex</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Baracaldo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Anwar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Steinke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ludwig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>A Hybrid Approach to Privacy-Preserving Federated Learning</article-title>
          ,
          <source>Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security</source>
          ,
          <source>AISec'19</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T. S.</given-names>
            <surname>Brisimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mela</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Olshevsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. C.</given-names>
            <surname>Paschalidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <article-title>Federated learning of predictive models from federated electronic health records</article-title>
          ,
          <source>International Journal of Medical Informatics</source>
          <volume>112</volume>
          (
          <year>2018</year>
          )
          <fpage>59</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>N. G.</surname>
          </string-name>
          <article-title>Packin, RegTech, compliance and technology judgment rule</article-title>
          ,
          <source>Chi</source>
          .-Kent L.
          <year>Rev</year>
          .
          <volume>93</volume>
          .193 (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kacianka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pretschner</surname>
          </string-name>
          ,
          <article-title>Designing accountable systems</article-title>
          ,
          <source>FaccT '21: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency</source>
          , pp.
          <fpage>424</fpage>
          -
          <lpage>437</lpage>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Eriksén</surname>
          </string-name>
          , Designing for accountability,
          <source>NordiCHI '02: Proceedings of the second Nordic conference on Human-computer interaction</source>
          , pp.
          <fpage>177</fpage>
          -
          <lpage>186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>L.</given-names>
            <surname>Lessig</surname>
          </string-name>
          , Code and Other Laws of Cyberspace, Basic Books Inc., New York, NY,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>L.</given-names>
            <surname>Lessig</surname>
          </string-name>
          , Code is law,
          <source>Harvard Magazine</source>
          ,
          <year>2000</year>
          . URL: https://www.harvardmagazine.com/
          <year>2000</year>
          /01/code-is-law-html
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Buchinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kuhn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Balta</surname>
          </string-name>
          , Dimensions of Accountability in Interorganizational Business Processes,
          <source>Proceedings of the 55th Hawaii International Conference on System Sciences, HICSS</source>
          ,
          <year>2022</year>
          , Association of IEEE, pp.
          <fpage>429</fpage>
          -
          <lpage>438</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M.</given-names>
            <surname>Brundage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Avin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          , et al.,
          <article-title>Toward trustworthy AI development: mechanisms for supporting verifiable claims</article-title>
          ,
          <year>2020</year>
          . arXiv:
          <year>2004</year>
          .07213. URL: https://arxiv.org/abs/
          <year>2004</year>
          .07213
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>European</surname>
            <given-names>Union</given-names>
          </string-name>
          ,
          <source>Regulation (EU) 2016/679 (General Data Protection Regulation)</source>
          ,
          <year>2018</year>
          . URL: https://gdpr-info.eu/
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>European</surname>
            <given-names>Union</given-names>
          </string-name>
          ,
          <article-title>Proposal for a Regulation of the European Parliament and of the Council Laying Down Harmonised Rules on Artificial Intelligence (Artificial Intelligence Act) and Amending Certain Union Legislative Acts</article-title>
          , COM/
          <year>2021</year>
          /206 final,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>M.</given-names>
            <surname>Eßer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kramer</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>von Lewinski, DSGVO BDSG, DatenschutzGrundverordnung, Bundesdatenschutzgesetz und Nebengesetze, 6</article-title>
          . Aufl.,
          <string-name>
            <surname>Köln</surname>
          </string-name>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>A.</given-names>
            <surname>Toy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. C.</given-names>
            <surname>Hay</surname>
          </string-name>
          , Privacy auditing standards,
          <source>Auditing: A Journal of Practice &amp; Theory 34.3</source>
          (
          <year>2015</year>
          )
          <fpage>181</fpage>
          -
          <lpage>199</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>S.</given-names>
            <surname>Buckl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Matthes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. W.</given-names>
            <surname>Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. M.</given-names>
            <surname>Schweda</surname>
          </string-name>
          ,
          <article-title>Pattern-based design research - an iterative research method balancing rigor and relevance</article-title>
          , in: J. vom Brocke,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hekkala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ram</surname>
          </string-name>
          , M. Rossi (Eds.), DESRIST 2013:
          <article-title>Design Science at the Intersection of Physical and Virtual Design</article-title>
          , volume
          <volume>7939</volume>
          of Lecture Notes in Computer Science, Springer-Verlag, Berlin,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>K.</given-names>
            <surname>Sedig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Parsons</surname>
          </string-name>
          ,
          <article-title>Interaction Design for Complex Cognitive Activities with Visual Representations: A Pattern-Based Approach</article-title>
          ,
          <source>AIS Transactions on Human-Computer Interaction</source>
          ,
          <volume>5</volume>
          .2 (
          <year>2013</year>
          )
          <fpage>84</fpage>
          -
          <lpage>133</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>J. O.</given-names>
            <surname>Horchers</surname>
          </string-name>
          ,
          <article-title>A pattern approach to interaction design</article-title>
          ,
          <source>AI and Society 15</source>
          <volume>4</volume>
          (
          <year>2001</year>
          )
          <fpage>359</fpage>
          -
          <lpage>376</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>N.</given-names>
            <surname>Truong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guitton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>Privacy preservation in federated learning: An insightful survey from the GDPR perspective</article-title>
          ,
          <source>Computers and Security</source>
          <volume>110</volume>
          (
          <year>2021</year>
          )
          <article-title>published online</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>T. K.</given-names>
            ,
            <surname>Rodrigues</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Suto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Nishiyama</surname>
          </string-name>
          , J. Liu,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kato</surname>
          </string-name>
          ,
          <article-title>Machine Learning Meets Computation and Communication Control in Evolving Edge and Cloud: Challenges and Future Perspective</article-title>
          ,
          <source>IEEE Communications Surveys and Tutorials</source>
          ,
          <volume>22</volume>
          .1 (
          <year>2020</year>
          )
          <fpage>38</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>C.</given-names>
            <surname>Dwork</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <article-title>The algorithmic foundations of differential privacy</article-title>
          ,
          <source>Foundations and Trends in Theoretical Computer Science</source>
          <volume>9</volume>
          .
          <fpage>3</fpage>
          -
          <lpage>4</lpage>
          (
          <year>2014</year>
          )
          <fpage>211</fpage>
          -
          <lpage>407</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>X.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Paulet</surname>
          </string-name>
          , E. Bertino, Homomorphic Encryption,
          <source>Homomorphic Encryption and Applications</source>
          (
          <year>2014</year>
          )
          <fpage>27</fpage>
          -
          <lpage>46</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>C.</given-names>
            <surname>Marcolla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sucasas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Manzano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bassoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. H. P.</given-names>
            <surname>Fitzek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Aaraj</surname>
          </string-name>
          , Survey on Fully Homomorphic Encryption, Theory, and
          <string-name>
            <surname>Applications</surname>
          </string-name>
          ,
          <source>Proceedings of the IEEE 110.10</source>
          (
          <issue>2022</issue>
          ) pp.
          <fpage>1572</fpage>
          -
          <lpage>1609</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ludwig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Baracaldo</surname>
          </string-name>
          , G. Thomas, et al.,
          <source>IBM Federated Learning: an Enterprise Framework White Paper</source>
          ,
          <year>2020</year>
          . URL: https://arxiv.org/abs/
          <year>2007</year>
          .10987 (visited
          <issue>on November 15</issue>
          ,
          <year>2022</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Tesfay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Serna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Rannenberg</surname>
          </string-name>
          ,
          <article-title>Privacybot: detecting privacy sensitive information in unstructured texts</article-title>
          ,
          <source>Sixth International Conference on Social Networks Analysis, Management and Security</source>
          ,
          <string-name>
            <surname>SNAMS</surname>
          </string-name>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          ,
          <article-title>LeCun, Character-level Convolutional Networks for Text Classification</article-title>
          ,
          <source>Proceedings of the 28th International Conference on Neural Information Processing Systems</source>
          , NIPS'
          <volume>15</volume>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>B.-J.</given-names>
            ,
            <surname>Koops</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Leenes</surname>
          </string-name>
          ,
          <article-title>Privacy regulation cannot be hardcoded. A critical comment on the 'privacy by design' provision in data-protection law</article-title>
          ,
          <source>International Review of Law, Computers and Technology 28.2</source>
          (
          <year>2014</year>
          )
          <fpage>159</fpage>
          -
          <lpage>171</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>A.</given-names>
            <surname>Romanou</surname>
          </string-name>
          ,
          <article-title>The necessity of the implementation of Privacy by Design in sectors where data protection concerns arise</article-title>
          ,
          <source>Computer Law and Security Review 34.1</source>
          (
          <year>2018</year>
          )
          <fpage>99</fpage>
          -
          <lpage>110</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>D.</given-names>
            <surname>Huth</surname>
          </string-name>
          ,
          <article-title>Patterns for GDPR Compliance</article-title>
          ,
          <year>PoEM 2017</year>
          :
          <article-title>Doctoral Consortium</article-title>
          and Industry Track Papers,
          <year>2017</year>
          , pp.
          <fpage>34</fpage>
          -
          <lpage>40</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>D.</given-names>
            <surname>Huth</surname>
          </string-name>
          ,
          <article-title>Development of a reference process model for GDPR compliance management based on enterprise architecture</article-title>
          ,
          <source>PhD thesis</source>
          , Technical University of Munich, Munich, Germany,
          <year>2021</year>
          . URL: https://mediatum.ub.tum.de/doc/1593644/1593644.pdf
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>