<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="editorial">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Big Data</journal-id>
<journal-title>Frontiers in Big Data</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Big Data</abbrev-journal-title>
<issn pub-type="epub">2624-909X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fdata.2019.00001</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Big Data</subject>
<subj-group>
<subject>Specialty Grand Challenge</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Research Challenges at the Intersection of Big Data, Security and Privacy</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Kantarcioglu</surname> <given-names>Murat</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/521239/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Ferrari</surname> <given-names>Elena</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/548775/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Computer Science, University of Texas at Dallas</institution>, <addr-line>Richardson, TX</addr-line>, <country>United States</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Theoretical and Applied Science, University of Insubria</institution>, <addr-line>Varese</addr-line>, <country>Italy</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited and reviewed by: Jorge Lobo, Catalan Institution for Research and Advanced Studies, Spain</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Murat Kantarcioglu <email>muratk&#x00040;utdallas.edu</email></corresp>
<fn fn-type="other" id="fn001"><p>This article was submitted to Cybersecurity and Privacy, a section of the journal Frontiers in Big Data</p></fn></author-notes>
<pub-date pub-type="epub">
<day>14</day>
<month>02</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="collection">
<year>2019</year>
</pub-date>
<volume>2</volume>
<elocation-id>1</elocation-id>
<history>
<date date-type="received">
<day>24</day>
<month>07</month>
<year>2018</year>
</date>
<date date-type="accepted">
<day>10</day>
<month>01</month>
<year>2019</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2019 Kantarcioglu and Ferrari.</copyright-statement>
<copyright-year>2019</copyright-year>
<copyright-holder>Kantarcioglu and Ferrari</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions> 
<kwd-group>
<kwd>big data</kwd>
<kwd>security</kwd>
<kwd>privacy</kwd>
<kwd>cybersecurity</kwd>
<kwd>sharing</kwd>
<kwd>machine learning</kwd>
</kwd-group>
<counts>
<fig-count count="0"/>
<table-count count="0"/>
<equation-count count="0"/>
<ref-count count="64"/>
<page-count count="6"/>
<word-count count="4884"/>
</counts>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1. Overview</title>
<p>As reports from McKinsey Global Institute (Mckinsey et al., <xref ref-type="bibr" rid="B38">2011</xref>) and the World Economic Forum (Schwab, <xref ref-type="bibr" rid="B51">2016</xref>) suggest, capturing, storing and mining &#x0201C;big data&#x0201D; may create significant value in many industries ranging from health care to government services. For example, McKinsey estimates that capturing the value of big data can create $300 billion dollar annual value in the US health care sector and $600 billion dollar annual consumer surplus globally (Mckinsey et al., <xref ref-type="bibr" rid="B38">2011</xref>). Still, several important issues need to be addressed to capture the full potential of big data. As shown by the recent Cambridge Analytica scandal (Cadwalladr and Graham-Harrison, <xref ref-type="bibr" rid="B9">2018</xref>) where millions of users profile information were misused, security and privacy issues become a critical concern. As big data becomes the new oil for the digital economy, realizing the benefits that big data can bring requires considering many different security and privacy issues. This in return implies that the entire big data pipeline needs to be revisited with security and privacy in mind. For example, while the big data is stored and recorded, appropriate privacy-aware access control policies need to be enforced so that the big data is only used for legitimate purposes. On the other hand, while linking and sharing data across organizations, privacy/security issues need to be considered. Below, we provide an overview of novel research challenges that are at the intersection of cybersecurity, privacy and big data.</p>
</sec>
<sec id="s2">
<title>2. Storing and Querying Big Data</title>
<p>One of the ways to securely store big data is using encryption. Once data is encrypted, if the encryption keys are safe, then it is infeasible to retrieve the original data from the encrypted data alone. At the same time, encrypted data must be queried efficiently. Encrypted storage and querying of big data have received significant attention in the literature (e.g., Song et al., <xref ref-type="bibr" rid="B55">2000</xref>; Hacigumus et al., <xref ref-type="bibr" rid="B24">2002</xref>; Golle et al., <xref ref-type="bibr" rid="B22">2004</xref>; Ballard et al., <xref ref-type="bibr" rid="B5">2005</xref>; Chang and Mitzenmacher, <xref ref-type="bibr" rid="B13">2005</xref>; Kantarc&#x00131;o&#x0011F;lu and Clifton, <xref ref-type="bibr" rid="B30">2005</xref>; Canim and Kantarcioglu, <xref ref-type="bibr" rid="B10">2007</xref>; Shi et al., <xref ref-type="bibr" rid="B54">2007</xref>; Shaon and Kantarcioglu, <xref ref-type="bibr" rid="B52">2016</xref>). Many techniques ranging from simple encrypted keyword searches to fully homomorphic encryption have been developed (e.g., Gentry, <xref ref-type="bibr" rid="B21">2009</xref>). Although there have been major progress in this line of research, breakthroughs are still needed to scale encryption techniques for big data workloads in a cost effect manner. In addition, more practical systems need to be developed for end users. Recent developments that leverage advances in trusted execution environments (TEEs) (e.g., Ohrimenko et al., <xref ref-type="bibr" rid="B42">2016</xref>; Chandra et al., <xref ref-type="bibr" rid="B12">2017</xref>; Shaon et al., <xref ref-type="bibr" rid="B53">2017</xref>; Zheng et al., <xref ref-type="bibr" rid="B62">2017</xref>) offer much more efficient solutions for processing encrypted big data under the assumption that hardware provides some security functionality. Still, the risks of using encrypted data processing (e.g., access pattern disclosure Islam et al., <xref ref-type="bibr" rid="B28">2012</xref>) and TEEs need to be further understood to provide scalability for the big data while minimizing realistic security and privacy risks.</p>
<p>Even if the data is stored in an encrypted format, legitimate users need to access the data. This implies that we need to have effective access control techniques that allow users to access the right data. Although the research community has developed a plethora of access control techniques for almost all of the important big data management systems (e.g., Relational databases Oracle, <xref ref-type="bibr" rid="B43">2015</xref>, NoSql databases Ulusoy et al., <xref ref-type="bibr" rid="B58">2015a</xref>; Colombo and Ferrari, <xref ref-type="bibr" rid="B16">2018</xref>, social network data Carminati et al., <xref ref-type="bibr" rid="B11">2009</xref>) with important capabilities, whether the existing techniques and tools could easily support the new regulatory requirements such as the ones introduced by European Union General Data Protection Directive GDPR (Voigt and Bussche, <xref ref-type="bibr" rid="B61">2017</xref>) is an important question. For example, to address new regulations such as right-to-be-forgotten where users may require the deletion of data that belongs to them, we may need to better understand how the data linked and shared among multiple users in a big data system. For example, multiple users that are tagged in the same picture may have legitimate privacy claims about the picture. This implies that access control systems need to support policies based on the relationships among users and data items (e.g., Pasarella and Lobo, <xref ref-type="bibr" rid="B45">2017</xref>). These observations indicate that understanding how to provide scalable, secure and privacy-aware access control mechanisms for the future big data applications ranging from personalized medicine to Internet of Things systems while satisfying new regulatory requirements would be an important research direction.</p>
</sec>
<sec id="s3">
<title>3. Linking and Sharing Big Data</title>
<p>In many cases, data that belongs to different sources need to be integrated while satisfying many privacy requirements. For example, a patient may visit multiple health care providers and his/her complete health records may not be available in one organization. As another example, passenger data coming from airlines may need to be linked to governmental terrorist watch lists to detect suspicious activity. To protect individual privacy, only the records belonging to government watch lists may be shared. Clearly, these types of use cases require linking potentially sensitive data belonging to the different data controllers. Over the years, private record linkage research has addressed many issues ranging from handling errors (e.g., Kuzu et al., <xref ref-type="bibr" rid="B36">2013</xref>) to efficient approximate schemes that leverage cryptographic solutions (e.g., Inan et al., <xref ref-type="bibr" rid="B27">2008</xref>). Still, the scalability of these techniques for multiple data sources with different privacy and security requirements have not been explored. More research is needed to make these recent developments to be deployed in practice by addressing these scalability issues.</p>
<p>Once data is collected and potentially linked/cleaned, it may be shared across organizations to enable novel applications and unlock potential value. For example, location data collected from mobile devices can be shared with city planners to better optimize transportations networks. Unfortunately, privacy and security issues may prevent such data sharing. Even worse, in some cases such data may be distributed among multiple parties with potentially conflicting interests. For example, different organizations may not want to share their cybersecurity incident data because of the potential concerns where a competitor may use this information for their benefit. Therefore, many issues ranging from security to privacy to incentives for sharing big data need to be considered.</p>
<p>From a privacy point of view, novel privacy-preserving data sharing techniques, based on a theoretically sound privacy definition named differential privacy, have been developed (e.g., Dwork, <xref ref-type="bibr" rid="B18">2006</xref>). These techniques usually work by adding noise to shared data and may not be suitable in some application domains where noise free data need to be shared (e.g., health care domain). In addition, in some cases, these techniques require adding significant amount of noise to protect privacy. This in return may significantly reduce the data utility. On the other hand, some practical risk&#x02013;aware data sharing tools have been developed (e.g., Prasser et al., <xref ref-type="bibr" rid="B48">2017</xref>). Unfortunately, these practical risk-aware data sharing techniques do not provide the theoretical guarantees offered by differential privacy. Therefore, better understanding of the limits of privacy-preserving data sharing techniques that balance privacy risks vs. data utility need to be developed.</p>
<p>In many cases, misaligned incentives among the data collectors and/or processors may prevent data sharing. For example, instead of getting lab tests conducted by another health care provider, for a hospital, it may be more profitable to redo the tests. To address this type of incentive issues, secure distributed data sharing protocols that incentivize honest sharing of data have been developed (e.g., Buragohain et al., <xref ref-type="bibr" rid="B7">2003</xref>). These protocols usually leverage ideas from economics and game theory to incentivize truthful sharing of big data where security concerns prevent direct auditing (e.g., Kantarcioglu and Nix, <xref ref-type="bibr" rid="B32">2010</xref>; Kantarcioglu and Jiang, <xref ref-type="bibr" rid="B31">2012</xref>). Still addressing incentive issues ranging from compensating individuals for sharing their data (e.g., data market places <xref ref-type="fn" rid="fn0001"><sup>1</sup></xref>) to payment systems for data sharing among industry players need to be addressed. More research that integrates ideas from economics, and psychology with computer science techniques is needed to address the incentive issues in sharing big data without sacrificing security and/or privacy.</p>
</sec>
<sec id="s4">
<title>4. Analyzing Big Data</title>
<p>Another important research direction is to address the privacy and the security issues in analyzing big data. Especially, recent developments in machine learning techniques have created important novel applications in many fields ranging from health care to social networking while creating important privacy challenges.</p>
<p>Again differential privacy ideas have been applied to address privacy issues for the scenarios where all the needed data is controlled by one organization (e.g., McSherry, <xref ref-type="bibr" rid="B39">2009</xref>). These techniques usually require adding noise to the results. Still, it is shown that given large amount of data, these techniques can provide useful machine learning models. To address the scenarios where machine learning models need to be built by combining data that belong to different organization, many different privacy-preserving distributed machine learning protocols have been developed (e.g., Clifton et al., <xref ref-type="bibr" rid="B15">2003</xref>; Kantarc&#x00131;o&#x0011F;lu and Clifton, <xref ref-type="bibr" rid="B29">2004</xref>; Vaidya and Clifton, <xref ref-type="bibr" rid="B60">2005</xref>). Using cryptographic techniques, these algorithms usually provide security/privacy proofs that show nothing other than the final machine learning models are revealed. Furthermore, these results suggest that most of the privacy-preserving distributed machine learning tasks could be securely implemented by using few basic &#x0201C;secure building blocks&#x0201D; such as secure matrix operations, secure comparison, etc. (Clifton et al., <xref ref-type="bibr" rid="B15">2003</xref>). Still many challenges remain in both settings. In the case of differential private techniques, for complex machine learning tasks such as deep neural networks, the privacy parameters need to adjusted properly to get the desired utility (e.g., classifier accuracy Abadi et al., <xref ref-type="bibr" rid="B1">2016</xref>). The practical implications of setting such privacy parameters need to be explored further. In the case of privacy-preserving distributed machine learning techniques, except few exceptions, these techniques are not efficient enough for big data. Although leveraging trusted execution environments showed some promising results, potential leaks due to side channels need to be considered (Schuster et al., <xref ref-type="bibr" rid="B50">2015</xref>; Costan and Devadas, <xref ref-type="bibr" rid="B17">2016</xref>; Shaon et al., <xref ref-type="bibr" rid="B53">2017</xref>). Therefore, more research is needed to scale these techniques without sacrificing security guarantees.</p>
<p>Unfortunately, securely building machine learning models by itself may not preserve privacy directly. It has been shown that machine learning results may be used to infer sensitive information such as sexual orientation, political affiliation (e.g., Heatherly et al., <xref ref-type="bibr" rid="B25">2013</xref>), intelligence (e.g., Kosinski et al., <xref ref-type="bibr" rid="B35">2013</xref>) etc. Although differential privacy techniques have shown some promise to prevent such attacks, recent results have shown that it may not be effective against many attack while providing acceptable data utility (Fredrikson et al., <xref ref-type="bibr" rid="B20">2014</xref>). These results indicate the need to do more research on understanding privacy impact of machine learning models and whether the models should be built in the first place (e.g., machine learning model that tries to predict intelligence).</p>
</sec>
<sec id="s5">
<title>5. Accountability Issues in Big Data</title>
<p>As machine learning algorithms affect more and more aspects of our lives, it becomes crucial to understand how these algorithms change the way decisions are made in today&#x00027;s data-driven society. The lack of transparency in data-driven decision-making algorithms can easily conceal fallacies and risks codified in the underlying mathematical models, and nurture inequality, bias, and further division between the privileged and the under-privileged (Sweeney, <xref ref-type="bibr" rid="B56">2013</xref>). Although the recent research tries to address these transparency challenges (Baeza-Yates, <xref ref-type="bibr" rid="B4">2018</xref>), more research is needed to ensure fairness, and accountability in usage of machine learning models and big data driven decision algorithms. Understanding the data provenance (e.g., Bertino and Kantarcioglu, <xref ref-type="bibr" rid="B6">2017</xref>) (i.e., how the data is created, who touched it etc.) have shown to improve trust in decisions and the quality of data used for decision making.</p>
<p>In addition to increasing accountability in decision making, more work is needed to make organizations accountable in using privacy sensitive data. With the recent regulations such as GDPR (Voigt and Bussche, <xref ref-type="bibr" rid="B61">2017</xref>), using data only for the purposes consented by the individuals become critical, since personal data can be stored, analyzed and shared as long as the owner of the data consent the data usage purposes. At the same time, it is not clear whether the organizations who collect the privacy sensitive data always process the data according to user consent. An example of this problem is reflected in the recent Cambridge Analytica scandal (Cadwalladr and Graham-Harrison, <xref ref-type="bibr" rid="B9">2018</xref>). In this case, it turns out that the data collected by Facebook is shared for purposes that are not explicitly consented by the individuals which the data belong. As more and more data collected, making organizations accountable for data misuse becomes more critical. It is not clear whether purely technical solutions can solve this problem, even though some research try to formalize purpose based access control and data sharing for big data (e.g., Byun and Li, <xref ref-type="bibr" rid="B8">2008</xref>; Ulusoy et al., <xref ref-type="bibr" rid="B59">2015b</xref>). Legal and economic solutions (e.g., rewarding insiders that report data misuse) need to be combined with technical solutions. Research that addresses this interdisciplinary area emerges as a critical need.</p>
</sec>
<sec id="s6">
<title>6. Blockchains, Big Data Security and Privacy</title>
<p>The recent rise of the blockchain technologies have enabled organizations to leverage a secure distributed public ledger where important information could be stored for various purposes including increasing in transparency of the underlying economic transactions. The first application of Blockchain has been the Bitcoin (Nakamoto, <xref ref-type="bibr" rid="B41">2008</xref>) cryptocurrency. Bitcoin&#x00027;s success has resulted in more than 1000 Blockchain based cryptocurrencies, known as alt-coins.</p>
<p>It turns out that blockchains may have important implications for big data security and privacy. On the one hand, combined with other cryptographic primitives, blockchain based tools (e.g., Androulaki et al., <xref ref-type="bibr" rid="B3">2018</xref>) may enable more secure financial transactions (e.g., Cheng et al., <xref ref-type="bibr" rid="B14">2018</xref>), data sharing (e.g., Kosba et al., <xref ref-type="bibr" rid="B34">2016</xref>) and provenance storage (e.g., Ramachandran and Kantarcioglu, <xref ref-type="bibr" rid="B49">2018</xref>). On the other hand, the data stored on blockchains (e.g., financial transactions stored on Bitcoin blockchain) may be analyzed to provide novel insights about emerging data security issues. For example, it seems that cryptocurrencies are used in payments for human trafficking (Portnoff et al., <xref ref-type="bibr" rid="B47">2017</xref>), ransomware (Huang et al., <xref ref-type="bibr" rid="B26">2018</xref>), personal blackmails (Phetsouvanh and Oggier, <xref ref-type="bibr" rid="B46">2018</xref>), and money laundering (Moser and Breuker, <xref ref-type="bibr" rid="B40">2013</xref>), among many others. Blockchain Data Analytics tools (Akcora et al., <xref ref-type="bibr" rid="B2">2017</xref>) and big data analysis algorithms can be used by law agencies to detect such misuse (for Law Enforcement Cooperation, <xref ref-type="bibr" rid="B19">2017</xref>).</p>
</sec>
<sec id="s7">
<title>7. Adversarial ML and ML for Cybersecurity</title>
<p>Like many application domains, more and more data are collected for cyber security. Examples of these collected data include system logs, network packet traces, account login formation, etc. Since the amount of data collected is ever increasing, it became impossible to analyze all the collected data manually to detect and prevent attacks. Therefore, data analytics are being applied to large volumes of security monitoring data to detect cyber security incidents (see discussion in Kantarcioglu and Xi, <xref ref-type="bibr" rid="B33">2016</xref>). For example, a report from Gartner claims (MacDonald, <xref ref-type="bibr" rid="B37">2012</xref>) that &#x0201C;Information security is becoming a big data analytics problem, where massive amounts of data will be correlated, analyzed and mined for meaningful patterns.&#x0201D; There are many companies that already offer data analytics solutions for this important problem. Of course, data analytics is a means to an end where the ultimate goal is to provide cyber security analysts with prioritized actionable insights derived from big data.</p>
<p>Still, direct application of data analytics techniques to the cyber security domain may be misguided. Unlike most other application domains, cyber security applications often face adversaries who actively modify their strategies to launch new and unexpected attacks. The existence of such adversaries in cyber security creates unique challenges compared to other domains where data analytics tools are applied. First, the attack instances are frequently being modified to avoid detection. Hence a future dataset will no longer share the same properties as the current datasets. For example, attackers may change the spam e-mails written by adding some words that are typically associated with legitimate e-mails. Therefore, the spam e-mail characteristics may be changed significantly by the spammers as often as they want. Secondly, when a previously unknown attack appears, data analytics techniques need to respond to the new attack quickly and cheaply. For example, when a new type of ransomware appears in the wild, we may need to update existing data analytics techniques quickly to detect such attacks. Thirdly, adversaries can be well-funded and make big investments to camouflage the attack instances. For example, a sophisticated group of cyber attackers may create malware that can evade all the existing signature-based malware detection tools using zero day exploits (i.e., software bugs that were previously unknown). Therefore, there is an urgent need to protect machine learning models against potential attacks. Although there is an active research directions for addressing adversarial attacks in machine learning (e.g., Zhou et al., <xref ref-type="bibr" rid="B64">2012</xref>; Szegedy et al., <xref ref-type="bibr" rid="B57">2013</xref>; Goodfellow et al., <xref ref-type="bibr" rid="B23">2014</xref>; Papernot et al., <xref ref-type="bibr" rid="B44">2016</xref>; Zhou and Kantarcioglu, <xref ref-type="bibr" rid="B63">2016</xref>), more research that also leverages human capabilities may be needed to counter such attacks.</p>
</sec>
<sec id="s8">
<title>Author Contributions</title>
<p>All authors listed have made a substantial, direct and intellectual contribution to the work, and approved it for publication.</p>
<sec>
<title>Conflict of Interest Statement</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
</sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Abadi</surname> <given-names>M.</given-names></name> <name><surname>Chu</surname> <given-names>A.</given-names></name> <name><surname>Goodfellow</surname> <given-names>I.</given-names></name> <name><surname>McMahan</surname> <given-names>H. B.</given-names></name> <name><surname>Mironov</surname> <given-names>I.</given-names></name> <name><surname>Talwar</surname> <given-names>K.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Deep learning with differential privacy</article-title>, in <source>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>308</fpage>&#x02013;<lpage>318</lpage>. <pub-id pub-id-type="doi">10.1145/2976749.2978318</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Akcora</surname> <given-names>C. G.</given-names></name> <name><surname>Gel</surname> <given-names>Y. R.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name></person-group> (<year>2017</year>). <article-title>Blockchain: A Graph Primer</article-title>. <source>arXiv preprint arXiv</source>:<fpage>1708.08749</fpage> , <fpage>1</fpage>&#x02013;<lpage>17</lpage></citation></ref>
<ref id="B3">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Androulaki</surname> <given-names>E.</given-names></name> <name><surname>Barger</surname> <given-names>A.</given-names></name> <name><surname>Bortnikov</surname> <given-names>V.</given-names></name> <name><surname>Cachin</surname> <given-names>C.</given-names></name> <name><surname>Christidis</surname> <given-names>K.</given-names></name> <name><surname>De Caro</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>Hyperledger fabric: a distributed operating system for permissioned blockchains</article-title>, in <source>Proceedings of the Thirteenth EuroSys Conference</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>30</fpage>.</citation></ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Baeza-Yates</surname> <given-names>R.</given-names></name></person-group> (<year>2018</year>). <article-title>Bias on the web</article-title>. <source>Commun. ACM</source> <volume>61</volume>, <fpage>54</fpage>&#x02013;<lpage>61</lpage>. <pub-id pub-id-type="doi">10.1145/3209581</pub-id></citation></ref>
<ref id="B5">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ballard</surname> <given-names>L.</given-names></name> <name><surname>Kamara</surname> <given-names>S.</given-names></name> <name><surname>Monrose</surname> <given-names>F.</given-names></name></person-group> (<year>2005</year>). <article-title>Achieving efficient conjunctive keyword searches over encrypted data</article-title>, in <source>Seventh International Conference on Information and Communication Security (ICICS 2005)</source> (<publisher-loc>Heidelberg</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>414</fpage>&#x02013;<lpage>426</lpage>.</citation></ref>
<ref id="B6">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Bertino</surname> <given-names>E.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name></person-group> (<year>2017</year>). <article-title>A cyber-provenance infrastructure for sensor-based data-intensive applications</article-title>, in <source>2017 IEEE International Conference on Information Reuse and Integration, IRI 2017</source> (<publisher-loc>San Diego, CA</publisher-loc>), <fpage>108</fpage>&#x02013;<lpage>114</lpage>. <pub-id pub-id-type="doi">10.1109/IRI.2017.91</pub-id></citation></ref>
<ref id="B7">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Buragohain</surname> <given-names>C.</given-names></name> <name><surname>Agrawal</surname> <given-names>D.</given-names></name> <name><surname>Suri</surname> <given-names>S.</given-names></name></person-group> (<year>2003</year>). <article-title>A game theoretic framework for incentives in p2p systems</article-title>, in <source>P2P &#x00027;03: Proceedings of the 3rd International Conference on Peer-to-Peer Computing</source> (<publisher-loc>Washington, DC</publisher-loc>: <publisher-name>IEEE Computer Society</publisher-name>) <volume>48</volume>.</citation></ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Byun</surname> <given-names>J.-W.</given-names></name> <name><surname>Li</surname> <given-names>N.</given-names></name></person-group> (<year>2008</year>). <article-title>Purpose based access control for privacy protection in relational database systems</article-title>. <source>VLDB J.</source> <volume>17</volume>, <fpage>603</fpage>&#x02013;<lpage>619</lpage>. <pub-id pub-id-type="doi">10.1007/s00778-006-0023-0</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Cadwalladr</surname> <given-names>C.</given-names></name> <name><surname>Graham-Harrison</surname> <given-names>E.</given-names></name></person-group> (<year>2018</year>). <source>Revealed: 50 million Facebook Profiles Harvested for Cambridge Analytica in Major Data Breach</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.theguardian.com/news/2018/mar/17/cambridge-analytica-facebook-influence-us-election">https://www.theguardian.com/news/2018/mar/17/cambridge-analytica-facebook-influence-us-election</ext-link> (Accessed on 12/21/2018).</citation></ref>
<ref id="B10">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Canim</surname> <given-names>M.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name></person-group> (<year>2007</year>). <article-title>Design and analysis of querying encrypted data in relational databases</article-title>, in <source>The 21th Annual IFIP WG 11.3 Working Conference on Data and Applications Security</source> (<publisher-loc>Berlin, Heidelberg</publisher-loc>: <publisher-name>Springer-Verlag</publisher-name>), <fpage>177</fpage>&#x02013;<lpage>194</lpage>.</citation></ref>
<ref id="B11">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Carminati</surname> <given-names>B.</given-names></name> <name><surname>Ferrari</surname> <given-names>E.</given-names></name> <name><surname>Heatherly</surname> <given-names>R.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Thuraisingham</surname> <given-names>B. M.</given-names></name></person-group> (<year>2009</year>). <article-title>A semantic web based framework for social network access control</article-title>, in <source>SACMAT</source>, eds <person-group person-group-type="editor"><name><surname>Carminati</surname> <given-names>B.</given-names></name> <name><surname>Joshi</surname> <given-names>J.</given-names></name></person-group> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>177</fpage>&#x02013;<lpage>186</lpage>.</citation></ref>
<ref id="B12">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Chandra</surname> <given-names>S.</given-names></name> <name><surname>Karande</surname> <given-names>V.</given-names></name> <name><surname>Lin</surname> <given-names>Z.</given-names></name> <name><surname>Khan</surname> <given-names>L.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Thuraisingham</surname> <given-names>B.</given-names></name></person-group> (<year>2017</year>). <article-title>Securing data analytics on sgx with randomization</article-title>, in <source>Proceedings of the 22nd European Symposium on Research in Computer Security</source> (<publisher-loc>Oslo</publisher-loc>).</citation></ref>
<ref id="B13">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Chang</surname> <given-names>Y.</given-names></name> <name><surname>Mitzenmacher</surname> <given-names>M.</given-names></name></person-group> (<year>2005</year>). <article-title>Privacy preserving keyword searches on remote encrypted data</article-title>, in <source>Proceedings of ACNS&#x00027;05</source> (<publisher-loc>New York, NY</publisher-loc>), <fpage>442</fpage>&#x02013;<lpage>455</lpage>.</citation></ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cheng</surname> <given-names>R.</given-names></name> <name><surname>Zhang</surname> <given-names>F.</given-names></name> <name><surname>Kos</surname> <given-names>J.</given-names></name> <name><surname>He</surname> <given-names>W.</given-names></name> <name><surname>Hynes</surname> <given-names>N.</given-names></name> <name><surname>Johnson</surname> <given-names>N. M.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>Ekiden: a platform for confidentiality-preserving, trustworthy, and performant smart contract execution</article-title>. <source>CoRR</source> abs/1804.05141</citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Clifton</surname> <given-names>C.</given-names></name> <name><surname>Kantarc&#x00131;o&#x0011F;lu</surname> <given-names>M.</given-names></name> <name><surname>Lin</surname> <given-names>X.</given-names></name> <name><surname>Vaidya</surname> <given-names>J.</given-names></name> <name><surname>Zhu</surname> <given-names>M.</given-names></name></person-group> (<year>2003</year>). <article-title>Tools for privacy preserving distributed data mining</article-title>. <source>SIGKDD Explorat.</source> <volume>4</volume>, <fpage>28</fpage>&#x02013;<lpage>34</lpage>. <pub-id pub-id-type="doi">10.1145/772862.772867</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Colombo</surname> <given-names>P.</given-names></name> <name><surname>Ferrari</surname> <given-names>E.</given-names></name></person-group> (<year>2018</year>). <article-title>Access control enforcement within mqtt-based internet of things ecosystems</article-title>, in <source>Proceedings of the 23nd ACM on Symposium on Access Control Models and Technologies, SACMAT 2018</source> (<publisher-loc>Indianapolis, IN</publisher-loc>), <fpage>223</fpage>&#x02013;<lpage>234</lpage>. <pub-id pub-id-type="doi">10.1145/3205977.3205986</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Costan</surname> <given-names>V.</given-names></name> <name><surname>Devadas</surname> <given-names>S.</given-names></name></person-group> (<year>2016</year>). <source>Intel sgx Explained. Techinical Report, Cryptology ePrint Archive, Report 2016/086, 20 16</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="http://eprint.iacr.org">http://eprint.iacr.org</ext-link></citation></ref>
<ref id="B18">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Dwork</surname> <given-names>C.</given-names></name></person-group> (<year>2006</year>). <article-title>Differential privacy</article-title>, in <source>33rd International Colloquium on Automata, Languages and Programming- ICALP 2006</source> (<publisher-loc>Venice</publisher-loc>: <publisher-name>Springer-Verlag</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>12</lpage>.</citation></ref>
<ref id="B19">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>for Law Enforcement Cooperation</surname> <given-names>E. U. A.</given-names></name></person-group> (<year>2017</year>). <source>Internet Organised Crime Threat Assessment (iocta)</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.europol.europa.eu/activities-services/main-reports/internet-organised-crime-threat-assessment-iocta-2017">https://www.europol.europa.eu/activities-services/main-reports/internet-organised-crime-threat-assessment-iocta-2017</ext-link></citation></ref>
<ref id="B20">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Fredrikson</surname> <given-names>M.</given-names></name> <name><surname>Lantz</surname> <given-names>E.</given-names></name> <name><surname>Jha</surname> <given-names>S.</given-names></name> <name><surname>Lin</surname> <given-names>S.</given-names></name> <name><surname>Page</surname> <given-names>D.</given-names></name> <name><surname>Ristenpart</surname> <given-names>T.</given-names></name></person-group> (<year>2014</year>). <article-title>Privacy in pharmacogenetics: An end-to-end case study of personalized warfarin dosing</article-title>, in <source>23rd USENIX Security Symposium (USENIX Security 14)</source> (<publisher-loc>San Diego, CA</publisher-loc>: <publisher-name>USENIX Association</publisher-name>), <fpage>17</fpage>&#x02013;<lpage>32</lpage>. <pub-id pub-id-type="pmid">27077138</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="thesis"><person-group person-group-type="author"><name><surname>Gentry</surname> <given-names>C.</given-names></name></person-group> (<year>2009</year>). <source>A Fully Homomorphic Encryption Scheme</source>. Ph.D. thesis, <publisher-name>Stanford University</publisher-name>. Available online at: <ext-link ext-link-type="uri" xlink:href="http://crypto.stanford.edu/craig">crypto.stanford.edu/craig</ext-link></citation></ref>
<ref id="B22">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Golle</surname> <given-names>P.</given-names></name> <name><surname>Staddon</surname> <given-names>J.</given-names></name> <name><surname>Waters</surname> <given-names>B.</given-names></name></person-group> (<year>2004</year>). <article-title>Secure conjunctive keyword search over encrypted data</article-title>, in <source>Applied Cryptography and Network Security (ACNS 2004)</source> M. Jakobsson, M. Yung, and J. Zhou (<publisher-loc>Berlin, Heidelberg</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>31</fpage>&#x02013;<lpage>45</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-540-24852-1_3</pub-id></citation></ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Goodfellow</surname> <given-names>I. J.</given-names></name> <name><surname>Shlens</surname> <given-names>J.</given-names></name> <name><surname>Szegedy</surname> <given-names>C.</given-names></name></person-group> (<year>2014</year>). <article-title>Explaining and harnessing adversarial examples</article-title>. <source>arXiv[Preprint]. arXiv:1412.6572.</source></citation></ref>
<ref id="B24">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Hacigumus</surname> <given-names>H.</given-names></name> <name><surname>Iyer</surname> <given-names>B. R.</given-names></name> <name><surname>Li</surname> <given-names>C.</given-names></name> <name><surname>Mehrotra</surname> <given-names>S.</given-names></name></person-group> (<year>2002</year>). <article-title>Executing SQL over encrypted data in the database-service-provider model</article-title>. in <source>Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data</source> (<publisher-loc>Madison, WI</publisher-loc>), <fpage>216</fpage>&#x02013;<lpage>227</lpage>.</citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Heatherly</surname> <given-names>R.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Thuraisingham</surname> <given-names>B. M.</given-names></name></person-group> (<year>2013</year>). <article-title>Preventing private information inference attacks on social networks</article-title>. <source>IEEE Trans. Knowl. Data Eng.</source> <volume>25</volume>, <fpage>1849</fpage>&#x02013;<lpage>1862</lpage>. <pub-id pub-id-type="doi">10.1109/TKDE.2012.120</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>D. Y.</given-names></name> <name><surname>McCoy</surname> <given-names>D.</given-names></name> <name><surname>Aliapoulios</surname> <given-names>M. M.</given-names></name> <name><surname>Li</surname> <given-names>V. G.</given-names></name> <name><surname>Invernizzi</surname> <given-names>L.</given-names></name> <name><surname>Bursztein</surname> <given-names>E.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>Tracking ransomware end-to-end</article-title>, in <source>Tracking Ransomware End-to-end</source> (<publisher-loc>San Francisco, CA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>12</lpage>.</citation></ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Inan</surname> <given-names>A.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Bertino</surname> <given-names>E.</given-names></name> <name><surname>Scannapieco</surname> <given-names>M.</given-names></name></person-group> (<year>2008</year>). <article-title>A hybrid approach to private record linkage</article-title>. <source>IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008</source> <fpage>496</fpage>&#x02013;<lpage>505</lpage>. <pub-id pub-id-type="doi">10.1109/ICDE.2008.4497458</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Islam</surname> <given-names>M. S.</given-names></name> <name><surname>Kuzu</surname> <given-names>M.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name></person-group> (<year>2012</year>). <article-title>Access pattern disclosure on searchable encryption: Ramification, attack and mitigation</article-title>, in <source>19th Annual Network and Distributed System Security Symposium, NDSS 2012</source> (<publisher-loc>San Diego, CA</publisher-loc>).</citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kantarc&#x00131;o&#x0011F;lu</surname> <given-names>M.</given-names></name> <name><surname>Clifton</surname> <given-names>C.</given-names></name></person-group> (<year>2004</year>). <article-title>Privacy-preserving distributed mining of association rules on horizontally partitioned data</article-title>. <source>IEEE TKDE</source> <volume>16</volume>, <fpage>1026</fpage>&#x02013;<lpage>1037</lpage>. <pub-id pub-id-type="doi">10.1109/TKDE.2004.45</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kantarc&#x00131;o&#x0011F;lu</surname> <given-names>M.</given-names></name> <name><surname>Clifton</surname> <given-names>C.</given-names></name></person-group> (<year>2005</year>). <article-title>Security issues in querying encrypted data</article-title>, in <source>The 19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security</source> (<publisher-loc>Storrs, CT</publisher-loc>).</citation></ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Jiang</surname> <given-names>W.</given-names></name></person-group> (<year>2012</year>). <article-title>Incentive compatible privacy preserving data analysis</article-title>. <source>IEEE Transactions on Knowledge and Data Engineering</source> (IEEE), <fpage>1323</fpage>&#x02013;<lpage>1335</lpage>. <pub-id pub-id-type="doi">10.1109/TKDE.2012.61</pub-id></citation></ref>
<ref id="B32">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Nix</surname> <given-names>R.</given-names></name></person-group> (<year>2010</year>). <article-title>Incentive compatible distributed data mining</article-title>, in <source>Proceedings of the 2010 IEEE Second International Conference on Social Computing, SocialCom/IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2010, Minneapolis, Minnesota, USA, August 20-22, 2010</source>, eds <person-group person-group-type="editor"><name><surname>Elmagarmid</surname> <given-names>A. K.</given-names></name> <name><surname>Agrawal</surname> <given-names>D.</given-names></name></person-group> (<publisher-loc>Minneapolis, MN</publisher-loc>: <publisher-name>IEEE Computer Society</publisher-name>), <fpage>735</fpage>&#x02013;<lpage>742</lpage>. <pub-id pub-id-type="doi">10.1109/SocialCom.2010.114</pub-id></citation></ref>
<ref id="B33">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Xi</surname> <given-names>B.</given-names></name></person-group> (<year>2016</year>). <article-title>Adversarial data mining: Big data meets cyber security</article-title>, in <source>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security</source> (<publisher-loc>Vienna</publisher-loc>), <fpage>1866</fpage>&#x02013;<lpage>1867</lpage>. <pub-id pub-id-type="doi">10.1145/2976749.2976753</pub-id></citation></ref>
<ref id="B34">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kosba</surname> <given-names>A.</given-names></name> <name><surname>Miller</surname> <given-names>A.</given-names></name> <name><surname>Shi</surname> <given-names>E.</given-names></name> <name><surname>Wen</surname> <given-names>Z.</given-names></name> <name><surname>Papamanthou</surname> <given-names>C.</given-names></name></person-group> (<year>2016</year>). <article-title>Hawk: the blockchain model of cryptography and privacy-preserving smart contracts</article-title>, in <source>2016 IEEE Symposium on Security and Privacy (SP)</source> (<publisher-loc>San Jose, CA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>839</fpage>&#x02013;<lpage>858</lpage>. <pub-id pub-id-type="doi">10.1109/SP.2016.55</pub-id></citation></ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kosinski</surname> <given-names>M.</given-names></name> <name><surname>Stillwell</surname> <given-names>D.</given-names></name> <name><surname>Graepel</surname> <given-names>T.</given-names></name></person-group> (<year>2013</year>). <article-title>Private traits and attributes are predictable from digital records of human behavior</article-title>. <source>Proc. Natl. Acad. Sci. U.S.A.</source> <volume>110</volume>, <fpage>5802</fpage>&#x02013;<lpage>5805</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1218772110</pub-id><pub-id pub-id-type="pmid">23479631</pub-id></citation></ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kuzu</surname> <given-names>M.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Durham</surname> <given-names>E. A.</given-names></name> <name><surname>T&#x000F3;th</surname> <given-names>C.</given-names></name> <name><surname>Malin</surname> <given-names>B.</given-names></name></person-group> (<year>2013</year>). <article-title>A practical approach to achieve private medical record linkage in light of public resources</article-title>. <source>JAMIA</source> <volume>20</volume>, <fpage>285</fpage>&#x02013;<lpage>292</lpage>. <pub-id pub-id-type="doi">10.1136/amiajnl-2012-000917</pub-id><pub-id pub-id-type="pmid">22847304</pub-id></citation></ref>
<ref id="B37">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>MacDonald</surname> <given-names>N.</given-names></name></person-group> (<year>2012</year>). <source>Information Security is Becoming a Big Data Analytics Problem</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.gartner.com/doc/1960615/information-security-big-data-analytics">https://www.gartner.com/doc/1960615/information-security-big-data-analytics</ext-link> (Accessed Jul 15, 2018).</citation></ref>
<ref id="B38">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Manyika</surname> <given-names>J.</given-names></name> <name><surname>Chui</surname> <given-names>M.</given-names></name> <name><surname>Brown</surname> <given-names>B.</given-names></name> <name><surname>Bughin</surname> <given-names>J.</given-names></name> <name><surname>Dobbs</surname> <given-names>R.</given-names></name> <name><surname>Roxburgh</surname> <given-names>C.</given-names></name> <etal/></person-group>. (<year>2011</year>). <source>The Big Data: The Next Frontier for Innovation, Competition, and Productivity</source>. <publisher-name>Mckinsey &#x00026; Company</publisher-name>.</citation></ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>McSherry</surname> <given-names>F. D.</given-names></name></person-group> (<year>2009</year>). <article-title>Privacy integrated queries: an extensible platform for privacy-preserving data analysis</article-title>, in <source>SIGMOD</source>. (New York, NY), <fpage>19</fpage>&#x02013;<lpage>30</lpage>.</citation></ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Moser</surname> <given-names>M.</given-names></name> <name><surname>Bohme</surname> <given-names>R.</given-names></name> <name><surname>Breuker</surname> <given-names>D.</given-names></name></person-group> (<year>2013</year>). <article-title>An inquiry into money laundering tools in the bitcoin ecosystem</article-title>, in <source>eCrime Researchers Summit</source>, <fpage>1</fpage>&#x02013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.1109/eCRS.2013.6805780</pub-id></citation></ref>
<ref id="B41">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Nakamoto</surname> <given-names>S.</given-names></name></person-group> (<year>2008</year>). <source>Bitcoin: A Peer-to-Peer Electronic Cash System</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://bitcoin.org/bitcoin.pdf">https://bitcoin.org/bitcoin.pdf</ext-link></citation></ref>
<ref id="B42">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ohrimenko</surname> <given-names>O.</given-names></name> <name><surname>Schuster</surname> <given-names>F.</given-names></name> <name><surname>Fournet</surname> <given-names>C.</given-names></name> <name><surname>Mehta</surname> <given-names>A.</given-names></name> <name><surname>Nowozin</surname> <given-names>S.</given-names></name> <name><surname>Vaswani</surname> <given-names>K.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Oblivious multi-party machine learning on trusted processors</article-title>, in <source>25th USENIX Security Symposium (USENIX Security 16)</source> (<publisher-loc>Austin, TX</publisher-loc>: <publisher-name>USENIX Association</publisher-name>), <fpage>619</fpage>&#x02013;<lpage>636</lpage>.</citation></ref>
<ref id="B43">
<citation citation-type="web"><person-group person-group-type="author"><collab>Oracle</collab></person-group> (<year>2015</year>). <source>Access Control in Oracle</source>. Available online at:<ext-link ext-link-type="uri" xlink:href="http://goo.gl/cnwQVv">http://goo.gl/cnwQVv</ext-link></citation></ref>
<ref id="B44">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Papernot</surname> <given-names>N.</given-names></name> <name><surname>McDaniel</surname> <given-names>P. D.</given-names></name> <name><surname>Jha</surname> <given-names>S.</given-names></name> <name><surname>Fredrikson</surname> <given-names>M.</given-names></name> <name><surname>Celik</surname> <given-names>Z. B.</given-names></name> <name><surname>Swami</surname> <given-names>A.</given-names></name></person-group> (<year>2016</year>). <article-title>The limitations of deep learning in adversarial settings</article-title>, in <source>IEEE European Symposium on Security and Privacy, EuroS&#x00026;P 2016</source> (<publisher-loc>Saarbr&#x000FC;cken</publisher-loc>), <fpage>372</fpage>&#x02013;<lpage>387</lpage>. <pub-id pub-id-type="doi">10.1109/EuroSP.2016.36</pub-id></citation></ref>
<ref id="B45">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Pasarella</surname> <given-names>E.</given-names></name> <name><surname>Lobo</surname> <given-names>J.</given-names></name></person-group> (<year>2017</year>). <article-title>A datalog framework for modeling relationship-based access control policies</article-title>, in <source>Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, SACMAT 2017</source> (<publisher-loc>Indianapolis</publisher-loc>), <fpage>91</fpage>&#x02013;<lpage>102</lpage>. <pub-id pub-id-type="doi">10.1145/3078861.3078871</pub-id></citation></ref>
<ref id="B46">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Phetsouvanh</surname> <given-names>A. D. S.</given-names></name> <name><surname>Oggier</surname> <given-names>F.</given-names></name></person-group> (<year>2018</year>). <article-title>Egret: extortion graph exploration techniques in the bitcoin network</article-title>, in <source>IEEE ICDM Workshop on Data Mining in Networks (DaMNet)</source>.</citation></ref>
<ref id="B47">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Portnoff</surname> <given-names>R. S.</given-names></name> <name><surname>Huang</surname> <given-names>D. Y.</given-names></name> <name><surname>Doerfler</surname> <given-names>P.</given-names></name> <name><surname>Afroz</surname> <given-names>S.</given-names></name> <name><surname>McCoy</surname> <given-names>D.</given-names></name></person-group> (<year>2017</year>). <article-title>Backpage and bitcoin: Uncovering human traffickers</article-title>, in <source>Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source> (<publisher-loc>Halifax, NS</publisher-loc>), <fpage>1595</fpage>&#x02013;<lpage>1604</lpage>. <pub-id pub-id-type="doi">10.1145/3097983.3098082</pub-id></citation></ref>
<ref id="B48">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Prasser</surname> <given-names>F.</given-names></name> <name><surname>Gaupp</surname> <given-names>J.</given-names></name> <name><surname>Wan</surname> <given-names>Z.</given-names></name> <name><surname>Xia</surname> <given-names>W.</given-names></name> <name><surname>Vorobeychik</surname> <given-names>Y.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>An open source tool for game theoretic health data de-identification</article-title>, in <source>AMIA 2017, American Medical Informatics Association Annual Symposium</source> (<publisher-loc>Washington, DC</publisher-loc>). <pub-id pub-id-type="pmid">29854212</pub-id></citation></ref>
<ref id="B49">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ramachandran</surname> <given-names>A.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name></person-group> (<year>2018</year>). <article-title>Smartprovenance: a distributed, blockchain based dataprovenance system</article-title>, in <source>Proceedings of the Eighth ACM Conference on Data and Application Security and Privacy, CODASPY 2018</source> (<publisher-loc>Tempe, AZ</publisher-loc>), <fpage>35</fpage>&#x02013;<lpage>42</lpage>. <pub-id pub-id-type="doi">10.1145/3176258.3176333</pub-id></citation></ref>
<ref id="B50">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Schuster</surname> <given-names>F.</given-names></name> <name><surname>Costa</surname> <given-names>M.</given-names></name> <name><surname>Fournet</surname> <given-names>C.</given-names></name> <name><surname>Gkantsidis</surname> <given-names>C.</given-names></name> <name><surname>Peinado</surname> <given-names>M.</given-names></name> <name><surname>Mainar-Ruiz</surname> <given-names>G.</given-names></name> <etal/></person-group>. (<year>2015</year>). <article-title>Vc3: trustworthy data analytics in the cloud using sgx</article-title>, in <source>2015 IEEE Symposium on Security and Privacy (SP)</source> (<publisher-loc>San Jose, CA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>38</fpage>&#x02013;<lpage>54</lpage>. <pub-id pub-id-type="doi">10.1109/SP.2015.10</pub-id></citation></ref>
<ref id="B51">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Schwab</surname> <given-names>K.</given-names></name></person-group> (<year>2016</year>). <source>The Fourth Industrial Revolution</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="http://www3.weforum.org/docs/Media/KSC_4IR.pdf">http://www3.weforum.org/docs/Media/KSC_4IR.pdf</ext-link>. (Accessed on 10/17/2016)</citation></ref>
<ref id="B52">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Shaon</surname> <given-names>F.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name></person-group> (<year>2016</year>). <article-title>A practical framework for executing complex queries over encrypted multimedia data</article-title>, in <source>Proceedings on 30th Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy XXX DBSec 2016</source> (<publisher-loc>Trento</publisher-loc>), <fpage>179</fpage>&#x02013;<lpage>195</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-319-41483-6_14</pub-id></citation></ref>
<ref id="B53">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Shaon</surname> <given-names>F.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Lin</surname> <given-names>Z.</given-names></name> <name><surname>Khan</surname> <given-names>L.</given-names></name></person-group> (<year>2017</year>). <article-title>Sgx-bigmatrix: a practical encrypted data analytic framework with trusted processors</article-title>, in <source>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017</source> (<publisher-loc>Dallas, TX</publisher-loc>), <fpage>1211</fpage>&#x02013;<lpage>1228</lpage>. <pub-id pub-id-type="doi">10.1145/3133956.3134095</pub-id></citation></ref>
<ref id="B54">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Shi</surname> <given-names>E.</given-names></name> <name><surname>Bethencourt</surname> <given-names>J.</given-names></name> <name><surname>Chan</surname> <given-names>T.-H. H.</given-names></name> <name><surname>Song</surname> <given-names>D.</given-names></name> <name><surname>Perrig</surname> <given-names>A.</given-names></name></person-group> (<year>2007</year>). <article-title>Multi-dimensional range query over encrypted data</article-title>, in <source>SP &#x00027;07: Proceedings of the 2007 IEEE Symposium on Security and Privacy</source> (<publisher-loc>Washington, DC</publisher-loc>: <publisher-name>IEEE Computer Society</publisher-name>), <fpage>350</fpage>&#x02013;<lpage>364</lpage>.</citation></ref>
<ref id="B55">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Song</surname> <given-names>D. X.</given-names></name> <name><surname>Wagner</surname> <given-names>D.</given-names></name> <name><surname>Perrig</surname> <given-names>A.</given-names></name></person-group> (<year>2000</year>). <article-title>Practical techniques for searches on encrypted data</article-title>, in <source>IEEE SP</source> (<publisher-loc>Washington, DC</publisher-loc>), <fpage>44</fpage>&#x02013;<lpage>55</lpage>.</citation></ref>
<ref id="B56">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sweeney</surname> <given-names>L.</given-names></name></person-group> (<year>2013</year>). <article-title>Discrimination in online ad delivery</article-title>. <source>Commun. ACM</source> <volume>56</volume>, <fpage>44</fpage>&#x02013;<lpage>54</lpage>. <pub-id pub-id-type="doi">10.1145/2447976.2447990</pub-id></citation></ref>
<ref id="B57">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Szegedy</surname> <given-names>C.</given-names></name> <name><surname>Zaremba</surname> <given-names>W.</given-names></name> <name><surname>Sutskever</surname> <given-names>I.</given-names></name> <name><surname>Bruna</surname> <given-names>J.</given-names></name> <name><surname>Erhan</surname> <given-names>D.</given-names></name> <name><surname>Goodfellow</surname> <given-names>I. J.</given-names></name> <etal/></person-group>. (<year>2013</year>). <article-title>Intriguing properties of neural networks</article-title>. <source>arXiv[Preprint]. arXiv:1312.6199.</source></citation></ref>
<ref id="B58">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ulusoy</surname> <given-names>H.</given-names></name> <name><surname>Colombo</surname> <given-names>P.</given-names></name> <name><surname>Ferrari</surname> <given-names>E.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Pattuk</surname> <given-names>E.</given-names></name></person-group> (<year>2015a</year>). <article-title>Guardmr: fine-grained security policy enforcement for mapreduce systems</article-title>, in <source>Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, ASIA CCS</source> (<publisher-loc>Singapore</publisher-loc>), <fpage>285</fpage>&#x02013;<lpage>296</lpage>. <pub-id pub-id-type="doi">10.1145/2714576.2714624</pub-id></citation></ref>
<ref id="B59">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ulusoy</surname> <given-names>H.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Pattuk</surname> <given-names>E.</given-names></name> <name><surname>Kagal</surname> <given-names>L.</given-names></name></person-group> (<year>2015b</year>). <article-title>Accountablemr: toward accountable mapreduce systems</article-title>, in <source>2015 IEEE International Conference on Big Data, Big Data 2015</source> (<publisher-loc>Santa Clara, CA</publisher-loc>), <fpage>451</fpage>&#x02013;<lpage>460</lpage>. <pub-id pub-id-type="doi">10.1109/BigData.2015.7363786</pub-id></citation></ref>
<ref id="B60">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Vaidya</surname> <given-names>J.</given-names></name> <name><surname>Clifton</surname> <given-names>C.</given-names></name></person-group> (<year>2005</year>). <article-title>Privacy-preserving decision trees over vertically partitioned data</article-title>, in <source>The 19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security</source> (<publisher-loc>Storrs, CT</publisher-loc>: <publisher-name>Springer</publisher-name>).</citation></ref>
<ref id="B61">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Voigt</surname> <given-names>P.</given-names></name> <name><surname>Bussche</surname> <given-names>A. V. D.</given-names></name></person-group> (<year>2017</year>). <source>The EU General Data Protection Regulation (GDPR): A Practical Guide.</source> Springer Publishing Company, Incorporated.</citation></ref>
<ref id="B62">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zheng</surname> <given-names>W.</given-names></name> <name><surname>Dave</surname> <given-names>A.</given-names></name> <name><surname>Beekman</surname> <given-names>J.</given-names></name> <name><surname>Popa</surname> <given-names>R. A.</given-names></name> <name><surname>Gonzalez</surname> <given-names>J.</given-names></name> <name><surname>Stoica</surname> <given-names>I.</given-names></name></person-group> (<year>2017</year>). <article-title>Opaque: a data analytics platform with strong security</article-title>, in <source>14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17)</source> (<publisher-loc>Boston, MA</publisher-loc>: <publisher-name>USENIX Association</publisher-name>).</citation></ref>
<ref id="B63">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zhou</surname> <given-names>Y.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name></person-group> (<year>2016</year>). <article-title>Modeling adversarial learning as nested Stackelberg games</article-title>, in <source>Advances in Knowledge Discovery and Data Mining - 20th Pacific-Asia Conference, PAKDD 2016, Proceedings, Part II, vol. 9652 of Lecture Notes in Computer Science</source> eds <person-group person-group-type="editor"><name><surname>Bailey</surname> <given-names>J.</given-names></name> <name><surname>Khan</surname> <given-names>L.</given-names></name> <name><surname>Washio</surname> <given-names>T.</given-names></name> <name><surname>Dobbie</surname> <given-names>G.</given-names></name> <name><surname>Huang</surname> <given-names>J. Z.</given-names></name> <name><surname>Wang</surname> <given-names>R.</given-names></name></person-group> (<publisher-loc>Auckland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>350</fpage>&#x02013;<lpage>362</lpage>.</citation></ref>
<ref id="B64">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zhou</surname> <given-names>Y.</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M.</given-names></name> <name><surname>Thuraisingham</surname> <given-names>B.</given-names></name> <name><surname>Xi</surname> <given-names>B.</given-names></name></person-group> (<year>2012</year>). <article-title>Adversarial support vector machine learning</article-title>, in <source>Proceedings of the 18th ACM SIGKDD international Conference on Knowledge Discovery and Data Mining, KDD &#x00027;12</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>1059</fpage>&#x02013;<lpage>1067</lpage>. <pub-id pub-id-type="doi">10.1145/2339530.2339697</pub-id></citation></ref>
</ref-list>
<fn-group>
<fn id="fn0001"><p><sup>1</sup><ext-link ext-link-type="uri" xlink:href="https://datum.org">https://datum.org</ext-link></p></fn>
</fn-group>
<fn-group>
<fn fn-type="financial-disclosure"><p><bold>Funding.</bold> MK research was supported in part by NIH award 1R01HG006844, NSF awards CNS-1111529, CICI- 1547324, and IIS-1633331 and ARO award W911NF-17-1-0356.</p>
</fn>
</fn-group>
</back>
</article>