<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.2" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">futureinternet</journal-id>
      <journal-title-group>
        <journal-title>Future Internet</journal-title>
        <abbrev-journal-title abbrev-type="publisher">Future Internet</abbrev-journal-title>
        <abbrev-journal-title abbrev-type="pubmed">Future Internet</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="epub">1999-5903</issn>
      <publisher>
        <publisher-name>MDPI</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3390/fi13050117</article-id>
      <article-id pub-id-type="publisher-id">futureinternet-13-00117</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>H2O: Secure Interactions in IoT via Behavioral Fingerprinting</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="true">https://orcid.org/0000-0003-3543-2383</contrib-id>
          <name>
            <surname>Ferretti</surname>
            <given-names>Marco</given-names>
          </name>
          <xref rid="af1-futureinternet-13-00117" ref-type="aff">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="true">https://orcid.org/0000-0003-2719-9526</contrib-id>
          <name>
            <surname>Nicolazzo</surname>
            <given-names>Serena</given-names>
          </name>
          <xref rid="af2-futureinternet-13-00117" ref-type="aff">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="true">https://orcid.org/0000-0003-2120-2341</contrib-id>
          <name>
            <surname>Nocera</surname>
            <given-names>Antonino</given-names>
          </name>
          <xref rid="af1-futureinternet-13-00117" ref-type="aff">1</xref>
          <xref rid="c1-futureinternet-13-00117" ref-type="corresp">*</xref>
        </contrib>
      </contrib-group>
      <contrib-group>
        <contrib contrib-type="editor">
          <name>
            <surname>Lelli</surname>
            <given-names>Francesco</given-names>
          </name>
          <role>Academic Editor</role>
        </contrib>
        <contrib contrib-type="editor">
          <name>
            <surname>Modafferi</surname>
            <given-names>Stefano</given-names>
          </name>
          <role>Academic Editor</role>
        </contrib>
      </contrib-group>
      <aff id="af1-futureinternet-13-00117"><label>1</label>Department of Electrical, Computer and Biomedical Engineering, University of Pavia, 27100 Pavia PV, Italy; <email>marco.ferretti@unipv.it</email></aff>
      <aff id="af2-futureinternet-13-00117"><label>2</label>Daisy Laboratory, Polytechnic University of Marche, 60131 Ancona AN, Italy; <email>serena.nicolazzo.sn@gmail.com</email></aff>
      <author-notes>
        <corresp id="c1-futureinternet-13-00117"><label>*</label>Correspondence: <email>antonino.nocera@unipv.it</email></corresp>
      </author-notes>
      <pub-date pub-type="epub">
        <day>30</day>
        <month>04</month>
        <year>2021</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>05</month>
        <year>2021</year>
      </pub-date>
      <volume>13</volume>
      <issue>5</issue>
      <elocation-id>117</elocation-id>
      <history>
        <date date-type="received">
          <day>24</day>
          <month>03</month>
          <year>2021</year>
        </date>
        <date date-type="accepted">
          <day>28</day>
          <month>04</month>
          <year>2021</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>&#xA9; 2021 by the authors.</copyright-statement>
        <copyright-year>2021</copyright-year>
        <license license-type="open-access">
          <license-p>Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (<ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link>).</license-p>
        </license>
      </permissions>
      <abstract>
        <p>Sharing data and services in the Internet of Things (IoT) can give rise to significant security concerns with information being sensitive and vulnerable to attacks. In such an environment, objects can be either public resources or owned by humans. For this reason, the need of monitoring the reliability of all involved actors, both persons and smart objects, assuring that they really are who they claim to be, is becoming an essential property of the IoT, with the increase in the pervasive adoption of such a paradigm. In this paper, we tackle this problem by proposing a new framework, called H2O (Human to Object). Our solution is able to continuously authenticate an entity in the network, providing a reliability assessment mechanism based on behavioral fingerprinting. A detailed security analysis evaluates the robustness of the proposed protocol; furthermore, a performance analysis shows the feasibility of our approach.</p>
      </abstract>
      <kwd-group>
        <kwd>IoT</kwd>
        <kwd>Human to Object Network</kwd>
        <kwd>behavioral fingerprint</kwd>
        <kwd>reliability</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec sec-type="intro" id="sec1-futureinternet-13-00117">
      <title>1. Introduction</title>
      <p>In this new era where pervasiveness and ubiquity of smart things is becoming part of our every day life, the need of security mechanisms for protecting users and objects increases as well. Classical Internet of Things (hereafter, IoT) is characterized by heterogeneous and connected devices sharing data and providing services to fit people needs. From connected fridges, cars, and so forth to wearable devices for health-care, the IoT creates opportunities in numerous domains.</p>
      <p>With the adoption of this new paradigm the network can gain the capabilities of sensing information about the environment, collecting physiological measurements or operational data from sensors and identifying actors, such as: users, animals, events or other things in the environment. Moreover, as a result of the capability of handling data, new ways of processing, communicating and converting them into automated instructions enhance the power and autonomy of the IoT, eliminating the need of constant human interventions [<xref ref-type="bibr" rid="B1-futureinternet-13-00117">1</xref>].</p>
      <p>Clearly, in such a diverse, complex and heterogeneous ecosystem, numerous challenges arise. A crucial topic, which is currently interesting a lot of researchers, is entity continuous authentication to ensure reliable and secure communications between objects to humans, objects to objects and human to human [<xref ref-type="bibr" rid="B2-futureinternet-13-00117">2</xref>]. Each entity in the IoT must be able to clearly identify and authenticate other entities to assess that neither a user has been impersonated nor an object hacked, corrupted or stolen before staring any interaction.</p>
      <p>This is also important, in order to provide trust, confidentiality, integrity and availability of the information exchanged. Indeed, data sharing in IoT applications raises significant security concerns, with information being sensitive and vulnerable to attacks. For example, in an opportunistic trading scenario [<xref ref-type="bibr" rid="B3-futureinternet-13-00117">3</xref>], sensitive personal information such as user location, mobility patterns and preferences may be used for marketing. Whereas, in healthcare applications [<xref ref-type="bibr" rid="B4-futureinternet-13-00117">4</xref>,<xref ref-type="bibr" rid="B5-futureinternet-13-00117">5</xref>] very sensitive medical information about people are aggregated, analysed and exchanged by smart objects. In critical or monitored workplace environments, continuous surveillance can breach the privacy of employees [<xref ref-type="bibr" rid="B6-futureinternet-13-00117">6</xref>,<xref ref-type="bibr" rid="B7-futureinternet-13-00117">7</xref>]. Therefore, the guarantee to communicate with a reliable entity can protect the actors of the system from major security threats.</p>
      <p>However, this process can be very challenging because of the heterogeneous nature of the entities involved in the IoT, including people, devices with low capabilities in term of processors, memory and data storage and devices with higher capabilities.</p>
      <p>Typically, low-power devices differ from smarter ones also because they lack conventional user interfaces in the form of keyboards, mice, and touchscreens. This is due to reduce their cost, but also because often this kind of conventional interfaces are not suitable for the intended applications (think for instance to a smart fabric). Therefore, how objects are conceived and, consequently, how they behave in the IoT is peculiar of their capabilities and equipment and this increases the complexity of the above stated problem.</p>
      <p>To make some examples, wearable devices equipped with an inertial measurement unit (IMU) can support biometric authentication based on how people move their limbs throughout the time the device is used. Through machine learning techniques these patterns could be learnt and applied to continuously authenticate the user. In this way, a device could monitor its owner continuously and authenticate the person&#x2019;s legitimacy before allowing him to perform operations. Similarly, user echocardiogram (ECG) signals can be exploited by devices containing photoplethysmogram (PPG) sensor [<xref ref-type="bibr" rid="B8-futureinternet-13-00117">8</xref>]. Others more traditional biometrics-based user identification techniques rely on uniquely personalized features, such as: fingerprint [<xref ref-type="bibr" rid="B9-futureinternet-13-00117">9</xref>], iris [<xref ref-type="bibr" rid="B10-futureinternet-13-00117">10</xref>], or face [<xref ref-type="bibr" rid="B11-futureinternet-13-00117">11</xref>,<xref ref-type="bibr" rid="B12-futureinternet-13-00117">12</xref>]; and perform pattern recognition on these features to allow resources access to a user.</p>
      <p>Others object-to-human techniques to continuously identify persons leverage the way people interact with their smartphones and the available applications. Most users have regular behavioral patterns that can be modeled and exploited for continuous recognition of behavioral signatures [<xref ref-type="bibr" rid="B13-futureinternet-13-00117">13</xref>,<xref ref-type="bibr" rid="B14-futureinternet-13-00117">14</xref>]. Therefore, behavioral characteristics of mobile users can allow continuous authentication of a user on a personal device.</p>
      <p>On the other hand, also object-to-object communications should be continuously authenticated in the IoT in order to prevent security issues. Typically, remote attestation is a security service through which an object can ascertain the current state of a potentially compromised remote device before interacting with it. Remote attestation includes a variety of algorithms that range from heavy-weight secure hardware-based techniques, to light-weight software-based ones (e.g., control-flow integrity) [<xref ref-type="bibr" rid="B15-futureinternet-13-00117">15</xref>]. Previous works leverage cryptographic primitives or authentication mechanisms [<xref ref-type="bibr" rid="B16-futureinternet-13-00117">16</xref>,<xref ref-type="bibr" rid="B17-futureinternet-13-00117">17</xref>,<xref ref-type="bibr" rid="B18-futureinternet-13-00117">18</xref>], but, typically, they are computational demanding and rely on the robustness and validity of cryptographic keys.</p>
      <p>Also in the field of human-to-human communications, the problem of fake identities and identity theft are issues whose relevance is increasing, especially in the social network domain [<xref ref-type="bibr" rid="B19-futureinternet-13-00117">19</xref>]. Researchers often refer to this branch of security as trust and reputation management, essential for establishing an efficient collaboration among a network of participants that might not have sufficient prior knowledge about each other [<xref ref-type="bibr" rid="B20-futureinternet-13-00117">20</xref>].</p>
      <p>Due to these intrinsic differences of IoT entities, an effective method to provide objects and humans with the possibility to continuously and unobtrusively authenticate each others in the network is a demanding task and, to the best of our knowledge, a unique approach for all the entities to assess the reliability of an object or a person owning an object has not been found yet.</p>
      <p>To tackle the above issues, we designed a complete framework, called H2O (Human To Object). The environment of our system is a classical IoT network, where persons interact with objects (with low or high computational capabilities) to exchange information or get services. The IoT network can be divided in some subgroups, namely the <inline-formula><mml:math id="mm1" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> (the personal area network of a user, composed of all the objects owned by the user himself) and the <inline-formula><mml:math id="mm2" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> (the set of smart public things). Moreover, the objects can be divided also according to their computational capabilities.</p>
      <p>All the objects of the network have a profile describing what they usually do (how they interact with the environment) and some patterns of communication (both with other objects and humans). The recent scientific literature in the context of IoT contains several approaches to computing behavioral fingerprints [<xref ref-type="bibr" rid="B8-futureinternet-13-00117">8</xref>,<xref ref-type="bibr" rid="B21-futureinternet-13-00117">21</xref>,<xref ref-type="bibr" rid="B22-futureinternet-13-00117">22</xref>,<xref ref-type="bibr" rid="B23-futureinternet-13-00117">23</xref>]. Fingerprint is used to analyze the current behavior of an object and to assess whether it is congruent with the expected one. Moreover, our approach is collaborative, hence if a node wants to create a new relationship with another one for which it has no fingerprint, it can rely on the knowledge of its neighbors. In particular, it can query its peers to receive information about the new node. According to <italic>(i)</italic> the number of answers received from them, <italic>(ii)</italic> the expressed opinions, and <italic>(iii)</italic> the relationship the querying node has with each of them, a reliability assessment towards the unknown node can be performed. Following this evaluation, the node can decide whether to interact or not with the new node.</p>
      <p>In our approach, also human-to-human interactions can be certified with a certain degree of reliability. This step is performed through continuous authentication techniques an object can provide to its owner. Therefore, when a human wants to interact with a person he has never met before, at the start of the communication, he will need some evidence of his identity. This proof can be produced by the objects held by the second person. Moreover, the objects belonging to a <inline-formula><mml:math id="mm3" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> can cooperate to provide a score for their owner in case of need. Indeed, if an object is not equipped with a way to authenticate its owner through a biometric mechanism, it can rely on the members of the <inline-formula><mml:math id="mm4" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> network it belongs to. Of course, the reliability of the object, providing the information about its owner identity, can be assessed through the aforementioned object-to-object solution.</p>
      <p>Therefore, in our approach, the intrinsic heterogeneity of a IoT network turns out to be a strength rather than a limitation, and it can be exploited to find a homogeneous solution to certify the real identity of a network entity.</p>
      <p>In summary, we can list the main contributions and the novelty of our approach as follows:<list list-type="bullet"><list-item><p>we provide a unified network, called H2O, in which each entity, either an object or a human, can estimate the reliability of its/his contacts.</p></list-item><list-item><p>we provide an approach leveraging state-of-the-art behavioral fingerprint techniques allowing an object to assess if another one (which it usually interacts with) has been hacked or is corrupted, before starting a communication.</p></list-item><list-item><p>we provide a consensus-based collaborative approach to allow an object to assess if another object (never met before) is reliable.</p></list-item><list-item><p>we provide a strategy based on a combination of object-to-object fingerprinting and human-to-object biometrics techniques to allow a human to assess if another human (never met before) is who he claims to be.</p></list-item></list></p>
      <p>This paper is organized as follows. <xref ref-type="sec" rid="sec2-futureinternet-13-00117">Section 2</xref> presents the works related to our approach. <xref ref-type="sec" rid="sec3-futureinternet-13-00117">Section 3</xref> describes the general model underlying H2O framework. <xref ref-type="sec" rid="sec4-futureinternet-13-00117">Section 4</xref> provides the detail of the proposed strategy for computing objects and humans reliability through the behavioral fingerprint of objects. <xref ref-type="sec" rid="sec5-futureinternet-13-00117">Section 5</xref> sketches the experimental campaign carried out to evaluate the performance of our approach, whereas <xref ref-type="sec" rid="sec6-futureinternet-13-00117">Section 6</xref> is devoted to illustrate the security model conceived for our framework, along with the analysis of the corresponding security properties. Finally, <xref ref-type="sec" rid="sec7-futureinternet-13-00117">Section 7</xref> concludes the work and outlines future directions.</p>
    </sec>
    <sec id="sec2-futureinternet-13-00117">
      <title>2. Related Works</title>
      <p>This section is devoted to the analysis of the scientific literature related to our H2O framework. Many works have been proposed in the context of reliable human-to-human, human-to-object and object-to-object interactions. Hence, for the sake of clarity, we divide this section in four parts. The former is related to human-to-object approaches devoted to the assessment of people reliability by leveraging object capabilities. In this context, research on continuous authentication based on biometrics is analysed in details. The second subsection, instead, deals with reliability in network of objects and surveys the scientific literature about remote attestation, device fingerprinting, and approaches relying on the Blockchain technology. The third part of this section focuses on the approaches tackling the problem of assessing the reliability of a person in a network of humans. In particular, we analyze proposals in the context of reliability and trust in Social Networks. Finally, we list in <xref ref-type="table" rid="futureinternet-13-00117-t001">Table 1</xref> the capabilities of the related approaches, in terms of the relationships considered to define a reliability measure, and compare them with our strategy.</p>
      <sec id="sec2dot1-futureinternet-13-00117">
        <title>2.1. Human-to-Object Approaches</title>
        <p>Although continuous authentication is a relatively new type of verification, it is gaining attention of researchers and companies seeking new forms to protect sensitive data for unauthorized access [<xref ref-type="bibr" rid="B2-futureinternet-13-00117">2</xref>]. Basically, continuous authentication performs an ongoing monitoring of user interactions with objects and builds a behavior or biometrics profile leveraging Machine Learning (ML) technology to re-verify the legitimacy of the connected nodes and assure cybersecurity protection.</p>
        <p>The application of this new form of authentication is advantageous also when traditional forms of verification do not fit the appropriate level of security. Indeed, <italic>(i)</italic> single-factor authentication, which provides protection at login, and <italic>(ii)</italic> two-factor authentication, which adds a second device for security check at the login phase, do not offer continuous validation of a user&#x2019;s identification.</p>
        <p>With the aim to balance security and usability, biometric approaches are gaining momentum. Given the nature of IoT devices and their closeness to users, using them for continuous authentication purposes is specially attractive [<xref ref-type="bibr" rid="B24-futureinternet-13-00117">24</xref>]. For example, smart mobile devices like smartphones and tablets are equipped with various built-in sensors like camera for iris recognition, heart-bit sensor, fingerprint scanner and microphone for voice recognition among others. But if on one hand, they are more secure, since biometric traits like iris or face are difficult to be reproduced, on another this type of authentication may provide also false positives and true negatives [<xref ref-type="bibr" rid="B25-futureinternet-13-00117">25</xref>].</p>
        <p>The authors of [<xref ref-type="bibr" rid="B26-futureinternet-13-00117">26</xref>] identify two categories of biometric identification: physiological identification and behavioral one. The former includes facial, voice and fingerprint recognition, which are mostly device dependent mechanisms and require costly processing units. The latter is a form of continuous identification which is based on behavioral traits and is less intrusive, because it relies on human habitual patterns like typing [<xref ref-type="bibr" rid="B27-futureinternet-13-00117">27</xref>,<xref ref-type="bibr" rid="B28-futureinternet-13-00117">28</xref>], walking [<xref ref-type="bibr" rid="B29-futureinternet-13-00117">29</xref>], social interactions and communication.</p>
        <p>In [<xref ref-type="bibr" rid="B8-futureinternet-13-00117">8</xref>] the authors describe WifiU, a Wi-Fi based human authentication system which recognizes users extracting unique biometrics information from Wi-Fi signals and uses it to perform human authentication. In particular, it is based on user gait. Indeed, the authors start from the consideration that, Wi-Fi signal reflected by the human body generates unique, although small, variations in wireless channel metrics on the receiver, due to the well-known multipath effect of wireless signals.</p>
        <p>A recent trend analysed by a number of researchers deals with continuous identification of users on mobile devices within the social IoT paradigm [<xref ref-type="bibr" rid="B13-futureinternet-13-00117">13</xref>,<xref ref-type="bibr" rid="B14-futureinternet-13-00117">14</xref>]. In particular, in [<xref ref-type="bibr" rid="B14-futureinternet-13-00117">14</xref>] the authors propose a scheme based on online behaviometrics of mobile users collected via smartphones. This scheme is able to extract features from smartphone sensors and users&#x2019; social network interactions. In [<xref ref-type="bibr" rid="B13-futureinternet-13-00117">13</xref>], instead, the authors propose a mobile behaviometric framework that assesses users&#x2019; social activity, and introduce sociability metrics to generate signatures of users&#x2019; activities.</p>
        <p>The papers cited above aim at continuously authenticating the user by exploiting his interactions with IoT devices or against third parties. With respect to these approaches, our proposals has a more extended objective. Indeed, with the aim of enabling reliable human-to-human interactions, our framework leverages some of the strategies described in this section to obtain continuous authentication of humans with their objects. Moreover, we develop an advanced mechanism to constantly verify whether the identity of an object or a human is unchanged.</p>
      </sec>
      <sec id="sec2dot2-futureinternet-13-00117">
        <title>2.2. Object-to-Object Approaches</title>
        <p>Typically, we refer to remote attestation as the security service through which an object can ascertain the current state of a potentially compromised remote device before interacting with it. The aim of remote attestation is to allow a remote system (i.e., challenger) to check the level of trust of another system (i.e., attestator). In [<xref ref-type="bibr" rid="B30-futureinternet-13-00117">30</xref>], the authors present a Multiple-Tier Remote Attestation protocol, called MTRA, verifying program integrity in IoT devices. In particular, more powerful devices are monitored by means of trusted hardware through a Trusted Platform Module (TPM), while less capable ones are verified leveraging a software-based attestation. Still in this context, the paper presented in [<xref ref-type="bibr" rid="B31-futureinternet-13-00117">31</xref>] describes a many-to-one attestation scheme for device swarms, which reduces the possibility of single point of failure verifier typical of architectures in which a single node (i.e., the verifier) has to attest the reliability of multiple IoT devices.</p>
        <p>Other works focusing on object-to-object interaction study a way to address the challenge of IoT device identification [<xref ref-type="bibr" rid="B8-futureinternet-13-00117">8</xref>,<xref ref-type="bibr" rid="B21-futureinternet-13-00117">21</xref>,<xref ref-type="bibr" rid="B22-futureinternet-13-00117">22</xref>,<xref ref-type="bibr" rid="B23-futureinternet-13-00117">23</xref>,<xref ref-type="bibr" rid="B32-futureinternet-13-00117">32</xref>,<xref ref-type="bibr" rid="B33-futureinternet-13-00117">33</xref>]. These works leverage the concept of device fingerprinting, that is a way to identify an object not relying on its classical network identities, such as IP or MAC address, but exploiting the information from the packets which the device exchanges over the network. In particular, the work presented in [<xref ref-type="bibr" rid="B21-futureinternet-13-00117">21</xref>] tackles this issue by analyzing a sequence of packets from high-level network traffic and extracting from it a set of unique flow-based features to create a fingerprint for each device through machine learning techniques. The authors of [<xref ref-type="bibr" rid="B23-futureinternet-13-00117">23</xref>] have the same goals, but they base their proposal on deep learning techniques. Whereas, the authors of [<xref ref-type="bibr" rid="B22-futureinternet-13-00117">22</xref>] present an approach called IoT Sentinel able to automatically identifying vulnerable devices being connected to an IoT network and enforcing mitigation measures for them, so as to minimize damage resulting from their compromise. Also the proposal presented in [<xref ref-type="bibr" rid="B32-futureinternet-13-00117">32</xref>] provides an IoT device identification method that models the behavior of the network packets communicated by the devices.</p>
        <p>In the context of object-to-object interaction, a related concept is the definition of reliability and trust among things. However, due to the highly dynamic nature of the network and the large number of entities with heterogeneous computation abilities involved, it is difficult to directly apply to IoT classical approaches thought for sensor or P2P networks [<xref ref-type="bibr" rid="B16-futureinternet-13-00117">16</xref>,<xref ref-type="bibr" rid="B34-futureinternet-13-00117">34</xref>,<xref ref-type="bibr" rid="B35-futureinternet-13-00117">35</xref>,<xref ref-type="bibr" rid="B36-futureinternet-13-00117">36</xref>].</p>
        <p>In particular, works leveraging cryptographic primitives [<xref ref-type="bibr" rid="B16-futureinternet-13-00117">16</xref>,<xref ref-type="bibr" rid="B17-futureinternet-13-00117">17</xref>,<xref ref-type="bibr" rid="B36-futureinternet-13-00117">36</xref>] are computational demanding and they are not secure against internal malicious nodes having the valid cryptographic keys. On the other hand, nodes can be hacked or compromised, but they can also have hardware faults, and relying only on cryptographic mechanisms does not lead to the exclusion of these nodes from the network.</p>
        <p>In [<xref ref-type="bibr" rid="B35-futureinternet-13-00117">35</xref>], the authors describe an approach based on cryptographic primitives in which each entity has a unique and trustworthy identity. In addition, a trusted device evaluates the behavior and the performance of the nodes comparing a saved trust metric and the indirect information from a third node. In [<xref ref-type="bibr" rid="B37-futureinternet-13-00117">37</xref>], the authors present IoTrust a trust architecture with a middleware layer performing authorization. The main drawback of these two schemes is that they are based on an external and reliable level that computes node reputation score. Furthermore, they defend only against some kind of attacks, such as: modification, replay, and message dropping attacks.</p>
        <p>The proposals of [<xref ref-type="bibr" rid="B38-futureinternet-13-00117">38</xref>,<xref ref-type="bibr" rid="B39-futureinternet-13-00117">39</xref>,<xref ref-type="bibr" rid="B40-futureinternet-13-00117">40</xref>] are based on Blockchain technology to provide forms of trust or authentication in a IoT network. In particular, in [<xref ref-type="bibr" rid="B38-futureinternet-13-00117">38</xref>] the authors describe an Obligation Chain containing obligations generated by a number of nodes, called Service Consumers, which are first locally accepted by Service Providers and, then, shared to the rest of the network. This kind of framework is based on Islands of Trust, portion of the network where the trust is regulated by a full local PKI and Certification Authority. Also the approach in [<xref ref-type="bibr" rid="B40-futureinternet-13-00117">40</xref>] relies on the security advantages provided by Blockchains, creating secure virtual zones (bubbles) where things can identify and trust each other. Moreover, although Blockchain technology provides decentralized security and privacy, it involves significant energy, delay, and computational overhead, not suitable for most resource-constrained IoT devices.</p>
        <p>A new perspective of Internet of Things is provided by [<xref ref-type="bibr" rid="B41-futureinternet-13-00117">41</xref>], that introduces the Social Internet of Things (hereafter, SIoT). This paradigm redefines the relationships among objects putting into evidence objects autonomy. Things can navigate through the network to find resources and services of their interest, provided by other things, without human intervention. The formalization of methods and technologies allowing an object to crawl the network for finding other (possibly heterogeneous) objects and the analysis of the new social graphs thus obtained are two aspects analyzed in [<xref ref-type="bibr" rid="B42-futureinternet-13-00117">42</xref>]. A step forward is done by [<xref ref-type="bibr" rid="B43-futureinternet-13-00117">43</xref>], in which the authors investigate the trustworthiness management of a SIot starting from the concepts coming from P2P and social networks. They combine two models, such as a subjective and an objective one. In the former model, each node computes the trustworthiness of its friends on the basis of its own experience and on the opinion of the friends in common with the potential service providers. In the latter model, the information about each node is distributed and stored making use of a distributed hash table structure, so that any node in the network can make use of the same information.</p>
        <p>Finally, the approach proposed in [<xref ref-type="bibr" rid="B44-futureinternet-13-00117">44</xref>] deals with object reliability in a Multiple Internet of Things, defining also a profile for an object. Differently from our approach, the principle underlying the reliability of an instance in a MIoT is that it is directly proportional to: <italic>(i)</italic> the fraction of successful transactions performed by the instances, and <italic>(ii)</italic> the reliability of the corresponding objects.</p>
        <p>It is worth observing that, our proposal exploits some of the concepts and strategies proposed by the approaches presented in this section. However, while these related solutions leverage direct interactions to compute objects reliability, our H2O scheme enhances machine-learning based fingerprinting with a consensus-based strategy to enable a wisdom-of-crowd attestation of objects behavior. In our paper, we define an object profile made up by different properties. These properties are object features related to how it usually interacts with other entities, the environment or its owner. A profile can be used as input of a machine learning solution, which computes a behavioral fingerprint for an object. This is the former step of our scheme, whose goal is to provide a complete framework equipping all entities involved (both objects and humans) with a mechanism to compute the reliability of their peers.</p>
      </sec>
      <sec id="sec2dot3-futureinternet-13-00117">
        <title>2.3. Human-to-Human Approaches</title>
        <p>The problem of assessing reliability on a network of humans is a crucial task both in real and virtual world [<xref ref-type="bibr" rid="B45-futureinternet-13-00117">45</xref>,<xref ref-type="bibr" rid="B46-futureinternet-13-00117">46</xref>]. Typical solutions for identity deception attacks rely on legitimate community members and administrators, who are called to manually identify malicious accounts or persons [<xref ref-type="bibr" rid="B47-futureinternet-13-00117">47</xref>]. The approach presented in [<xref ref-type="bibr" rid="B19-futureinternet-13-00117">19</xref>] aims at computing a level of trust for each node of a network of humans on the basis of neighborhood recognition and behavioral biometric support. It describes keystroke dynamics as solution for continuous authentication for enhancing trust in social networks, in particular, biometric data are exploited as a feedback to a trust model to measure the trustworthiness of an online profile.</p>
        <p>Trust in social networks is an extremely discussed topic, and often the boundaries between the real and virtual world are blurred in such a way that some approaches useful to compute trust between two persons in the real world can benefit measures and techniques coming from the virtual world, and vice-versa [<xref ref-type="bibr" rid="B48-futureinternet-13-00117">48</xref>]. Indeed, authors of [<xref ref-type="bibr" rid="B49-futureinternet-13-00117">49</xref>] state that the trust results in different communication behaviors among persons, this means that trusted communications are statistically different from random ones, and detecting trust-like behaviors allows researchers to develop a quantitative measure of who trusts whom in the network. In this context, the authors of [<xref ref-type="bibr" rid="B50-futureinternet-13-00117">50</xref>] describe a model of a trust-based recommendation system which has the goal of filtering information for agents based on the agents&#x2019; social network and trust relationships, thus providing recommendations for real entities through virtual ones.</p>
        <p>Differently from these approaches, our work provides human-to-human reliable communications, by ensuring a degree of reliability. Therefore, when a human wants to interact with a peer never met before, he will need some evidence of his identity, at the start of the communication. This proof can be produced by the combination of the assessment of an object owned by the second person and the continuous authentication technique an object can provide its owner with.</p>
      </sec>
      <sec id="sec2dot4-futureinternet-13-00117">
        <title>2.4. Comparison with Related Approaches</title>
        <p>In this subsection, we summarize in <xref ref-type="table" rid="futureinternet-13-00117-t001">Table 1</xref> the comparison with all the works introduced in the previous sections. Specifically, we evaluate and compare all the approaches on the basis of the typology of relationship that they consider, namely:<list list-type="bullet"><list-item><p>H-O: the cited article deals with an approach to compute the reliability of a person through an object or in the communication with an object;</p></list-item><list-item><p>O-O: the considered paper proposes a method to assess the reliability of an object towards another object or in a network of objects.</p></list-item><list-item><p>H-H: the cited approach proposes a scheme to assess the reliability of human-to-human communication;</p></list-item></list></p>
        <p>The symbol &#x2018;x&#x2019; denotes that the cited paper provides the corresponding property.</p>
        <table-wrap id="futureinternet-13-00117-t001" position="float">
          <object-id pub-id-type="pii">futureinternet-13-00117-t001_Table 1</object-id>
          <label>Table 1</label>
          <caption>
            <p>Comparison of our approach with related ones.</p>
          </caption>
          <table>
            <thead>
              <tr>
                <th align="left" valign="middle" style="border-bottom:solid thin;border-top:solid thin">Approach</th>
                <th align="left" valign="middle" style="border-bottom:solid thin;border-top:solid thin">Approach Type</th>
                <th align="center" valign="middle" style="border-bottom:solid thin;border-top:solid thin">H-O</th>
                <th align="center" valign="middle" style="border-bottom:solid thin;border-top:solid thin">O-O</th>
                <th align="center" valign="middle" style="border-bottom:solid thin;border-top:solid thin">H-H</th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td align="left" valign="middle">Our approach</td>
                <td align="left" valign="middle">Fingerprint, Biometrics, Consensus</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">x</td>
              </tr>
              <tr>
                <td align="left" valign="middle">[<xref ref-type="bibr" rid="B8-futureinternet-13-00117">8</xref>,<xref ref-type="bibr" rid="B27-futureinternet-13-00117">27</xref>,<xref ref-type="bibr" rid="B28-futureinternet-13-00117">28</xref>,<xref ref-type="bibr" rid="B29-futureinternet-13-00117">29</xref>]</td>
                <td align="left" valign="middle">Biometrics</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">-</td>
              </tr>
              <tr>
                <td align="left" valign="middle">[<xref ref-type="bibr" rid="B13-futureinternet-13-00117">13</xref>,<xref ref-type="bibr" rid="B14-futureinternet-13-00117">14</xref>]</td>
                <td align="left" valign="middle">Behaviometrics</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">-</td>
              </tr>
              <tr>
                <td align="left" valign="middle">[<xref ref-type="bibr" rid="B30-futureinternet-13-00117">30</xref>,<xref ref-type="bibr" rid="B31-futureinternet-13-00117">31</xref>]</td>
                <td align="left" valign="middle">Remote Attestation</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">-</td>
              </tr>
              <tr>
                <td align="left" valign="middle">[<xref ref-type="bibr" rid="B21-futureinternet-13-00117">21</xref>,<xref ref-type="bibr" rid="B22-futureinternet-13-00117">22</xref>,<xref ref-type="bibr" rid="B23-futureinternet-13-00117">23</xref>,<xref ref-type="bibr" rid="B32-futureinternet-13-00117">32</xref>,<xref ref-type="bibr" rid="B44-futureinternet-13-00117">44</xref>]</td>
                <td align="left" valign="middle">Device Fingerprint</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">-</td>
              </tr>
              <tr>
                <td align="left" valign="middle">[<xref ref-type="bibr" rid="B16-futureinternet-13-00117">16</xref>,<xref ref-type="bibr" rid="B17-futureinternet-13-00117">17</xref>,<xref ref-type="bibr" rid="B35-futureinternet-13-00117">35</xref>,<xref ref-type="bibr" rid="B36-futureinternet-13-00117">36</xref>,<xref ref-type="bibr" rid="B37-futureinternet-13-00117">37</xref>]</td>
                <td align="left" valign="middle">Cryptographic</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">-</td>
              </tr>
              <tr>
                <td align="left" valign="middle">[<xref ref-type="bibr" rid="B38-futureinternet-13-00117">38</xref>,<xref ref-type="bibr" rid="B39-futureinternet-13-00117">39</xref>,<xref ref-type="bibr" rid="B40-futureinternet-13-00117">40</xref>]</td>
                <td align="left" valign="middle">Blockchain</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">-</td>
              </tr>
              <tr>
                <td align="left" valign="middle">[<xref ref-type="bibr" rid="B43-futureinternet-13-00117">43</xref>]</td>
                <td align="left" valign="middle">Social Network</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">x</td>
                <td align="center" valign="middle">-</td>
              </tr>
              <tr>
                <td align="left" valign="middle">[<xref ref-type="bibr" rid="B19-futureinternet-13-00117">19</xref>]</td>
                <td align="left" valign="middle">Social Network and Biometrics</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">-</td>
                <td align="center" valign="middle">x</td>
              </tr>
              <tr>
                <td align="left" valign="middle" style="border-bottom:solid thin">[<xref ref-type="bibr" rid="B50-futureinternet-13-00117">50</xref>]</td>
                <td align="left" valign="middle" style="border-bottom:solid thin">Social Network and Agent</td>
                <td align="center" valign="middle" style="border-bottom:solid thin">-</td>
                <td align="center" valign="middle" style="border-bottom:solid thin">-</td>
                <td align="center" valign="middle" style="border-bottom:solid thin">x</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
    </sec>
    <sec id="sec3-futureinternet-13-00117">
      <title>3. General Model</title>
      <p>In this section, we describe the general model adopted by our approach and the main actors involved in. <xref ref-type="table" rid="futureinternet-13-00117-t002">Table 2</xref> reports the abbreviations used throughout this paper.</p>
      <p>In the classical definition of the Internet of Things (hereafter, IoT) the network is represented as a graph <inline-formula><mml:math id="mm5" display="block"><mml:semantics><mml:mrow><mml:mi>G</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2329;</mml:mo><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>E</mml:mi><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>, where <italic>N</italic> is a set of nodes representing objects and <italic>E</italic> is a set of edges representing relationships between pairs of objects. An edge is built if two objects got in touch somewhere in the past and exchanged some messages. Usually a directed graph is considered, so that an edge direction identifies the destination of the communication. We can define the set of neighbors of a node <inline-formula><mml:math id="mm6" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> as the set <inline-formula><mml:math id="mm7" display="block"><mml:semantics><mml:mrow><mml:mo>&#x393;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">{</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>G</mml:mi><mml:mo>:</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">}</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula>.</p>
      <p>In our model, <italic>N</italic> is partitioned into two subsets:<list list-type="bullet"><list-item><p>The set of objects belonging to a person (denoted by <inline-formula><mml:math id="mm8" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>). All the objects belonging to this group maintain permanent physical contact with the same user during usage. This set is composed of various personal devices, that can form groups with each other when they are equipped with the short-range communication and sensing modules. Some examples are, for instance, mobile phones, PDAs and wearable devices, such as: human activity trackers, ECG readers, smartwatches, and semi-permanent insulin pumps.</p></list-item><list-item><p>The set of nodes of public use in the environment (denoted by <inline-formula><mml:math id="mm9" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>). This kind of objects are not related to humans, but can be accessed by anyone in the environment (e.g., printers or video surveillance cameras, smart multimedia object, and so forth [<xref ref-type="bibr" rid="B51-futureinternet-13-00117">51</xref>]).</p></list-item></list></p>
      <p>Moreover, a further classification, based on the processing and memory capabilities of an object, is possible. Therefore, we can divide the network in the following two groups:<list list-type="bullet"><list-item><p>The set of nodes with high processing and memory capabilities. If these objects are of public use in the environment, they will be denoted as <inline-formula><mml:math id="mm10" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>, whereas, if they belong to a <inline-formula><mml:math id="mm11" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>, they will be denoted as <inline-formula><mml:math id="mm12" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>. These nodes can process machine learning models and/or train classifiers for various tasks. Also smart devices that can leverage Cloud solutions to handle complex algorithms [<xref ref-type="bibr" rid="B52-futureinternet-13-00117">52</xref>] belong to this category.</p></list-item><list-item><p>The set of nodes with low capabilities. If these objects are of public use in the environment, they will be denoted as <inline-formula><mml:math id="mm13" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>, whereas, if they belong to a <inline-formula><mml:math id="mm14" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>, they will be denoted as <inline-formula><mml:math id="mm15" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>. These devices have low computational resources and are not suitable to work with machine learning solutions. Some examples are intelligent thermostats, remotely controllable household equipment, and weather-based automated lawn irrigation systems.</p></list-item></list></p>
      <p><xref ref-type="fig" rid="futureinternet-13-00117-f001">Figure 1</xref> shows a graphical representation of our scenario with the above subgroups involved. In particular, two users, namely Hope and Chad and their PANs, are depicted.</p>
      <p>Smart objects, even belonging to the different groups, can communicate with each other. Transactions can be performed to share data or to require measures/services offered by target smart objects. <xref ref-type="fig" rid="futureinternet-13-00117-f002">Figure 2</xref> shows a graphical representation of possible communications in our scenario deployed in a smart office.</p>
      <p>The main idea underlying our approach is that an object in the H2O network, when getting in touch with another object, can compare its behavior by exploiting a behavioral model [<xref ref-type="bibr" rid="B53-futureinternet-13-00117">53</xref>]. Through this comparison, it can state if the object it wants to communicate with is reliable or not.</p>
      <p>From the IoT scientific literature, we know that objects can have three different levels of sensing capabilities, namely: user awareness, ambient awareness, and social awareness [<xref ref-type="bibr" rid="B54-futureinternet-13-00117">54</xref>]. In our context, the definition of such capabilities can be declined as follows:<list list-type="bullet"><list-item><p><italic>Owner awareness</italic> refers to the smart object ability to understand personal contexts and behavioral patterns (e.g., human mobility, human activity, preferences, etc.) referred to its owner. Observe that, for the <inline-formula><mml:math id="mm16" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm17" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> groups, we can use the term <italic>Human awareness</italic> instead of <italic>Owner awareness</italic>, because these objects can be used by more than one person in the network.</p></list-item><list-item><p><italic>Environment awareness</italic> concerns the capability of smart objects to derive information of a particular environment through their equipment (e.g., temperature or humidity if the object is a sensor, etc.).</p></list-item><list-item><p><italic>Social awareness</italic> represents the ability of smart objects to participate and exchange information with communities.</p></list-item></list></p>
      <p>All these sensing capabilities can be translated to measurements and properties. Starting from them, an object profile, including a behavioral fingerprint, can be built. A fingerprint is a complex model considering different dynamics related to the object activities, such as: <italic>(i)</italic> how the object interacts with the other objects in the network, <italic>(ii)</italic>  how the owner of the object interacts with it and <italic>(iii)</italic> the value of the metrics about the environment that the object can compute.</p>
      <p>As stated in the Introduction, our approach leverages behavioral fingerprinting as a mean to build a mechanism to improve communication reliability in an IoT. Therefore, the first step concerns the construction of object profiles including such behavioral fingerprints. Due to the fully distributed nature of our application context, these models are built by objects with high computational capabilities, on the basis of interaction data among pair of nodes. To do so, we define a <italic>safe starting phase</italic>, in which all the interactions are considered safe and no malicious node is involved in the environment. During this phase, each node is in charge of <italic>(i)</italic> acquiring interaction data with its peers and <italic>(ii)</italic> proceeding with the computation of the object profile and the behavioral fingerprint. In general, only nodes belonging to <inline-formula><mml:math id="mm18" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> or <inline-formula><mml:math id="mm19" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> can build complex models; however, delegation strategies can be adopted to extend the approach also to nodes belonging to <inline-formula><mml:math id="mm20" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> or <inline-formula><mml:math id="mm21" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>. The details about the behavioral fingerprinting for H2O objects are described in <xref ref-type="sec" rid="sec4-futureinternet-13-00117">Section 4</xref>.</p>
      <p>After the <italic>safe starting phase</italic>, the network moves to a fully operational mode. During this second phase, network participants can leverage behavioral models trained in the previous phase. Each model refers to the relationship between the participant itself and one of its neighbors. Through these models, a node can continue to check if the actions performed by its neighbors are still compliant with the behavior observed during the previous phase. In the negative case, a peer can be assumed to be damaged or attacked and, therefore, no more reliable.</p>
      <p>The H2O network can grow over time. This means that new nodes can be added and new edges can be created. If new nodes are added to the network after the <italic>safe starting phase</italic>, no information about their behavior recorded during a safe period (with total absence of attacks) is available. In this case, unless a new training phase is carried out, the reliability level for new nodes has to be set to a default value. Whereas, to support the possible evolution of the H2O network in terms of new interconnections between nodes, our approach relies on a collaborative mechanism. In particular, given an object, say <inline-formula><mml:math id="mm22" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, which wants to communicate with a peer, namely <inline-formula><mml:math id="mm23" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, if no interconnection between these two nodes has occurred during the <italic>safe starting phase</italic>, <inline-formula><mml:math id="mm24" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can ask the set of its neighbors opinions about the reliability of <inline-formula><mml:math id="mm25" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. If some past interactions between <inline-formula><mml:math id="mm26" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and the latter set occurred, <inline-formula><mml:math id="mm27" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> will receive a number of responses from its neighbors. At this point, a reliability score about <inline-formula><mml:math id="mm28" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can be computed by <inline-formula><mml:math id="mm29" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, by averaging the obtained results. The details about how this reliability score is computed are described in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref>.</p>
      <p>In our scenario, also humans participate in the network by means of their personal devices (the objects belonging to <inline-formula><mml:math id="mm30" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>). Interestingly, by leveraging reliability scores derived from object interactions also human-to-human inter-communications can be made more secure (see <xref ref-type="sec" rid="sec4dot4-futureinternet-13-00117">Section 4.4</xref>). Indeed, let us suppose that a person, namely <inline-formula><mml:math id="mm31" display="block"><mml:semantics><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, wants to communicate with another person, say <inline-formula><mml:math id="mm32" display="block"><mml:semantics><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. If <inline-formula><mml:math id="mm33" display="block"><mml:semantics><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> has never met <inline-formula><mml:math id="mm34" display="block"><mml:semantics><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> in the past, sending private documents through its smartphone via NFC to <inline-formula><mml:math id="mm35" display="block"><mml:semantics><mml:msub><mml:mi>h</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> could result in security issues. To make this step more robust, our approach provides a mechanism which works as follows. First off, we refer to the sender&#x2019;s smartphone as <inline-formula><mml:math id="mm36" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and to the receiver&#x2019;s smartphone as <inline-formula><mml:math id="mm37" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. Before starting the file exchange, <inline-formula><mml:math id="mm38" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can request to <inline-formula><mml:math id="mm39" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> the evidence that <inline-formula><mml:math id="mm40" display="block"><mml:semantics><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> is who he claims to be. Continuous authentication and biometrics solutions are acquiring a lot of attention from the scientific community (see <xref ref-type="sec" rid="sec2-futureinternet-13-00117">Section 2</xref> and <xref ref-type="sec" rid="sec4dot3-futureinternet-13-00117">Section 4.3</xref> for details about it). These strategies ensure the possibility of providing human identity confirmation and protection on an ongoing basis. Many approaches deal with the implementation of these security mechanisms through personal smart objects (such as smartphones, smartwatches, etc.) [<xref ref-type="bibr" rid="B55-futureinternet-13-00117">55</xref>]. By leveraging such solutions, the object <inline-formula><mml:math id="mm41" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can prove its owner identity, through biometrics mechanism. All the details about object-to-human interactions are described in <xref ref-type="sec" rid="sec4dot3-futureinternet-13-00117">Section 4.3</xref>. Observe that, if <inline-formula><mml:math id="mm42" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> is a low power device it can rely on a more powerful object belonging to its <inline-formula><mml:math id="mm43" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> to perform this task. Of course, before relying on <inline-formula><mml:math id="mm44" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>&#x2019;s answer, <inline-formula><mml:math id="mm45" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> has to check the reliability of <inline-formula><mml:math id="mm46" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> in the H2O network. It can do so, by performing the steps of the object-to-object interaction explained above and detailed in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref>. <xref ref-type="fig" rid="futureinternet-13-00117-f003">Figure 3</xref> summarizes the steps of our approach through an example of a human-to-human interaction in full operational mode. Observe that, this includes also the steps for the corresponding object-to-object interaction.</p>
    </sec>
    <sec id="sec4-futureinternet-13-00117">
      <title>4. Behavioral Fingerprint for Reliability</title>
      <p>In this section, we present the main concepts underlying our approach and we detail all the steps of the main phases of our scheme. In particular, in <xref ref-type="sec" rid="sec4dot1-futureinternet-13-00117">Section 4.1</xref>, we describe how the behavioral fingerprint is computed for an object in the H2O network. This behavioral fingerprint will be used during all the object-to-object interactions of our H2O network, whose steps are detailed in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref>. After that, in <xref ref-type="sec" rid="sec4dot3-futureinternet-13-00117">Section 4.3</xref>, we survey on some biometrics algorithms our scheme can rely on in order to assess persons authenticity. Finally, <xref ref-type="sec" rid="sec4dot4-futureinternet-13-00117">Section 4.4</xref> is devoted to the description of the way our approach can make communications reliable, also in the context of human-to-human interactions.</p>
      <sec id="sec4dot1-futureinternet-13-00117">
        <title>4.1. Fingerprint Computation</title>
        <p>In this section we deep dive in the description of the behavioral fingerprint computation. Behavioral fingerprint is a very timely research subjects and several investigations are already available in the scientific literature [<xref ref-type="bibr" rid="B8-futureinternet-13-00117">8</xref>,<xref ref-type="bibr" rid="B21-futureinternet-13-00117">21</xref>,<xref ref-type="bibr" rid="B22-futureinternet-13-00117">22</xref>,<xref ref-type="bibr" rid="B23-futureinternet-13-00117">23</xref>]. Most of the existing works deal with the problem of identifying general features that can be applied to any existing IoT device, but, such that, together can unequivocally represent a single specific object. Generally, two categories of fingerprinting strategy are adopted, namely: <italic>(i)</italic> non-behavioral fingerprinting and <italic>(ii)</italic> behavioral fingerprinting [<xref ref-type="bibr" rid="B53-futureinternet-13-00117">53</xref>].</p>
        <p>The first category of approaches leverages features related to physical and link layer characteristics [<xref ref-type="bibr" rid="B56-futureinternet-13-00117">56</xref>,<xref ref-type="bibr" rid="B57-futureinternet-13-00117">57</xref>]. For instance, the authors of [<xref ref-type="bibr" rid="B56-futureinternet-13-00117">56</xref>] extracted 19 features from the 802.11 probe fields. The selected features have been identified by observing which variations are typically recorded when the devices are under attack or involved in anomalous situations in their environment. In particular, this approach works as follows. In the first phase, wireless network traffic from devices is collected, and probe request frames are filtered out to extract the data-link layer header from the frames. After removing the outliers, a set of unique, tamper-proof, non-reproducible features that can be used for the device type fingerprinting are chosen. Signature has been used to generate the profile for each device type. Finally, these profiles are then matched in the verification phase through some similarity measures to establish if the device type is registered in the system.</p>
        <p>In the approach described in [<xref ref-type="bibr" rid="B57-futureinternet-13-00117">57</xref>], instead, the authors focused on a different set of features related to clock characteristics and TCP timestamp. In particular, this approach is based on thirteen clock characteristics to remotely identify different IoT device models of various manufacturers. The authors define a set of machine learning features related to how monotonic timestamp clocks generate TCP timestamp values, and they use these features to detect model specific characteristics. Moreover, they compare different machine learning algorithms and identified Random Forest as the best classifier in this setting. In general, non-behavioral fingerprinting can be successfully applied if the considered features can be adapted to the characteristic of the network, in which the object is located. In this way, particular situations in the network, like congestion or bottlenecks, do not impact on the fingerprinting model.</p>
        <p>Behavioral fingerprinting, instead, focuses on more application-level features to model objects&#x2019; traits. Therefore, instead of focusing only on the physical and link layers information, the approaches belonging to this category go further in the characteristic of the packets generated by extracting information. Among these characteristics there are: protocols, request-response sequences and any periodicity in specific typology of packets along with their sizes [<xref ref-type="bibr" rid="B58-futureinternet-13-00117">58</xref>,<xref ref-type="bibr" rid="B59-futureinternet-13-00117">59</xref>,<xref ref-type="bibr" rid="B60-futureinternet-13-00117">60</xref>]. In particular, the approach of [<xref ref-type="bibr" rid="B58-futureinternet-13-00117">58</xref>] focuses on TCP/IP connections and extracts features from them (such as, time-to-live, byte sent and received, etc.). With these features, the authors trained a Random Forest model and were able to distinguish the monitored objects from external ones with a precision of 97%.</p>
        <p>Similarly, the approach described in [<xref ref-type="bibr" rid="B59-futureinternet-13-00117">59</xref>] focuses on different typologies of traffic an object can generate, for instance queries to DNSs, packets related to user activity on known application (e.g., google home, maps, etc.), and interaction with known service. With these information, the authors adopted a deep learning solution based on LSTM-CNN model. This approach reaches a best accuracy value of 80.1%.</p>
        <p>Very close to our application scenario is the solution described in [<xref ref-type="bibr" rid="B60-futureinternet-13-00117">60</xref>]. In this paper, the authors describe a distributed solution for behavioral IoT fingerprinting. Indeed, because models for fingerprint must be kept updated in accordance to possible variation in the devices&#x2019; configuration, a centralized solution would suffer from scalability issues. For this reason, they identify some nodes, i.e. the gateways, inside the IoT that can monitor objects using trained classification models, thus providing scalability to the solution. The training part, instead, is performed by special controller nodes, which in this scenario are considered as part of the ISP. Inside such an architecture, the authors identify a feature vector with 111 dimensions. They tested the performance of their approach obtaining an accuracy of <inline-formula><mml:math id="mm47" display="block"><mml:semantics><mml:mrow><mml:mn>97</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> when classifying known devices.</p>
        <p>With the evolution of the IoT technology, nowadays paradigms such as Internet of Multimedia Things (hereafter, IoMT) have been introduced. In such settings, the devices are assumed to have higher computational capabilities than classical sensors belonging to the Internet of Things. With this in mind, we argue that, in modern general IoT scenarios, we can consider that a combination of Multimedia Things and simple classical smart objects coexists. Therefore, in our H2O network, we consider that the role of controller nodes can be played by the top powerful devices, belonging to <inline-formula><mml:math id="mm48" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>, which are in charge of training the models by leveraging edge/cloud computing solutions [<xref ref-type="bibr" rid="B61-futureinternet-13-00117">61</xref>]. Whereas, the monitoring nodes can be more common objects with sufficient computational capabilities to execute a trained model. Finally, low-power objects, belonging to <inline-formula><mml:math id="mm49" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> or <inline-formula><mml:math id="mm50" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> can leverage delegation strategies to gain reliability information about other nodes. All the controller devices use the same algorithm to build object fingerprints and the same set of features, say <italic>S</italic>. During the <italic>safe starting phase</italic>, objects with monitoring capabilities interact with their peers to acquire the training set to build the corresponding models. The training set is, hence, used by the controller nodes to fit the model. With that said, in our scenario each monitoring node, say <inline-formula><mml:math id="mm51" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, associates and maintains a <italic>profile</italic> with each of its contacts, say <inline-formula><mml:math id="mm52" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> which were added before the <italic>safe starting phase</italic>. In particular, a profile can be defined as follows:<disp-formula id="FD1-futureinternet-13-00117"><label>(1)</label><mml:math id="mm53" display="block"><mml:semantics><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></disp-formula></p>
        <p>Here, <inline-formula><mml:math id="mm54" display="block"><mml:semantics><mml:mrow><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> is a set containing information related to connectivity aspects (such as, the IP address, the MAC address, and so forth), and <inline-formula><mml:math id="mm55" display="block"><mml:semantics><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> represents the fingerprint of <inline-formula><mml:math id="mm56" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> maintained by <inline-formula><mml:math id="mm57" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. In particular, the fingerprint that <inline-formula><mml:math id="mm58" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> associate with <inline-formula><mml:math id="mm59" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can be defined as:<disp-formula id="FD2-futureinternet-13-00117"><label>(2)</label><mml:math id="mm60" display="block"><mml:semantics><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>S</mml:mi><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></disp-formula>
        where, <inline-formula><mml:math id="mm61" display="block"><mml:semantics><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> represents the model built during the <italic>safe starting phase</italic> according to the data exchanged between <inline-formula><mml:math id="mm62" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm63" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. Whereas, the set <italic>S</italic> represents the set of features considered in the model. After the <italic>safe starting phase</italic>&#xA0;<inline-formula><mml:math id="mm64" display="block"><mml:semantics><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> is used by the monitoring node <inline-formula><mml:math id="mm65" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> to assess whether the behavior of <inline-formula><mml:math id="mm66" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> is unchanged. This information can be, then, used by the network members to estimate a reliability score for the others. In the next section, we will describe this aspect in more detail.</p>
      </sec>
      <sec id="sec4dot2-futureinternet-13-00117">
        <title>4.2. Object-to-Object Interaction</title>
        <p>In this section, we describe how the reliability of an object is assessed by leveraging object-to-object interactions. In order to detail all the steps of this part of our approach, we preliminary define a redundancy parameter <italic>r</italic>, that is a positive integer representing a minimum consensus level to suitably estimate the reliability of an object. Moreover, given the set of neighbors of <inline-formula><mml:math id="mm67" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, namely <inline-formula><mml:math id="mm68" display="block"><mml:semantics><mml:mrow><mml:mo>&#x393;</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>, we denote by <inline-formula><mml:math id="mm69" display="block"><mml:semantics><mml:mrow><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mo>&#x393;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> the set of nodes which have been tested by <inline-formula><mml:math id="mm70" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and whose identity is monitored (either directly or through delegation strategies) by comparing the current interactions with their behavioral fingerprints.</p>
        <p>As stated before, we assume that there exists a <italic>safe starting phase</italic> in which neither fraudulent access nor physical damage to legitimate nodes can be performed. During this phase the machine learning algorithms, described in <xref ref-type="sec" rid="sec4-futureinternet-13-00117">Section 4</xref>, can be trained to produce the fingerprints for each objects. In a subsequent non-safe phase, objects can leverage such models referring to other nodes which they usually communicate with. Periodically, a node <inline-formula><mml:math id="mm71" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can test one of its neighbors (whose behavior has been modeled during the <italic>safe starting phase</italic>), to assess whether it has been corrupted or hacked. Let us denote with <inline-formula><mml:math id="mm72" display="block"><mml:semantics><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mo>&#x393;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> the node to be tested. To do this, <inline-formula><mml:math id="mm73" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> exploits the behavioral fingerprinting model providing data extracted from a set of transactions done with <inline-formula><mml:math id="mm74" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, as input. The output of the model is a normalized fingerprint rate, represented as <inline-formula><mml:math id="mm75" display="block"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>, whose values range in <inline-formula><mml:math id="mm76" display="block"><mml:semantics><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>. In order to assume <inline-formula><mml:math id="mm77" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> reliable, the fingerprint rate must be greater than a give assurance threshold <inline-formula><mml:math id="mm78" display="block"><mml:semantics><mml:mrow><mml:mn>0</mml:mn><mml:mo>&lt;</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3F5;</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula>; in other words, the fingerprint rate should be such that <inline-formula><mml:math id="mm79" display="block"><mml:semantics><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3F5;</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula> to consider <inline-formula><mml:math id="mm80" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> still reliable.</p>
        <p>After this check, <inline-formula><mml:math id="mm81" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> stores <inline-formula><mml:math id="mm82" display="block"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> in a internal table for future transactions.</p>
        <p>Now, let us suppose that the node <inline-formula><mml:math id="mm83" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> wants to interact with <inline-formula><mml:math id="mm84" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, but it has not met <inline-formula><mml:math id="mm85" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> during the <italic>safe starting phase</italic>. In this case, no information about the reliability of <inline-formula><mml:math id="mm86" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> is available, directly. To address this situation, our approach adopts a strategy based on the consensus of a suitable portion of the neighbors of <inline-formula><mml:math id="mm87" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> to compute a derived fingerprint rate.</p>
        <p>In particular, let <inline-formula><mml:math id="mm88" display="block"><mml:semantics><mml:mrow><mml:mo>&#x394;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mspace width="4pt"/><mml:mo>|</mml:mo><mml:mspace width="4pt"/><mml:msub><mml:mi>n</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mo>&#x393;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2229;</mml:mo><mml:mo>&#x393;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> be the set of objects belonging to both the neighbors of <inline-formula><mml:math id="mm89" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm90" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, which have computed a normalized fingerprint rate for <inline-formula><mml:math id="mm91" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. The derived fingerprint rate for <inline-formula><mml:math id="mm92" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can be computed by <inline-formula><mml:math id="mm93" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> as follows:<disp-formula id="FD3-futureinternet-13-00117"><label>(3)</label><mml:math id="mm94" display="block"><mml:semantics><mml:mrow><mml:mi>d</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mo>&#x394;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mfenced separators="" open="|" close="|"><mml:mo>&#x394;</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mfenced></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula></p>
        <p>At this point, <inline-formula><mml:math id="mm95" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can be considered reliable by <inline-formula><mml:math id="mm96" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> if the following conditions are true: <italic>(i)</italic>&#xA0;<inline-formula><mml:math id="mm97" display="block"><mml:semantics><mml:mrow><mml:mi>d</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3F5;</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> and <italic>(ii)</italic>&#xA0;<inline-formula><mml:math id="mm98" display="block"><mml:semantics><mml:mrow><mml:mfenced separators="" open="|" close="|"><mml:mo>&#x394;</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mfenced><mml:mo>&#x2265;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>.</p>
        <p>Therefore generalizing the above reasoning, in order to be reliable for <inline-formula><mml:math id="mm99" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, a node <inline-formula><mml:math id="mm100" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> has to match one of the following set of conditions:<list list-type="bullet"><list-item><p><italic>(i)</italic><inline-formula><mml:math id="mm101" display="block"><mml:semantics><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> and <italic>(ii)</italic> <inline-formula><mml:math id="mm102" display="block"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3F5;</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>; that is, <inline-formula><mml:math id="mm103" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> holds a fingerprint model of <inline-formula><mml:math id="mm104" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and the normalized fingerprint rate is distant from the maximum value no more than a certain threshold <inline-formula><mml:math id="mm105" display="block"><mml:semantics><mml:mi>&#x3F5;</mml:mi></mml:semantics></mml:math></inline-formula>;</p></list-item><list-item><p><italic>(i)</italic><inline-formula><mml:math id="mm106" display="block"><mml:semantics><mml:mrow><mml:mfenced separators="" open="|" close="|"><mml:mo>&#x394;</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mfenced><mml:mo>&#x2265;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> and <italic>(ii)</italic> <inline-formula><mml:math id="mm107" display="block"><mml:semantics><mml:mrow><mml:mi>d</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3F5;</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>, that is at least <italic>r</italic> nodes in <inline-formula><mml:math id="mm108" display="block"><mml:semantics><mml:mrow><mml:mo>&#x393;</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> should have tested <inline-formula><mml:math id="mm109" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and expressed a positive check (greater than or equal to <inline-formula><mml:math id="mm110" display="block"><mml:semantics><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3F5;</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>).</p></list-item></list></p>
        <p>We call this last property <italic>r</italic>-redundancy. It is based on the assumption that multiple confirmation of the reliability of a node can be considered sufficient to trust the behavior of that node [<xref ref-type="bibr" rid="B19-futureinternet-13-00117">19</xref>]. Obviously, the higher the value of <italic>r</italic>, the higher the reliability about the object behavior.</p>
        <p>To better understand the steps above, let us consider the example represented in <xref ref-type="fig" rid="futureinternet-13-00117-f004">Figure 4</xref>. This figure reports a portion of an H2O network containing the nodes <inline-formula><mml:math id="mm111" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm112" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> along with their neighbors. Black edges represent interactions assured by the presence of a fingerprint model. Hence, the two nodes linked by such edges have first met during the <italic>safe starting phase</italic>. Moreover, consider an example configuration in which <inline-formula><mml:math id="mm113" display="block"><mml:semantics><mml:mrow><mml:mi>&#x3F5;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.3</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm114" display="block"><mml:semantics><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula>.</p>
        <p>Suppose again that the node <inline-formula><mml:math id="mm115" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> wants to interact with <inline-formula><mml:math id="mm116" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, but it has not met <inline-formula><mml:math id="mm117" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> during the <italic>safe starting phase</italic>. The dashed edge in <xref ref-type="fig" rid="futureinternet-13-00117-f004">Figure 4</xref> represents the possible future interaction between <inline-formula><mml:math id="mm118" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm119" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. Before starting the communication, <inline-formula><mml:math id="mm120" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> checks whether <inline-formula><mml:math id="mm121" display="block"><mml:semantics><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula>. If <inline-formula><mml:math id="mm122" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> had a direct access to a fingerprint model for <inline-formula><mml:math id="mm123" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, it could check if <inline-formula><mml:math id="mm124" display="block"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3F5;</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>. However, in this example, <inline-formula><mml:math id="mm125" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> has no direct access to a behavioral model for <inline-formula><mml:math id="mm126" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. Therefore, <inline-formula><mml:math id="mm127" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> contacts the objects in its neighborhood (<inline-formula><mml:math id="mm128" display="block"><mml:semantics><mml:mrow><mml:msub><mml:mo>&#x393;</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>a</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>y</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>w</mml:mi></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> in the example reported in <xref ref-type="fig" rid="futureinternet-13-00117-f004">Figure 4</xref>) to obtain information about <inline-formula><mml:math id="mm129" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. In particular, <inline-formula><mml:math id="mm130" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> looks for objects in its neighborhood, who can leverage a behavioral model of <inline-formula><mml:math id="mm131" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> to assess its reliability, which, as a consequence, belong also to the neighborhood of <inline-formula><mml:math id="mm132" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. In the example, two nodes, namely <inline-formula><mml:math id="mm133" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm134" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>w</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, belong to the interception set <inline-formula><mml:math id="mm135" display="block"><mml:semantics><mml:mrow><mml:mo>&#x393;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2229;</mml:mo><mml:mo>&#x393;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>y</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>w</mml:mi></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> and have access to a behavioral fingerprint of <inline-formula><mml:math id="mm136" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> (<inline-formula><mml:math id="mm137" display="block"><mml:semantics><mml:mrow><mml:mo>&#x394;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>w</mml:mi></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula>). These two nodes answer to <inline-formula><mml:math id="mm138" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> with <inline-formula><mml:math id="mm139" display="block"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm140" display="block"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>w</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>, respectively.</p>
        <p>Having this two values, <inline-formula><mml:math id="mm141" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> computes the formula in Equation (<xref ref-type="disp-formula" rid="FD3-futureinternet-13-00117">3</xref>), which becomes: <disp-formula><mml:math id="mm142" display="block"><mml:semantics><mml:mrow><mml:mi>d</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>w</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>0.74</mml:mn><mml:mo>+</mml:mo><mml:mn>0.84</mml:mn></mml:mrow><mml:mn>2</mml:mn></mml:mfrac><mml:mo>=</mml:mo><mml:mn>0.79</mml:mn></mml:mrow></mml:semantics></mml:math></disp-formula></p>
        <p>At this point, <inline-formula><mml:math id="mm143" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> will consider <inline-formula><mml:math id="mm144" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> reliable because <inline-formula><mml:math id="mm145" display="block"><mml:semantics><mml:mrow><mml:mi>d</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mn>0.70</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm146" display="block"><mml:semantics><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula>.</p>
        <p>Algorithm 1 summarizes the steps of our approach for object-to-object reliability assessment.</p>
        <p>As for the overall computational complexity of the above consensus mechanism, we can express it in terms of number of messages sent during the object-to-object reliability assessment. Therefore, leveraging asymptotic analysis, we can state that this solution guarantees a linear computational complexity, <inline-formula><mml:math id="mm147" display="block"><mml:semantics><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>, in the dimension, say <italic>m</italic>, of the number of neighbors for a node. It is worth noting that, in this analysis, we do not consider the computational cost of the fingerprint rate <inline-formula><mml:math id="mm148" display="block"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>, that depends on the fingerprint algorithm used during the <italic>safe start phase</italic> (see <xref ref-type="sec" rid="sec4-futureinternet-13-00117">Section 4</xref>).</p>
      </sec>
      <sec id="sec4dot3-futureinternet-13-00117">
        <title>4.3. Human-to-Object Interaction</title>
        <p>This section is devoted to detail the various biometric authentication techniques our approach can rely on, in order to make an object in the H2O network, capable of continuously identifying its owner. As will be clearer in the next, this step is essential to provide a mean to assess entities reliability also in human-to-human communications. Biometric identification is defined as the mechanism to automatic identify a person through the analysis of his biological (physiological, anatomical) or behavioral traits. This may happen since most of the biological and behavioral characteristics used are peculiar of an individual and can uniquely identify him. Indeed, in the last years, the use of ID cards, keys, passwords, or other standard systems has been replaced in lots of contexts by these more dependable forms of authentication [<xref ref-type="bibr" rid="B62-futureinternet-13-00117">62</xref>]. Obviously, not all the human characteristics can be chosen to be used in biometric authentication. Therefore, according to the National Institute of Standards and Technology (NIST) (<uri>https://www.nist.gov</uri>, accessed on 30 April 2021), there are some features that make a human trait distinctive and hence, eligible for acceptance. These features are: universality, uniqueness, permanence, measurability, performance, acceptability and circumvention [<xref ref-type="bibr" rid="B63-futureinternet-13-00117">63</xref>]. Examples falling in the aforementioned biological category of biometric mechanisms are: fingerprint, hand geometry, iris, face, and ear. Whereas, examples of behavioral biometrics mechanisms include: gait, signature, and keystroke dynamics.
        <array><tbody><tr><td align="left" valign="middle" style="border-top:solid thin;border-bottom:solid thin"><bold>Algorithm 1:</bold>&#xA0;Algorithm for object-to-object reliability computation.</td></tr><tr><td align="left" valign="middle" style="border-bottom:solid thin"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-i001.tif"/></td></tr></tbody></array></p>
        <p>As already said, the diversity of devices and applications in the IoT universe leads to a variety of solutions to the problem of continuous authentication of users (through biometrics). Such a diversity is mostly due to the different capabilities of the devices themselves.</p>
        <p>According to this reasoning, we can divide IoT devices that interact with humans and which compute biometrics to authenticate their owners, into two sets. The former is composed of objects having a permanent physical contact with the person during usage, such as: activity trackers, smartwatches, and insulin pumps. The latter consists of devices that do not maintain permanent contact with humans, such as: intelligent thermostats, occupancy sensors, and smart household appliances. To the first set belong wearable devices holding an inertial measurement unit (IMU), which are, in turn, comprised of an accelerometer and a gyroscope, and that can verify and authenticate their owner by his gait. The concept underneath is that humans move their limbs in unique patterns, and these patterns can be sensed be the device. Leveraging machine learning techniques to learn these patterns, software inside smartphones, fitbands, smartwatches and specific health sensors can be able to verify a human through his gait.</p>
        <p>Similarly, photoplethysmogram (PPG) sensors generate signals according to the amount of blood that flows in a person&#x2019;s veins, which depends on frequency heartbeat. In particular, this last trait that can be analysed through echocardiogram signals (ECG) can be monitored by smartphones, fitbands, smartwatches and specific health sensors. It contains enough information to enable user authentication. Potentially this kind of information can be combined with the one coming from IMU to provide a multiple-biometrics measure, more accurate and stable, that traces ECG according also to changes in speed of user&#x2019; movements.</p>
        <p>Always in the context of biological traits, specifically anatomical ones, distinctive physical human characteristic are the iris, the shape and appearance of ears, the face, the fingers and the hands&#x2019; palms. These features are invariant during the growth period of children and in adult lifetime [<xref ref-type="bibr" rid="B62-futureinternet-13-00117">62</xref>]. For instance, the visible colored rings around pupil that compose the iris have a unique size for each individuals. Also the shape and appearance of ears are unique and have relatively little change during the lifetime of an adult. Moreover, also fingerprints and palms of the skin of the hands have unique pattern of ridges and valleys. All this traits can be analysed by a camera or via specific sensors for fingerprint installed in a laptop or smartphone.</p>
        <p>On the other hand, there is a number of mechanisms performing continuous authentication based on the analysis of human behaviour. All these approaches can be referred as behaviometrics, that is the analysis of a person&#x2019;s behavior, rather than his physical characteristics, with the aim to identify uniquely that person. One of the most popular is keystroke [<xref ref-type="bibr" rid="B64-futureinternet-13-00117">64</xref>], which tries to identify the authenticity of a user when he is working via a keyboard. In particular, this process analyzes the way a user types at a terminal by monitoring the keyboard with the aim to identify users based on habitual typing rhythm patterns.</p>
        <p>Always in the context of behavioral biometrics, recent works rely on the particular way a person uses the devices he usually interacts with. For instance, in [<xref ref-type="bibr" rid="B65-futureinternet-13-00117">65</xref>] the authors extracted some side-channel features from network traffic generated by smartphones. Specifically, they state that the use of the most popular smartphone applications, such as Facebook, WhatsApp, Skype and Dropbox generate a network traffic peculiar for a single individual; and it can be used to reliably identify the owner&#x2019;s smartphone. Also the use of Social Networks through the smartphone can be consider characteristic for an individual. Indeed, the works presented in [<xref ref-type="bibr" rid="B13-futureinternet-13-00117">13</xref>,<xref ref-type="bibr" rid="B14-futureinternet-13-00117">14</xref>] deal with this challenge, proposing some mobile behaviometric frameworks assessing users&#x2019; social activity, and introducing sociability metrics to generate signatures of users&#x2019; activities. Typically, to compute behavioral biometrics a user has to rely on powerful devices, such as smartphones or personal laptops.</p>
        <p>In summary, the are various possibilities for IoT devices to assess, in any moment, if their owner is who he claims to be. Specifically, in H2O network, each device can perform continuous authentication of its owner according to its own capabilities. For instance, a camera can rely on face recognition, whereas a fingerprint sensor on human fingerprint. The set of possibilities for a smartphone are, surely, wider, since this kind of personal device has a number of capabilities spanning from biological human traits to behaviometrics. The choice of the particular mechanism for each device is orthogonal to our study, as long as a device can provide an answer to another object about its owner identity, once requested. Anyway, as already stated, in H2O network not all the devices are equipped with biometric sensors able to perform a continuous authentication task. If the device belongs to a <inline-formula><mml:math id="mm177" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>, our approach leverages delegation strategies ensuring to this device the possibility to rely on a more powerful one, always belonging to the same <inline-formula><mml:math id="mm178" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>. The whole list of steps and the conditions for which a device can rely on another device&#x2019;s to identify the common owner, will be explained in the following section.</p>
      </sec>
      <sec id="sec4dot4-futureinternet-13-00117">
        <title>4.4. Human-to-Human Interaction</title>
        <p>In this section we describe the second reliability mechanism our H2O network is equipped with. Indeed, in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref>, we detailed how the interaction between two objects can be made more robust against attacks aiming at corrupting or damaging a node. Indeed, our approach provides a way for a node to assess the reliability of a second node it is interacting with. At the same time, if a node requests a service from another one for the first time, it can rely on our approach to know what its neighbors think about that node and assess whether it can be considered reliable or not.</p>
        <p>By applying a similar reasoning, our approach can be extended also to human-to-human interactions. A sequence diagram showing our solution in this particular case is reported in <xref ref-type="fig" rid="futureinternet-13-00117-f005">Figure 5</xref>.</p>
        <p>In particular, if a human wants to interact with another human in the H2O network our protocol will perform a sequence of steps useful to assess the reliability of the second human. In particular, as showed in <xref ref-type="fig" rid="futureinternet-13-00117-f005">Figure 5</xref>, let us hypothesize that Chad wants to interact with Hope to send a personal file. For this task, Chad relies on one of his object, let us say <inline-formula><mml:math id="mm179" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, whereas Hope&#x2019;s object, that has to receive the file, is identified with <inline-formula><mml:math id="mm180" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>. In this scenario, two cases may happen. The first possibility is that <inline-formula><mml:math id="mm181" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> is an object with sufficient computational power (i.e., it belongs to Hope&#x2019;s <inline-formula><mml:math id="mm182" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>) and it is equipped with an algorithm for the computation of biological or behavioral biometrics mechanisms (showed in <xref ref-type="sec" rid="sec4dot3-futureinternet-13-00117">Section 4.3</xref>). In this case, before <inline-formula><mml:math id="mm183" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> sends the file to <inline-formula><mml:math id="mm184" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, it will request the result of the biometrics authentication mechanism <inline-formula><mml:math id="mm185" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> is equipped with. At this point, our scheme provides <inline-formula><mml:math id="mm186" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> with a way to assess <inline-formula><mml:math id="mm187" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> reliability, too. In order to do so, it will perform the sequence of steps described in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref> for object-to-object reliability assessment. If <inline-formula><mml:math id="mm188" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> is reliable and its response about Hope reliability is positive, the file exchange can safely take place.</p>
        <p>The second case happens if <inline-formula><mml:math id="mm189" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> is a lower power object (i.e., it belongs to Hope&#x2019;s <inline-formula><mml:math id="mm190" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>), hence, it is not equipped with a way to authenticate its owner, Hope. Our approach allows <inline-formula><mml:math id="mm191" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> to rely on more powerful objects belonging to Hope&#x2019;s <inline-formula><mml:math id="mm192" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> for this computation. To do so, an approach based on consensus, similar to the one described in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref>, can be adopted. Specifically, let <inline-formula><mml:math id="mm193" display="block"><mml:semantics><mml:mrow><mml:msup><mml:mo>&#x394;</mml:mo><mml:mi>H</mml:mi></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> be the set of objects belonging to the <inline-formula><mml:math id="mm194" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> of <inline-formula><mml:math id="mm195" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>, which have the capability of computing biological or behavioral biometrics mechanisms to authenticate their owner. Let <inline-formula><mml:math id="mm196" display="block"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:msup><mml:mo>&#x394;</mml:mo><mml:mi>H</mml:mi></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>^</mml:mo></mml:mover><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mo>&#x394;</mml:mo><mml:mi>H</mml:mi></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> be the set of nodes of <inline-formula><mml:math id="mm197" display="block"><mml:semantics><mml:mrow><mml:msup><mml:mo>&#x394;</mml:mo><mml:mi>H</mml:mi></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> that can be considered reliable by <inline-formula><mml:math id="mm198" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> according to the strategy described in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref>. To authenticate its owner, <inline-formula><mml:math id="mm199" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can relay on any node belonging to <inline-formula><mml:math id="mm200" display="block"><mml:semantics><mml:mover accent="true"><mml:mrow><mml:msup><mml:mo>&#x394;</mml:mo><mml:mi>H</mml:mi></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula>; moreover, <inline-formula><mml:math id="mm201" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> must adopt again the strategy described in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref> to confirm the reliability of <inline-formula><mml:math id="mm202" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula>&#x2019;s answer. Finally, if all the involved nodes are reliable and the response about Hope&#x2019;s reliability is positive, the file exchange can safely take place.</p>
        <p>Algorithm 2 summarizes the steps of our approach for human-to-human reliability assessment.</p>
        <p>Concerning the computational complexity of this functionality, we can consider two contributions. The former is the cost of the continuous authentication mechanism, say <inline-formula><mml:math id="mm203" display="block"><mml:semantics><mml:mrow><mml:mi>a</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>, that strictly depends on the specific biometrics approach adopted. For these reason, we generically refer to this cost as <inline-formula><mml:math id="mm204" display="block"><mml:semantics><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> and we do not include it in our analysis.</p>
        <p>The latter, which is the cost introduced by our approach, can be expressed, once again, in terms of the number of messages exchanged by the objects involved in this task. In particular, the human starting the communication will use one of his object for this task. This object will exploit the object-to-object mechanism, described in <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref>, to assess the reliability of the object owned by the target human. As stated before this task has a linear computational complexity in the dimension of the number of neighbors for a node, say <italic>m</italic>. Moreover, in the worst case, the object owned by the target human will query his whole PAN. Assuming that the maximum size of the set of objects of a PAN is <italic>s</italic>, then this further step will have a linear cost with respect to it. Overall, the cost of this strategy can be estimated as <inline-formula><mml:math id="mm205" display="block"><mml:semantics><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>&#xB7;</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>.
        <array><tbody><tr><td align="left" valign="middle" style="border-top:solid thin;border-bottom:solid thin"><bold>Algorithm 2:</bold>&#xA0;Algorithm for human-to-human reliability computation.</td></tr><tr><td align="left" valign="middle" style="border-bottom:solid thin"><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-i002.tif"/></td></tr></tbody></array></p>
      </sec>
    </sec>
    <sec id="sec5-futureinternet-13-00117">
      <title>5. Evaluating the Performances of H2O Network</title>
      <p>In this section, we describe the experimental campaign we carried out in order to test the feasibility of our proposal. This set of experiments are also useful to tune the parameters of our approach and determine the best configuration for the different application scenarios.</p>
      <p>We leveraged on the online dataset provided by [<xref ref-type="bibr" rid="B66-futureinternet-13-00117">66</xref>]. This dataset is based on real IoT objects available in the city of Santander (<uri>https://www.smartsantander.eu/</uri>, accessed on 30 April 2021). This old Spanish seaport on the north coast became one of the first smart city in the world in 2010. During that period, indeed, 12,500 sensors have been placed in and around the city&#x2019;s downtown district, to measure and monitor a lot of things from the number of available parking spaces to the amount of trash in containers, or crowds on the sidewalks. In addition, sensors on public vehicles were added to measure air pollution levels and traffic conditions.</p>
      <p>The dataset objects are categorized following the typologies and data model introduced in the FIWARE Data Models (<uri>https://www.fiware.org/developers/data-models</uri>, accessed on 30 April 2021). This kind of data models has been thought to enable data portability for different applications in the IoT context, such as: Smart Cities, Smart Environment, Smart Sensoring, Smart Energy, Smart Water and so on.</p>
      <p>The dataset collects the information of both private mobile devices, which are carried by the users during their movements, and static objects, left in a single location (e.g., the users&#x2019; house). Among the former category of private mobile devices there are: smartphones, cars, tablets, smart fitness devices and smartwatches. The latter category includes: personal computers, smart printers and home sensors. Also public devices of the city of Santander are available in the dataset, such as: environment and weather monitoring objects, transportation vehicles (i.e., taxis or buses), digital indicators, garbage trucks, city street lights, parking locations and security alarms or traffic monitoring devices. Users&#x2019; movement is simulated through a mobility model called Small World in Motion (SWIM) [<xref ref-type="bibr" rid="B67-futureinternet-13-00117">67</xref>,<xref ref-type="bibr" rid="B68-futureinternet-13-00117">68</xref>]. SWIM generates traces for ad-hoc networking having the same statistical properties of real traces. The parameters used for this simulation along with some numeric of the dataset are shown in the <xref ref-type="table" rid="futureinternet-13-00117-t003">Table 3</xref>. The map in <xref ref-type="fig" rid="futureinternet-13-00117-f006">Figure 6</xref> is a graphical representation of the objects&#x2019; positions in the Santander city used for our experiments. For the sake of presentation, in this figure, the object position has been scaled down to a unitary square area [<xref ref-type="bibr" rid="B66-futureinternet-13-00117">66</xref>].</p>
      <p>To carry out our experimental evaluation of the performance and features of our approach, we built a simulator using Python language on an Ubuntu Server equipped with 32 GB of RAM and a 8 core CPU at <inline-formula><mml:math id="mm265" display="block"><mml:semantics><mml:mrow><mml:mn>5.10</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula> GHz.</p>
      <p>Our first experiment is devoted to the comparison of our approach with a naive one, in terms of the load generated for the H2O, that is the number of transactions sent in the communications. According to the naive approach, each object sends data to another one in the network directly, without applying any strategy to assess if the target of its communication is reliable or not.</p>
      <p>This experiment gives us a better understanding of the impact of the reliability mechanism introduced by our approach to the traffic generated in the H2O network during the fully operational phase. Indeed, while the naive strategy generates only the number of transactions related to the communication between two objects, our approach introduces an overhead related to the assessment of objects&#x2019; reliability. The difference, in term of percentage of transactions for a time period of 10 days and <inline-formula><mml:math id="mm266" display="block"><mml:semantics><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula>, is shown in <xref ref-type="fig" rid="futureinternet-13-00117-f007">Figure 7</xref>.</p>
      <p>Assuring reliable communications is a matter of costs and adding overhead in the network can be tolerated if we think how valuable the data and the process exchanged are. With that said, it is clear that such overhead in terms of number of transactions in the network is correlated to: <italic>(i)</italic> the total number of neighbors for each nodes; and <italic>(ii)</italic> the number of transactions created during the <italic>safe starting phase</italic>. For this experiment, we have set the percentage of transactions in the <italic>safe starting phase</italic> to <inline-formula><mml:math id="mm267" display="block"><mml:semantics><mml:mrow><mml:mn>10</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> of the number of total transactions. For the results, we can see that the percentage of additional transactions has a pick right at the beginning of the simulation. This is due to the fact that the fingerprinting rates (and, of course, the derived fingerprint rates) are mainly computed when the first interaction between objects takes place. Therefore, during the initial period nodes start to interact with each other and the first set of interactions is used to test the reliability of their peers. Later, nodes tend to communicate with the consolidated list of contacts and can re-use the computed fingerprint rates.</p>
      <p>To deepen the study about the tuning of the different parameters of our model, we performed a second experiment in which we focus on the percentage of nodes for which our approach can provide an estimation of the fingerprint rates and, therefore, of their reliability. Of course, such percentage is strictly related to the distribution of the number of contacts for the nodes in the network. Therefore, for starters, we report in <xref ref-type="fig" rid="futureinternet-13-00117-f008">Figure 8</xref> the degree distribution of the analyzed H2O network.</p>
      <p>Observe that the distribution follows a power law which is a typical distribution of social systems [<xref ref-type="bibr" rid="B69-futureinternet-13-00117">69</xref>]. According to this distribution, we can observe that most of the nodes have a number of neighbors around 6, whereas a very small percentage of nodes have up to 100 contacts.</p>
      <p>With that said, we focus on the network after the <italic>safe starting phase</italic>. During this phase some nodes can be hacked or corrupted, moreover, new transactions between nodes not holding the fingerprint model can be established. In this experiment, we considered that <inline-formula><mml:math id="mm268" display="block"><mml:semantics><mml:mrow><mml:mn>10</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> of the nodes was able to create fingerprint models with their acquaintances during the <italic>safe starting phase</italic>. In this case, the <italic>r</italic>-redundancy parameter plays a fundamental role, indeed, it imposes that at least <italic>r</italic> neighbors of a node <inline-formula><mml:math id="mm269" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> must own fingerprint rates of a target node <inline-formula><mml:math id="mm270" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> to allow <inline-formula><mml:math id="mm271" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> to compute a derived fingerprint rate for <inline-formula><mml:math id="mm272" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> and, hence, to assess whether it can be considered reliable or not. In <xref ref-type="fig" rid="futureinternet-13-00117-f009">Figure 9</xref>, the percentages of assessable nodes over the total number of node in the H2O network, for different values of <italic>r</italic> parameter, are shown. In this experiment, the <italic>r</italic>-redundancy threshold assumes integer values in the interval <inline-formula><mml:math id="mm273" display="block"><mml:semantics><mml:mrow><mml:mo>[</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>20</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>. Observe that, when we talk about assessable nodes, we refer to nodes for which either a direct or a derived fingerprint rate can be computed. This score can be, hence, used to establish the reliability of nodes (i.e., a node will be considered reliable if this rate is greater than the threshold <inline-formula><mml:math id="mm274" display="block"><mml:semantics><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3F5;</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>, see <xref ref-type="sec" rid="sec4dot2-futureinternet-13-00117">Section 4.2</xref>).</p>
      <p>This result is useful to choose the appropriate value of the redundancy parameter <italic>r</italic> basing on the percentage of not reliable nodes tolerated in the H2O. From this figure, we can see that by setting <inline-formula><mml:math id="mm275" display="block"><mml:semantics><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula>, which is a value in line with the average number of neighbors for a node in the network, with just the <inline-formula><mml:math id="mm276" display="block"><mml:semantics><mml:mrow><mml:mn>10</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> of nodes owning a direct fingerprint model with others, our approach can estimate the reliability of more than the <inline-formula><mml:math id="mm277" display="block"><mml:semantics><mml:mrow><mml:mn>50</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> of nodes in the H2O network.</p>
      <p>The last experiment focuses on the capability of our approach to inhibit possibly malicious transactions originating from hacked/corrupted nodes in H2O. For this experiment, we considered the following different percentages of hacked/corrupted nodes: <inline-formula><mml:math id="mm278" display="block"><mml:semantics><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>%</mml:mo><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>%</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo>%</mml:mo><mml:mo>,</mml:mo><mml:mn>10</mml:mn><mml:mo>%</mml:mo><mml:mo>,</mml:mo><mml:mn>20</mml:mn><mml:mo>%</mml:mo><mml:mo>,</mml:mo><mml:mn>50</mml:mn><mml:mo>%</mml:mo><mml:mo>]</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>. Whereas, the <italic>r</italic> parameter assumes the following values: <inline-formula><mml:math id="mm279" display="block"><mml:semantics><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>10</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula>.</p>
      <p>We measured how many times a transaction towards an hacked/corrupted node has been prevented by means of our solution.</p>
      <p><xref ref-type="fig" rid="futureinternet-13-00117-f010">Figure 10</xref> shows the absolute number of prevented attacks against the number of hacked/corrupted nodes and with different values of the <italic>r</italic> parameter.</p>
      <p>From the analysis of this figure, we can observe that the number of blocked attacks increases exponentially as the percentage of hacked/corrupted nodes increases. Whereas, the impact of <italic>r</italic>, once again, depends on the average number of neighbors for a node in H2O. In the setting of this experiment, the best trade off between consensus robustness and number of blocked attacks is 5, which is very near to the most probable neighborhood cardinality in the considered H2O network.</p>
    </sec>
    <sec id="sec6-futureinternet-13-00117">
      <title>6. Security Model of H2O Network</title>
      <p>The IoT infrastructure is very prone to well-known security attacks that may impact things and routing [<xref ref-type="bibr" rid="B70-futureinternet-13-00117">70</xref>]. In this section, we illustrate the security model of our approach. In particular, we present both the attack model and a security analysis, showing that our framework addresses its objectives also in presence of threats. The security properties of our scheme are demonstrated by leveraging the characteristic and security features of our approach as well as the assumptions described in the attack model.</p>
      <sec id="sec6dot1-futureinternet-13-00117">
        <title>6.1. Attack Model</title>
        <p>As a preliminary assumption, we consider a realistic scenario in which a sufficient number of nodes is available both in the starting phase, called <italic>safe starting phase</italic>, and in the fully operational one. Therefore, we do not consider anomalous situations, in which the number of the nodes available in the network is less than the minimum necessary one, preventing to implement our scheme successfully. Moreover, we include in our threat model the following assumptions:</p>
        <list list-type="order">
          <list-item>
            <label><bold>A.1</bold>&#xA0;</label>
            <p>At most <inline-formula><mml:math id="mm280" display="block"><mml:semantics><mml:mrow><mml:mi>t</mml:mi><mml:mo>&lt;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> smart objects can collude to break the security properties of the protocol.</p>
          </list-item>
          <list-item>
            <label><bold>A.2</bold>&#xA0;</label>
            <p>A.2 An attacker can neither take control of the whole network, nor own all the smart objects.</p>
          </list-item>
          <list-item>
            <label><bold>A.3</bold>&#xA0;</label>
            <p>A.3 There is a <italic>safe starting phase</italic> during which no node is corrupted or human impersonated.</p>
          </list-item>
        </list>
        <p>As for the first assumption, we recall that our protocol is collaborative and a node <inline-formula><mml:math id="mm281" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> can compute the reliability score of another nodes <inline-formula><mml:math id="mm282" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> through the responses of the set of its neighbors <inline-formula><mml:math id="mm283" display="block"><mml:semantics><mml:msub><mml:mo>&#x393;</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:msub></mml:semantics></mml:math></inline-formula>. Some nodes might be corrupted, but we assume that most of them are honest, as done in [<xref ref-type="bibr" rid="B71-futureinternet-13-00117">71</xref>,<xref ref-type="bibr" rid="B72-futureinternet-13-00117">72</xref>].</p>
        <p>The list of the security properties (hereafter, SP) of our framework is the following:<list list-type="order"><list-item><label><bold>SP.1</bold>&#xA0;</label><p>Resistance to Node Tampering Attacks.</p></list-item><list-item><label><bold>SP.2</bold>&#xA0;</label><p>Resistance to Side Channel Attacks.</p></list-item><list-item><label><bold>SP.3</bold>&#xA0;</label><p>Resistance to Physical Damage Attacks.</p></list-item><list-item><label><bold>SP.4</bold>&#xA0;</label><p>Resistance to Sniffing Attacks.</p></list-item><list-item><label><bold>SP.5</bold>&#xA0;</label><p>Resistance to Denial of Service Attacks.</p></list-item><list-item><label><bold>SP.6</bold>&#xA0;</label><p>Resistance to Fake Node Attacks.</p></list-item><list-item><label><bold>SP.7</bold>&#xA0;</label><p>Resistance to Sybil Attacks.</p></list-item></list></p>
      </sec>
      <sec id="sec6dot2-futureinternet-13-00117">
        <title>6.2. Security Analysis</title>
        <p>In this section, we detail the security properties cited above, analysing how our approach can guarantee each of them.</p>
        <sec id="sec6dot2dot1-futureinternet-13-00117">
          <title>6.2.1. <bold>SP.1</bold>&#x2014;Resistance to Node Tampering Attacks</title>
          <p>This attack occurs when a malicious user has physical access to an object and can modify its whole software/hardware or just part of it. More specifically, an adversary physically compromises a node by inserting malicious code to the node that will give him illegal access to the system [<xref ref-type="bibr" rid="B70-futureinternet-13-00117">70</xref>]. Moreover, this type of attack can include also the altering of some sensitive information, such as cryptographic keys or routing table [<xref ref-type="bibr" rid="B73-futureinternet-13-00117">73</xref>].</p>
          <p>Having the control of the node, the attacker can compromise the strategy adopted by the node to gather information and allow for the computation of the fingerprint of its contacts. This would lead to issues during the training phase of the classifiers during the <italic>safe starting phase</italic> and, hence, to wrong fingerprint rates estimation during the subsequent phase. The node, as breached, would provide wrong values once requested by its neighbor. It is worth noting that, in this case, the behavior of the node would not be altered, because the node will continue to work normally, but it will leverage wrong models to produce fingerprint rates. However, thanks to Assumption <bold>A.3</bold> such an attack could not happen, because during the <italic>safe starting phase</italic> all the objects are considered safe.</p>
          <p>Always in the context of this kind of attack, instead of jeopardizing the training phase, an attacker could modify directly the response to a query of another object during the operational phase. In this case, our approach enforces two protection mechanisms. On one hand, the use of behavioral fingerprinting models would detect an anomalous behavior of the attacked object; indeed, related literature in this setting proved that an attacker controlling an object would alter some of the features, thus impacting the object&#x2019;s fingerprint [<xref ref-type="bibr" rid="B53-futureinternet-13-00117">53</xref>]. On the other hand, this scenario does not invalidate the computation of the reliability for any node; indeed this score is obtained by a consensus of at least <italic>r</italic> nodes and for Assumption <bold>A.1</bold> colluding nodes are at most <inline-formula><mml:math id="mm284" display="block"><mml:semantics><mml:mrow><mml:mi>t</mml:mi><mml:mo>&lt;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>.</p>
        </sec>
        <sec id="sec6dot2dot2-futureinternet-13-00117">
          <title>6.2.2. <bold>SP.2</bold>&#x2014;Resistance to Side Channel Attacks</title>
          <p>Related to the previous category of attacks, in this case attackers leverage low level information like power consumption, time consumption and electromagnetic radiation from sensor nodes to attack encryption mechanisms and have the control of the node. Since our H2O network is made up heterogeneous devices, this attack can target only sensor nodes for which additional information obtained from side channels can reveal encryption mechanisms. However, the countermeasure described above for attacks based on node tampering (see <xref ref-type="sec" rid="sec6dot2dot1-futureinternet-13-00117">Section 6.2.1</xref>) are valid also in this case. Therefore, thanks to Assumptions <bold>A.3</bold> and <bold>A.1</bold>, this attack cannot happen.</p>
        </sec>
        <sec id="sec6dot2dot3-futureinternet-13-00117">
          <title>6.2.3. <bold>SP.3</bold>&#x2014;Resistance to Physical Damage Attacks</title>
          <p>The adversary can physically damage the IoT device with the aim to perform a denial of service for that node. If an attacker damage only a node, the reasoning underneath the resistance to this type of attack is the same of the one explained in <xref ref-type="sec" rid="sec6dot2dot1-futureinternet-13-00117">Section 6.2.1</xref> for Node Tampering Attacks. Hence, once again, thanks to Assumptions <bold>A.3</bold> and <bold>A.1</bold> these attacks are contrasted. Whereas, if the attacker tries to damage all the IoT devices providing a certain services or all the nodes belonging to a neighborhood of a node, the mechanism to assess the reliability could be invalidate for loss of responses. However, for Assumption <bold>A.2</bold> an attacker cannot take control of all the smart objects. Moreover, as already said above, for Assumption <bold>A.1</bold>, colluding nodes can be at most <inline-formula><mml:math id="mm285" display="block"><mml:semantics><mml:mrow><mml:mi>t</mml:mi><mml:mo>&lt;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>.</p>
        </sec>
        <sec id="sec6dot2dot4-futureinternet-13-00117">
          <title>6.2.4. <bold>SP.4</bold>&#x2014;Resistance to Sniffing Attacks</title>
          <p>An adversary can place a sensor near a simple IoT object (i.e., an object of <inline-formula><mml:math id="mm286" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> or <inline-formula><mml:math id="mm287" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>) to sense the connectivity/identity (RFID tag) information exchanged and to act as a man-in-the-middle. In this way, he can send fake data on behalf of the original object and compromise the system [<xref ref-type="bibr" rid="B74-futureinternet-13-00117">74</xref>]. As said, this attack targets only those devices belonging to <inline-formula><mml:math id="mm288" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> or <inline-formula><mml:math id="mm289" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula>, that are low power devices for either public or personal use. This kind of devices are not directly involved in the construction of fingerprint models, whose construction is instead pursued by objects belonging to <inline-formula><mml:math id="mm290" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>U</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> and <inline-formula><mml:math id="mm291" display="block"><mml:semantics><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:semantics></mml:math></inline-formula> based on the information obtained by other nodes. However, during the <italic>safe starting phase</italic> for Assumption <bold>A.3</bold>, no such attacks can occur, thus guaranteeing the integrity of these models.</p>
          <p>As for the subsequent phase, attacked objects will be detected through the available models; moreover, by properly tuning the <italic>r</italic> parameter, as described in the experimental campaign section, our mechanism can be fully robust to any corrupted node.</p>
        </sec>
        <sec id="sec6dot2dot5-futureinternet-13-00117">
          <title>6.2.5. <bold>SP.5</bold>&#x2014;Resistance to Denial of Service Attacks</title>
          <p>Classically, this attack may happen when a malicious user overburdens the network with traffic above its capacity and makes it unavailable for legitimate services. To do so, an adversary can execute the attack from a single node (classical DoS [<xref ref-type="bibr" rid="B75-futureinternet-13-00117">75</xref>]) or from multiple nodes (Distributed DoS [<xref ref-type="bibr" rid="B76-futureinternet-13-00117">76</xref>]).</p>
          <p>A particular category of DoS attacks, very popular in an IoT scenario, are the Sleep Deprivation Attacks. The objective of the attacker is to cause great consumption of power for a target node to reduce its lifetime. Providing a solution to classical DoS attacks is orthogonal to our proposal. However, any existing strategy, such as those described in [<xref ref-type="bibr" rid="B77-futureinternet-13-00117">77</xref>,<xref ref-type="bibr" rid="B78-futureinternet-13-00117">78</xref>,<xref ref-type="bibr" rid="B79-futureinternet-13-00117">79</xref>], could be included in our approach. However, it is worth nothing that, in case the attacker should exploit a node for which a behavioral model has been built during the <italic>safe starting phase</italic> to perform DoS attacks against others, the victims can leverage our approach to quickly identify any change in its behavior and, hence, isolate it. Although, this would not solve classical DoS attacks against the network, for which existing state-of-the-art approaches can be adopted, our strategy would provide a solution to Sleep Deprivation ones.</p>
        </sec>
        <sec id="sec6dot2dot6-futureinternet-13-00117">
          <title>6.2.6. <bold>SP.6</bold>&#x2014;Resistance to Fake Node Attacks</title>
          <p>An attacker can add a fake node to the system. He could do this for a number of reasons, the classical one is injecting malicious data through this fake node in the network, thus making low power devices busy and consuming their energy. If a malicious user wants to perform this kind of attack, he has to add the node during the <italic>safe starting phase</italic>, so that the other nodes can built a fingerprint model for it. But this cannot happen because of the Assumption <bold>A.3</bold>, indeed during the <italic>safe starting phase</italic> all the objects are assumed not malicious.</p>
          <p>By contrast, if the attacker tries to add the node during the subsequent phase no object will have a model for it and, consequently, the other nodes cannot evaluate its reliability. In this case, contacting this object may be considered a risk and, therefore, it could be either isolated or not involved in critical applications.</p>
        </sec>
        <sec id="sec6dot2dot7-futureinternet-13-00117">
          <title>6.2.7. <bold>SP.7</bold>&#x2014;Resistance to Sybil Attacks</title>
          <p>In this kind of attack, an adversary can control a single node, in such a way that this node claims the identity of many nodes and pretends to be them, thus distributing false routing information and/or trying to attack the consensus approach for the reliability assessment. However, thanks to Assumption <bold>A.3</bold>, this attack can happen only in the fully operational phase. At this point, objects will have fingerprint models to evaluate the behavior of their peers. According to the Sybil attack strategy, the malicious node must pretend to be several nodes and, therefore, it cannot maintain a stable behavior. As a consequence, our approach is resistant to this typology of attack.</p>
        </sec>
      </sec>
    </sec>
    <sec sec-type="conclusions" id="sec7-futureinternet-13-00117">
      <title>7. Conclusions</title>
      <p>In the last years, IoT devices have gained great autonomy and have become pervasive in everyday tasks. IoT incorporates heterogeneous hardware, communication protocols, and services. In such a diverse and complex ecosystem, numerous security challenges arise. The huge number of devices deployed and connected to the Internet can be hacked, corrupted or stolen. Moreover, also humans, owning smart devices or interacting with them, can be considered actors of the IoT network, especially, in according to the new SIoT paradigm. In such a scenario, each entity must be able to clearly identify and authenticate other entities to assess, before a communication, that neither the user has been impersonated nor the object corrupted. To tackle this issue, in this paper, we have presented a complete framework, called H2O (Human to Object) that provides a mechanism to assess if an object or a human are really who they claim to be. During a <italic>safe starting phase</italic>, the nodes interacting with each others, participate to the construction of suitable fingerprint models. Nodes having access to such models can continue to assess their neighbors reliability also in fully operational state. The other nodes can leverage the knowledge coming from their reliable peers to compute a derived score for nodes that they do not directly know. We evaluate the performances of our approach through an experimental campaign, useful also to tune the system parameters. Moreover, we report the attack model along with the security analysis of our solution, which, ultimately, shows that our framework addresses its objectives also in presence of attacks.</p>
      <p>The research issues addressed in this paper can be considered only a starting point for further efforts that we want to perform in the future. For instance, we plan to include in H2O a mechanism to generalize stereotypical fingerprints for specific typology of attackers. In this way, even in the absence of a direct model for a specific object, it could be possible to predict, according to the known attacker stereotypes, whether the node is a genuine or it roughly behaves as a possible attacked node.</p>
    </sec>
  </body>
  <back>
    <notes>
      <title>Author Contributions</title>
      <p>Conceptualization, S.N. and A.N.; Data curation, S.N.; Formal analysis, S.N. and A.N.; Investigation, M.F., S.N. and A.N.; Methodology, S.N. and A.N.; Software, S.N.; Supervision, M.F. and A.N.; Validation, S.N. and A.N.; Writing&#x2014;original draft, S.N. and A.N.; Writing&#x2014;review &amp; editing, M.F., S.N. and A.N. All authors have read and agreed to the published version of the manuscript.</p>
    </notes>
    <notes>
      <title>Funding</title>
      <p>This research received no external funding.</p>
    </notes>
    <notes>
      <title>Data Availability Statement</title>
      <p>Not Applicable, the study does not report any data.</p>
    </notes>
    <notes notes-type="COI-statement">
      <title>Conflicts of Interest</title>
      <p>The authors declare no conflict of interest.</p>
    </notes>
    <glossary>
      <title>Abbreviations</title>
      <p>The following abbreviations are used in this manuscript:
        <array><tbody><tr><td align="left" valign="middle">DoS</td><td align="left" valign="middle">Denial of Service</td></tr><tr><td align="left" valign="middle">ECG</td><td align="left" valign="middle">Electrocardiogram</td></tr><tr><td align="left" valign="middle">H2O</td><td align="left" valign="middle">Human To human and Object to object</td></tr><tr><td align="left" valign="middle">IMU</td><td align="left" valign="middle">Inertial Measurement Unit</td></tr><tr><td align="left" valign="middle">IoT</td><td align="left" valign="middle">Internet of Things</td></tr><tr><td align="left" valign="middle">MIoT</td><td align="left" valign="middle">Multiple Internet of Things</td></tr><tr><td align="left" valign="middle">ML</td><td align="left" valign="middle">Machine Learning</td></tr><tr><td align="left" valign="middle">NFC</td><td align="left" valign="middle">Near Field Communication</td></tr><tr><td align="left" valign="middle">NIST</td><td align="left" valign="middle">National Institute of Standards and Technology</td></tr><tr><td align="left" valign="middle">P2P</td><td align="left" valign="middle">Peer to Peer</td></tr><tr><td align="left" valign="middle">PAN</td><td align="left" valign="middle">Personal Area Network</td></tr><tr><td align="left" valign="middle">PDA</td><td align="left" valign="middle">Personal Digital Assistant</td></tr><tr><td align="left" valign="middle">PKI</td><td align="left" valign="middle">Public Key Infrastructure</td></tr><tr><td align="left" valign="middle">PPG</td><td align="left" valign="middle">Photoplethysmogram</td></tr><tr><td align="left" valign="middle">SIoT</td><td align="left" valign="middle">Social Internet of Things</td></tr><tr><td align="left" valign="middle">SP</td><td align="left" valign="middle">Security Property</td></tr><tr><td align="left" valign="middle">SWIM</td><td align="left" valign="middle">Small World in Motion</td></tr><tr><td align="left" valign="middle">RFID</td><td align="left" valign="middle">Radio Frequency Identification</td></tr></tbody></array></p>
    </glossary>
    <ref-list>
      <title>References</title>
      <ref id="B1-futureinternet-13-00117">
        <label>1.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Elkhodr</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Shahrestani</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Cheung</surname>
              <given-names>H.</given-names>
            </name>
          </person-group>
          <article-title>The internet of things: New interoperability, management and security challenges</article-title>
          <source>arXiv</source>
          <year>2016</year>
          <pub-id pub-id-type="arxiv">1604.04824</pub-id>
          <pub-id pub-id-type="doi">10.5121/ijnsa.2016.8206</pub-id>
        </element-citation>
      </ref>
      <ref id="B2-futureinternet-13-00117">
        <label>2.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Gonzalez-Manzano</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Fuentes</surname>
              <given-names>J.M.D.</given-names>
            </name>
            <name>
              <surname>Ribagorda</surname>
              <given-names>A.</given-names>
            </name>
          </person-group>
          <article-title>Leveraging user-related internet of things for continuous authentication: A survey</article-title>
          <source>ACM Comput. Surv. CSUR</source>
          <year>2019</year>
          <volume>52</volume>
          <fpage>1</fpage>
          <lpage>38</lpage>
          <pub-id pub-id-type="doi">10.1145/3314023</pub-id>
        </element-citation>
      </ref>
      <ref id="B3-futureinternet-13-00117">
        <label>3.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Guo</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>Z.</given-names>
            </name>
            <name>
              <surname>Yu</surname>
              <given-names>Z.</given-names>
            </name>
            <name>
              <surname>Zhou</surname>
              <given-names>X.</given-names>
            </name>
          </person-group>
          <article-title>Opportunistic IoT: Exploring the harmonious interaction between human and the internet of things</article-title>
          <source>J. Netw. Comput. Appl.</source>
          <year>2013</year>
          <volume>36</volume>
          <fpage>1531</fpage>
          <lpage>1539</lpage>
          <pub-id pub-id-type="doi">10.1016/j.jnca.2012.12.028</pub-id>
        </element-citation>
      </ref>
      <ref id="B4-futureinternet-13-00117">
        <label>4.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Kodali</surname>
              <given-names>R.K.</given-names>
            </name>
            <name>
              <surname>Swamy</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Lakshmi</surname>
              <given-names>B.</given-names>
            </name>
          </person-group>
          <article-title>An implementation of IoT for healthcare</article-title>
          <source>Proceedings of the 2015 IEEE Recent Advances in Intelligent Computational Systems (RAICS)</source>
          <conf-loc>Trivandrum, India</conf-loc>
          <conf-date>10&#x2013;12 December 2015</conf-date>
          <fpage>411</fpage>
          <lpage>416</lpage>
        </element-citation>
      </ref>
      <ref id="B5-futureinternet-13-00117">
        <label>5.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Nicolazzo</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Nocera</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Ursino</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Virgili</surname>
              <given-names>L.</given-names>
            </name>
          </person-group>
          <article-title>A privacy-preserving approach to prevent feature disclosure in an IoT scenario</article-title>
          <source>Future Gener. Comput. Syst.</source>
          <year>2020</year>
          <volume>105</volume>
          <fpage>502</fpage>
          <lpage>519</lpage>
          <pub-id pub-id-type="doi">10.1016/j.future.2019.12.017</pub-id>
        </element-citation>
      </ref>
      <ref id="B6-futureinternet-13-00117">
        <label>6.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Buccafurri</surname>
              <given-names>F.</given-names>
            </name>
            <name>
              <surname>Lax</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Nicolazzo</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Nocera</surname>
              <given-names>A.</given-names>
            </name>
          </person-group>
          <article-title>A privacy-preserving localization service for assisted living facilities</article-title>
          <source>IEEE Trans. Serv. Comput.</source>
          <year>2016</year>
          <volume>13</volume>
          <fpage>16</fpage>
          <lpage>29</lpage>
          <pub-id pub-id-type="doi">10.1109/TSC.2016.2646363</pub-id>
        </element-citation>
      </ref>
      <ref id="B7-futureinternet-13-00117">
        <label>7.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Ball</surname>
              <given-names>K.</given-names>
            </name>
          </person-group>
          <article-title>Workplace surveillance: An overview</article-title>
          <source>Labor Hist.</source>
          <year>2010</year>
          <volume>51</volume>
          <fpage>87</fpage>
          <lpage>106</lpage>
          <pub-id pub-id-type="doi">10.1080/00236561003654776</pub-id>
        </element-citation>
      </ref>
      <ref id="B8-futureinternet-13-00117">
        <label>8.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Shahzad</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Singh</surname>
              <given-names>M.P.</given-names>
            </name>
          </person-group>
          <article-title>Continuous authentication and authorization for the internet of things</article-title>
          <source>IEEE Internet Comput.</source>
          <year>2017</year>
          <volume>21</volume>
          <fpage>86</fpage>
          <lpage>90</lpage>
          <pub-id pub-id-type="doi">10.1109/MIC.2017.33</pub-id>
        </element-citation>
      </ref>
      <ref id="B9-futureinternet-13-00117">
        <label>9.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Pan</surname>
              <given-names>S.B.</given-names>
            </name>
            <name>
              <surname>Moon</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Gil</surname>
              <given-names>Y.</given-names>
            </name>
            <name>
              <surname>Ahn</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Chung</surname>
              <given-names>Y.</given-names>
            </name>
          </person-group>
          <article-title>An ultra-low memory fingerprint matching algorithm and its implementation on a 32-bit smart card</article-title>
          <source>IEEE Trans. Consum. Electron.</source>
          <year>2003</year>
          <volume>49</volume>
          <fpage>453</fpage>
          <lpage>459</lpage>
        </element-citation>
      </ref>
      <ref id="B10-futureinternet-13-00117">
        <label>10.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Thavalengal</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Bigioi</surname>
              <given-names>P.</given-names>
            </name>
            <name>
              <surname>Corcoran</surname>
              <given-names>P.</given-names>
            </name>
          </person-group>
          <article-title>Iris authentication in handheld devices-considerations for constraint-free acquisition</article-title>
          <source>IEEE Trans. Consum. Electron.</source>
          <year>2015</year>
          <volume>61</volume>
          <fpage>245</fpage>
          <lpage>253</lpage>
          <pub-id pub-id-type="doi">10.1109/TCE.2015.7150600</pub-id>
        </element-citation>
      </ref>
      <ref id="B11-futureinternet-13-00117">
        <label>11.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Kim</surname>
              <given-names>D.J.</given-names>
            </name>
            <name>
              <surname>Chung</surname>
              <given-names>K.W.</given-names>
            </name>
            <name>
              <surname>Hong</surname>
              <given-names>K.S.</given-names>
            </name>
          </person-group>
          <article-title>Person authentication using face, teeth and voice modalities for mobile device security</article-title>
          <source>IEEE Trans. Consum. Electron.</source>
          <year>2010</year>
          <volume>56</volume>
          <fpage>2678</fpage>
          <lpage>2685</lpage>
          <pub-id pub-id-type="doi">10.1109/TCE.2010.5681156</pub-id>
        </element-citation>
      </ref>
      <ref id="B12-futureinternet-13-00117">
        <label>12.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Lee</surname>
              <given-names>K.</given-names>
            </name>
            <name>
              <surname>Byun</surname>
              <given-names>H.</given-names>
            </name>
          </person-group>
          <article-title>A new face authentication system for memory-constrained devices</article-title>
          <source>IEEE Trans. Consum. Electron.</source>
          <year>2003</year>
          <volume>49</volume>
          <fpage>1214</fpage>
          <lpage>1222</lpage>
        </element-citation>
      </ref>
      <ref id="B13-futureinternet-13-00117">
        <label>13.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Anjomshoa</surname>
              <given-names>F.</given-names>
            </name>
            <name>
              <surname>Catalfamo</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Hecker</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Helgeland</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Rasch</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Kantarci</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Erol-Kantarci</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Schuckers</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>Mobile behaviometric framework for sociability assessment and identification of smartphone users</article-title>
          <source>Proceedings of the 2016 IEEE Symposium on Computers and Communication (ISCC)</source>
          <conf-loc>Messina, Italy</conf-loc>
          <conf-date>27&#x2013;30 June 2016</conf-date>
          <fpage>1084</fpage>
          <lpage>1089</lpage>
        </element-citation>
      </ref>
      <ref id="B14-futureinternet-13-00117">
        <label>14.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Anjomshoa</surname>
              <given-names>F.</given-names>
            </name>
            <name>
              <surname>Aloqaily</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Kantarci</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Erol-Kantarci</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Schuckers</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>Social behaviometrics for personalized devices in the internet of things era</article-title>
          <source>IEEE Access</source>
          <year>2017</year>
          <volume>5</volume>
          <fpage>12199</fpage>
          <lpage>12213</lpage>
          <pub-id pub-id-type="doi">10.1109/ACCESS.2017.2719706</pub-id>
        </element-citation>
      </ref>
      <ref id="B15-futureinternet-13-00117">
        <label>15.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Abera</surname>
              <given-names>T.</given-names>
            </name>
            <name>
              <surname>Asokan</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Davi</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Koushanfar</surname>
              <given-names>F.</given-names>
            </name>
            <name>
              <surname>Paverd</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Sadeghi</surname>
              <given-names>A.R.</given-names>
            </name>
            <name>
              <surname>Tsudik</surname>
              <given-names>G.</given-names>
            </name>
          </person-group>
          <article-title>Things, trouble, trust: On building trust in IoT systems</article-title>
          <source>Proceedings of the 53rd Annual Design Automation Conference</source>
          <conf-loc>Austin, TX, USA</conf-loc>
          <conf-date>5&#x2013;9 June 2016</conf-date>
          <fpage>1</fpage>
          <lpage>6</lpage>
        </element-citation>
      </ref>
      <ref id="B16-futureinternet-13-00117">
        <label>16.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Chen</surname>
              <given-names>H.</given-names>
            </name>
            <name>
              <surname>Han</surname>
              <given-names>P.</given-names>
            </name>
            <name>
              <surname>Yu</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Gao</surname>
              <given-names>C.</given-names>
            </name>
          </person-group>
          <article-title>A new kind of session keys based on message scheme for sensor networks</article-title>
          <source>Proceedings of the 2005 Asia-Pacific Microwave Conference Proceedings. Suzhou</source>
          <conf-loc>China</conf-loc>
          <conf-date>4&#x2013;7 December 2005</conf-date>
          <volume>Volume 1</volume>
          <fpage>4</fpage>
        </element-citation>
      </ref>
      <ref id="B17-futureinternet-13-00117">
        <label>17.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Karlof</surname>
              <given-names>C.</given-names>
            </name>
            <name>
              <surname>Sastry</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Wagner</surname>
              <given-names>D.</given-names>
            </name>
          </person-group>
          <article-title>TinySec: A link layer security architecture for wireless sensor networks</article-title>
          <source>Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems</source>
          <conf-loc>Baltimore, MD, USA</conf-loc>
          <conf-date>3&#x2013;5 November 2004</conf-date>
          <fpage>162</fpage>
          <lpage>175</lpage>
        </element-citation>
      </ref>
      <ref id="B18-futureinternet-13-00117">
        <label>18.</label>
        <element-citation publication-type="book">
          <person-group person-group-type="author">
            <name>
              <surname>Deng</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Han</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Mishra</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>A performance evaluation of intrusion-tolerant routing in wireless sensor networks</article-title>
          <source>Information Processing in Sensor Networks</source>
          <publisher-name>Springer</publisher-name>
          <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>
          <year>2003</year>
          <fpage>349</fpage>
          <lpage>364</lpage>
        </element-citation>
      </ref>
      <ref id="B19-futureinternet-13-00117">
        <label>19.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Buccafurri</surname>
              <given-names>F.</given-names>
            </name>
            <name>
              <surname>Lax</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Migdal</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Nicolazzo</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Nocera</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Rosenberger</surname>
              <given-names>C.</given-names>
            </name>
          </person-group>
          <article-title>Contrasting false identities in social networks by trust chains and biometric reinforcement</article-title>
          <source>Proceedings of the 2017 International Conference on Cyberworlds (CW)</source>
          <conf-loc>Chester, UK</conf-loc>
          <conf-date>20&#x2013;22 September 2017</conf-date>
          <fpage>17</fpage>
          <lpage>24</lpage>
        </element-citation>
      </ref>
      <ref id="B20-futureinternet-13-00117">
        <label>20.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Liu</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Shi</surname>
              <given-names>W.</given-names>
            </name>
          </person-group>
          <article-title>Trust and reputation management</article-title>
          <source>IEEE Internet Comput.</source>
          <year>2010</year>
          <volume>14</volume>
          <fpage>10</fpage>
          <lpage>13</lpage>
          <pub-id pub-id-type="doi">10.1109/MIC.2010.124</pub-id>
        </element-citation>
      </ref>
      <ref id="B21-futureinternet-13-00117">
        <label>21.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Hamad</surname>
              <given-names>S.A.</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>W.E.</given-names>
            </name>
            <name>
              <surname>Sheng</surname>
              <given-names>Q.Z.</given-names>
            </name>
            <name>
              <surname>Nepal</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>IoT device Identification via network-flow based fingerprinting and learning</article-title>
          <source>Proceedings of the 2019 18th IEEE International Conference on Trust, Security and Privacy in Computing and Communications/13th IEEE International Conference on Big Data Science and Engineering (TrustCom/BigDataSE)</source>
          <conf-loc>Rotorua, New Zealand</conf-loc>
          <conf-date>5&#x2013;8 August 2019</conf-date>
          <fpage>103</fpage>
          <lpage>111</lpage>
        </element-citation>
      </ref>
      <ref id="B22-futureinternet-13-00117">
        <label>22.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Miettinen</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Marchal</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Hafeez</surname>
              <given-names>I.</given-names>
            </name>
            <name>
              <surname>Asokan</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Sadeghi</surname>
              <given-names>A.R.</given-names>
            </name>
            <name>
              <surname>Tarkoma</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>Iot sentinel: Automated device-type identification for security enforcement in iot</article-title>
          <source>Proceedings of the 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)</source>
          <conf-loc>Atlanta, GA, USA</conf-loc>
          <conf-date>5&#x2013;8 June 2017</conf-date>
          <fpage>2177</fpage>
          <lpage>2184</lpage>
        </element-citation>
      </ref>
      <ref id="B23-futureinternet-13-00117">
        <label>23.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Aneja</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Aneja</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Islam</surname>
              <given-names>M.S.</given-names>
            </name>
          </person-group>
          <article-title>IoT device fingerprint using deep learning</article-title>
          <source>Proceedings of the 2018 IEEE International Conference on Internet of Things and Intelligence System (IOTAIS)</source>
          <conf-loc>Bali, Indonesia</conf-loc>
          <conf-date>1&#x2013;3 November 2018</conf-date>
          <fpage>174</fpage>
          <lpage>179</lpage>
        </element-citation>
      </ref>
      <ref id="B24-futureinternet-13-00117">
        <label>24.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Guennoun</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Abbad</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Talom</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Rahman</surname>
              <given-names>S.M.M.</given-names>
            </name>
            <name>
              <surname>El-Khatib</surname>
              <given-names>K.</given-names>
            </name>
          </person-group>
          <article-title>Continuous authentication by electrocardiogram data</article-title>
          <source>Proceedings of the 2009 IEEE Toronto International Conference Science and Technology for Humanity (TIC-STH)</source>
          <conf-loc>Toronto, ON, Canada</conf-loc>
          <conf-date>26&#x2013;27 September 2009</conf-date>
          <fpage>40</fpage>
          <lpage>42</lpage>
        </element-citation>
      </ref>
      <ref id="B25-futureinternet-13-00117">
        <label>25.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Down</surname>
              <given-names>M.P.</given-names>
            </name>
            <name>
              <surname>Sands</surname>
              <given-names>R.J.</given-names>
            </name>
          </person-group>
          <article-title>Biometrics: An overview of the technology, challenges and control considerations</article-title>
          <source>Inf. Syst. Control. J.</source>
          <year>2004</year>
          <volume>4</volume>
          <fpage>53</fpage>
          <lpage>56</lpage>
        </element-citation>
      </ref>
      <ref id="B26-futureinternet-13-00117">
        <label>26.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Bo</surname>
              <given-names>C.</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Jung</surname>
              <given-names>T.</given-names>
            </name>
            <name>
              <surname>Han</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Li</surname>
              <given-names>X.Y.</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>Y.</given-names>
            </name>
          </person-group>
          <article-title>Continuous user identification via touch and movement behavioral biometrics</article-title>
          <source>Proceedings of the 2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)</source>
          <conf-loc>Austin, TX, USA</conf-loc>
          <conf-date>5&#x2013;7 December 2014</conf-date>
          <fpage>1</fpage>
          <lpage>8</lpage>
        </element-citation>
      </ref>
      <ref id="B27-futureinternet-13-00117">
        <label>27.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Messerman</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Mustafi&#x107;</surname>
              <given-names>T.</given-names>
            </name>
            <name>
              <surname>Camtepe</surname>
              <given-names>S.A.</given-names>
            </name>
            <name>
              <surname>Albayrak</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>Continuous and non-intrusive identity verification in real-time environments based on free-text keystroke dynamics</article-title>
          <source>Proceedings of the 2011 International Joint Conference on Biometrics (IJCB)</source>
          <conf-loc>Washington, DC, USA</conf-loc>
          <conf-date>11&#x2013;13 October 2011</conf-date>
          <fpage>1</fpage>
          <lpage>8</lpage>
        </element-citation>
      </ref>
      <ref id="B28-futureinternet-13-00117">
        <label>28.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Monaco</surname>
              <given-names>J.V.</given-names>
            </name>
            <name>
              <surname>Bakelman</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Cha</surname>
              <given-names>S.H.</given-names>
            </name>
            <name>
              <surname>Tappert</surname>
              <given-names>C.C.</given-names>
            </name>
          </person-group>
          <article-title>Developing a keystroke biometric system for continual authentication of computer users</article-title>
          <source>Proceedings of the 2012 European Intelligence and Security Informatics Conference</source>
          <conf-loc>Odense, Denmark</conf-loc>
          <conf-date>22&#x2013;24 August 2012</conf-date>
          <fpage>210</fpage>
          <lpage>216</lpage>
        </element-citation>
      </ref>
      <ref id="B29-futureinternet-13-00117">
        <label>29.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Roggen</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Wirz</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Tr&#xF6;ster</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Helbing</surname>
              <given-names>D.</given-names>
            </name>
          </person-group>
          <article-title>Recognition of crowd behavior from mobile sensors with pattern analysis and graph clustering methods</article-title>
          <source>arXiv</source>
          <year>2011</year>
          <pub-id pub-id-type="arxiv">1109.1664</pub-id>
          <pub-id pub-id-type="doi">10.3934/nhm.2011.6.521</pub-id>
        </element-citation>
      </ref>
      <ref id="B30-futureinternet-13-00117">
        <label>30.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Tan</surname>
              <given-names>H.</given-names>
            </name>
            <name>
              <surname>Tsudik</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Jha</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>MTRA: Multiple-tier remote attestation in IoT networks</article-title>
          <source>Proceedings of the 2017 IEEE Conference on Communications and Network Security (CNS)</source>
          <conf-loc>Las Vegas, NV, USA</conf-loc>
          <conf-date>9&#x2013;11 October 2017</conf-date>
          <fpage>1</fpage>
          <lpage>9</lpage>
        </element-citation>
      </ref>
      <ref id="B31-futureinternet-13-00117">
        <label>31.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Kuang</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Fu</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Yu</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Yang</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Su</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>Y.</given-names>
            </name>
          </person-group>
          <article-title>ESDRA: An efficient and secure distributed remote attestation scheme for IoT swarms</article-title>
          <source>IEEE Internet Things J.</source>
          <year>2019</year>
          <volume>6</volume>
          <fpage>8372</fpage>
          <lpage>8383</lpage>
          <pub-id pub-id-type="doi">10.1109/JIOT.2019.2917223</pub-id>
        </element-citation>
      </ref>
      <ref id="B32-futureinternet-13-00117">
        <label>32.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Kostas</surname>
              <given-names>K.</given-names>
            </name>
            <name>
              <surname>Just</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Lones</surname>
              <given-names>M.A.</given-names>
            </name>
          </person-group>
          <article-title>IoTDevID: A Behaviour-Based Fingerprinting Method for Device Identification in the IoT</article-title>
          <source>arXiv</source>
          <year>2021</year>
          <pub-id pub-id-type="arxiv">2102.08866</pub-id>
        </element-citation>
      </ref>
      <ref id="B33-futureinternet-13-00117">
        <label>33.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Bezawada</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Bachani</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Peterson</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Shirazi</surname>
              <given-names>H.</given-names>
            </name>
            <name>
              <surname>Ray</surname>
              <given-names>I.</given-names>
            </name>
            <name>
              <surname>Ray</surname>
              <given-names>I.</given-names>
            </name>
          </person-group>
          <article-title>Behavioral fingerprinting of iot devices</article-title>
          <source>Proceedings of the 2018 Workshop on Attacks and Solutions in Hardware Security</source>
          <conf-loc>New York, NY, USA</conf-loc>
          <conf-date>15&#x2013;19 October 2018</conf-date>
          <fpage>41</fpage>
          <lpage>50</lpage>
        </element-citation>
      </ref>
      <ref id="B34-futureinternet-13-00117">
        <label>34.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Sicari</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Rizzardi</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Grieco</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Coen-Porisini</surname>
              <given-names>A.</given-names>
            </name>
          </person-group>
          <article-title>Security, privacy and trust in Internet of Things: The road ahead</article-title>
          <source>Comput. Netw.</source>
          <year>2015</year>
          <volume>76</volume>
          <fpage>146</fpage>
          <lpage>164</lpage>
          <pub-id pub-id-type="doi">10.1016/j.comnet.2014.11.008</pub-id>
        </element-citation>
      </ref>
      <ref id="B35-futureinternet-13-00117">
        <label>35.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Chen</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Chang</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Sun</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Li</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Jia</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>X.</given-names>
            </name>
          </person-group>
          <article-title>TRM-IoT: A trust management model based on fuzzy reputation for Internet of Things</article-title>
          <source>Comput. Sci. Inf. Syst.</source>
          <year>2011</year>
          <volume>8</volume>
          <fpage>1207</fpage>
          <lpage>1228</lpage>
          <pub-id pub-id-type="doi">10.2298/CSIS110303056C</pub-id>
        </element-citation>
      </ref>
      <ref id="B36-futureinternet-13-00117">
        <label>36.</label>
        <element-citation publication-type="book">
          <person-group person-group-type="author">
            <name>
              <surname>Ganeriwal</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Kumar</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Han</surname>
              <given-names>C.</given-names>
            </name>
            <name>
              <surname>Lee</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Srivastava</surname>
              <given-names>M.</given-names>
            </name>
          </person-group>
          <source>Location &amp; Identity based Secure Event Report Generation for Sensor Networks</source>
          <comment>NESL Technical Report</comment>
          <publisher-name>Springer</publisher-name>
          <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>
          <year>2004</year>
        </element-citation>
      </ref>
      <ref id="B37-futureinternet-13-00117">
        <label>37.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Chen</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Tian</surname>
              <given-names>Z.</given-names>
            </name>
            <name>
              <surname>Cui</surname>
              <given-names>X.</given-names>
            </name>
            <name>
              <surname>Yin</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>X.</given-names>
            </name>
          </person-group>
          <article-title>Trust architecture and reputation evaluation for internet of things</article-title>
          <source>J. Ambient. Intell. Humaniz. Comput.</source>
          <year>2019</year>
          <volume>10</volume>
          <fpage>3099</fpage>
          <lpage>3107</lpage>
          <pub-id pub-id-type="doi">10.1007/s12652-018-0887-z</pub-id>
        </element-citation>
      </ref>
      <ref id="B38-futureinternet-13-00117">
        <label>38.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Pietro</surname>
              <given-names>R.D.</given-names>
            </name>
            <name>
              <surname>Salleras</surname>
              <given-names>X.</given-names>
            </name>
            <name>
              <surname>Signorini</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Waisbard</surname>
              <given-names>E.</given-names>
            </name>
          </person-group>
          <article-title>A blockchain-based Trust System for the Internet of Things</article-title>
          <source>Proceedings of the ACM International Symposium on Access Control Models and Technologies (SACMAT&#x2019;18)</source>
          <conf-loc>Indianapolis, IN, USA</conf-loc>
          <conf-date>13&#x2013;15 June 2018</conf-date>
          <fpage>77</fpage>
          <lpage>83</lpage>
        </element-citation>
      </ref>
      <ref id="B39-futureinternet-13-00117">
        <label>39.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Lin</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Shen</surname>
              <given-names>Z.</given-names>
            </name>
            <name>
              <surname>Miao</surname>
              <given-names>C.</given-names>
            </name>
          </person-group>
          <article-title>Using blockchain technology to build trust in sharing LoRaWAN IoT</article-title>
          <source>Proceedings of the International Conference on Crowd Science and Engineering (ICCSE&#x2019;17)</source>
          <conf-loc>Beijing, China</conf-loc>
          <conf-date>6&#x2013;9 July 2017</conf-date>
          <fpage>38</fpage>
          <lpage>43</lpage>
        </element-citation>
      </ref>
      <ref id="B40-futureinternet-13-00117">
        <label>40.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Hammi</surname>
              <given-names>M.T.</given-names>
            </name>
            <name>
              <surname>Hammi</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Bellot</surname>
              <given-names>P.</given-names>
            </name>
            <name>
              <surname>Serhrouchni</surname>
              <given-names>A.</given-names>
            </name>
          </person-group>
          <article-title>Bubbles of Trust: A decentralized blockchain-based authentication system for IoT</article-title>
          <source>Comput. Secur.</source>
          <year>2018</year>
          <volume>78</volume>
          <fpage>126</fpage>
          <lpage>142</lpage>
          <pub-id pub-id-type="doi">10.1016/j.cose.2018.06.004</pub-id>
        </element-citation>
      </ref>
      <ref id="B41-futureinternet-13-00117">
        <label>41.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Atzori</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Iera</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Morabito</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Nitti</surname>
              <given-names>M.</given-names>
            </name>
          </person-group>
          <article-title>The social internet of things (siot)&#x2013;when social networks meet the internet of things: Concept, architecture and network characterization</article-title>
          <source>Comput. Netw.</source>
          <year>2012</year>
          <volume>56</volume>
          <fpage>3594</fpage>
          <lpage>3608</lpage>
          <pub-id pub-id-type="doi">10.1016/j.comnet.2012.07.010</pub-id>
        </element-citation>
      </ref>
      <ref id="B42-futureinternet-13-00117">
        <label>42.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Atzori</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Iera</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Morabito</surname>
              <given-names>G.</given-names>
            </name>
          </person-group>
          <article-title>From &#x201C;smart objects&#x201D; to &#x201C;social objects&#x201D;: The next evolutionary step of the internet of things</article-title>
          <source>IEEE Commun. Mag.</source>
          <year>2014</year>
          <volume>52</volume>
          <fpage>97</fpage>
          <lpage>105</lpage>
          <pub-id pub-id-type="doi">10.1109/MCOM.2014.6710070</pub-id>
        </element-citation>
      </ref>
      <ref id="B43-futureinternet-13-00117">
        <label>43.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Nitti</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Girau</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Atzori</surname>
              <given-names>L.</given-names>
            </name>
          </person-group>
          <article-title>Trustworthiness management in the social internet of things</article-title>
          <source>IEEE Trans. Knowl. Data Eng.</source>
          <year>2013</year>
          <volume>26</volume>
          <fpage>1253</fpage>
          <lpage>1266</lpage>
          <pub-id pub-id-type="doi">10.1109/TKDE.2013.105</pub-id>
        </element-citation>
      </ref>
      <ref id="B44-futureinternet-13-00117">
        <label>44.</label>
        <element-citation publication-type="book">
          <person-group person-group-type="author">
            <name>
              <surname>Ursino</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Virgili</surname>
              <given-names>L.</given-names>
            </name>
          </person-group>
          <article-title>Humanizing IoT: Defining the profile and the reliability of a thing in a multi-IoT scenario</article-title>
          <source>Toward Social Internet of Things (SIoT): Enabling Technologies, Architectures and Applications</source>
          <publisher-name>Springer</publisher-name>
          <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>
          <year>2020</year>
          <fpage>51</fpage>
          <lpage>76</lpage>
        </element-citation>
      </ref>
      <ref id="B45-futureinternet-13-00117">
        <label>45.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Sherchan</surname>
              <given-names>W.</given-names>
            </name>
            <name>
              <surname>Nepal</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Paris</surname>
              <given-names>C.</given-names>
            </name>
          </person-group>
          <article-title>A survey of trust in social networks</article-title>
          <source>ACM Comput. Surv. CSUR</source>
          <year>2013</year>
          <volume>45</volume>
          <fpage>1</fpage>
          <lpage>33</lpage>
          <pub-id pub-id-type="doi">10.1145/2501654.2501661</pub-id>
        </element-citation>
      </ref>
      <ref id="B46-futureinternet-13-00117">
        <label>46.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Gligor</surname>
              <given-names>V.</given-names>
            </name>
            <name>
              <surname>Wing</surname>
              <given-names>J.</given-names>
            </name>
          </person-group>
          <article-title>Towards a theory of trust in networks of humans and computers</article-title>
          <source>Proceedings of the International Workshop on Security Protocols</source>
          <conf-loc>Cambridge, UK</conf-loc>
          <conf-date>28&#x2013;30 March 2011</conf-date>
          <publisher-name>Springer</publisher-name>
          <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>
          <year>2011</year>
          <fpage>223</fpage>
          <lpage>242</lpage>
        </element-citation>
      </ref>
      <ref id="B47-futureinternet-13-00117">
        <label>47.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Tsikerdekis</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Zeadally</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>Detecting and preventing online identity deception in social networking services</article-title>
          <source>IEEE Internet Comput.</source>
          <year>2015</year>
          <volume>19</volume>
          <fpage>41</fpage>
          <lpage>49</lpage>
          <pub-id pub-id-type="doi">10.1109/MIC.2015.21</pub-id>
        </element-citation>
      </ref>
      <ref id="B48-futureinternet-13-00117">
        <label>48.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Podobnik</surname>
              <given-names>V.</given-names>
            </name>
            <name>
              <surname>Striga</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Jandras</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Lovrek</surname>
              <given-names>I.</given-names>
            </name>
          </person-group>
          <article-title>How to calculate trust between social network users?</article-title>
          <source>Proceedings of the 20th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2012)</source>
          <conf-loc>Split, Croatia</conf-loc>
          <conf-date>11&#x2013;13 September 2012</conf-date>
          <fpage>1</fpage>
          <lpage>6</lpage>
        </element-citation>
      </ref>
      <ref id="B49-futureinternet-13-00117">
        <label>49.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Adali</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Escriva</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Goldberg</surname>
              <given-names>M.K.</given-names>
            </name>
            <name>
              <surname>Hayvanovych</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Magdon-Ismail</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Szymanski</surname>
              <given-names>B.K.</given-names>
            </name>
            <name>
              <surname>Wallace</surname>
              <given-names>W.A.</given-names>
            </name>
            <name>
              <surname>Williams</surname>
              <given-names>G.</given-names>
            </name>
          </person-group>
          <article-title>Measuring behavioral trust in social networks</article-title>
          <source>Proceedings of the 2010 IEEE International Conference on Intelligence and Security Informatics</source>
          <conf-loc>Vancouver, BC, Canada</conf-loc>
          <conf-date>23&#x2013;26 May 2010</conf-date>
          <fpage>150</fpage>
          <lpage>152</lpage>
        </element-citation>
      </ref>
      <ref id="B50-futureinternet-13-00117">
        <label>50.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Walter</surname>
              <given-names>F.E.</given-names>
            </name>
            <name>
              <surname>Battiston</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Schweitzer</surname>
              <given-names>F.</given-names>
            </name>
          </person-group>
          <article-title>A model of a trust-based recommendation system on a social network</article-title>
          <source>Auton. Agents Multi-Agent Syst.</source>
          <year>2008</year>
          <volume>16</volume>
          <fpage>57</fpage>
          <lpage>74</lpage>
          <pub-id pub-id-type="doi">10.1007/s10458-007-9021-x</pub-id>
        </element-citation>
      </ref>
      <ref id="B51-futureinternet-13-00117">
        <label>51.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Alvi</surname>
              <given-names>S.A.</given-names>
            </name>
            <name>
              <surname>Afzal</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Shah</surname>
              <given-names>G.A.</given-names>
            </name>
            <name>
              <surname>Atzori</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Mahmood</surname>
              <given-names>W.</given-names>
            </name>
          </person-group>
          <article-title>Internet of multimedia things: Vision and challenges</article-title>
          <source>Ad Hoc Netw.</source>
          <year>2015</year>
          <volume>33</volume>
          <fpage>87</fpage>
          <lpage>111</lpage>
          <pub-id pub-id-type="doi">10.1016/j.adhoc.2015.04.006</pub-id>
        </element-citation>
      </ref>
      <ref id="B52-futureinternet-13-00117">
        <label>52.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Sewak</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Singh</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>IoT and distributed machine learning powered optimal state recommender solution</article-title>
          <source>Proceedings of the 2016 International Conference on Internet of Things and Applications (IOTA)</source>
          <conf-loc>Pune, India</conf-loc>
          <conf-date>22&#x2013;24 January 2016</conf-date>
          <fpage>101</fpage>
          <lpage>106</lpage>
        </element-citation>
      </ref>
      <ref id="B53-futureinternet-13-00117">
        <label>53.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Bezawada</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Ray</surname>
              <given-names>I.</given-names>
            </name>
            <name>
              <surname>Ray</surname>
              <given-names>I.</given-names>
            </name>
          </person-group>
          <article-title>Behavioral fingerprinting of Internet-of-Things devices</article-title>
          <source>Wiley Interdiscip. Rev. Data Min. Knowl. Discov.</source>
          <year>2021</year>
          <volume>11</volume>
          <fpage>e1337</fpage>
          <pub-id pub-id-type="doi">10.1002/widm.1337</pub-id>
        </element-citation>
      </ref>
      <ref id="B54-futureinternet-13-00117">
        <label>54.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Guo</surname>
              <given-names>B.</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Yu</surname>
              <given-names>Z.</given-names>
            </name>
            <name>
              <surname>Zhou</surname>
              <given-names>X.</given-names>
            </name>
            <name>
              <surname>Zhou</surname>
              <given-names>Z.</given-names>
            </name>
          </person-group>
          <article-title>Enhancing spontaneous interaction in opportunistic mobile social networks</article-title>
          <source>Commun. Mob. Comput.</source>
          <year>2012</year>
          <volume>1</volume>
          <fpage>1</fpage>
          <lpage>6</lpage>
          <pub-id pub-id-type="doi">10.1186/2192-1121-1-6</pub-id>
        </element-citation>
      </ref>
      <ref id="B55-futureinternet-13-00117">
        <label>55.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Kumar</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Phoha</surname>
              <given-names>V.</given-names>
            </name>
            <name>
              <surname>Serwadda</surname>
              <given-names>A.</given-names>
            </name>
          </person-group>
          <article-title>Continuous authentication of smartphone users by fusing typing, swiping, and phone movement patterns</article-title>
          <source>Proceedings of the 2016 IEEE 8th International Conference on Biometrics Theory, Applications and Systems (BTAS)</source>
          <conf-loc>Niagara Falls, NY, USA</conf-loc>
          <conf-date>6&#x2013;9 September 2016</conf-date>
          <fpage>1</fpage>
          <lpage>8</lpage>
        </element-citation>
      </ref>
      <ref id="B56-futureinternet-13-00117">
        <label>56.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Dalai</surname>
              <given-names>A.K.</given-names>
            </name>
            <name>
              <surname>Jena</surname>
              <given-names>S.K.</given-names>
            </name>
          </person-group>
          <article-title>Wdtf: A technique for wireless device type fingerprinting</article-title>
          <source>Wirel. Pers. Commun.</source>
          <year>2017</year>
          <volume>97</volume>
          <fpage>1911</fpage>
          <lpage>1928</lpage>
          <pub-id pub-id-type="doi">10.1007/s11277-017-4652-y</pub-id>
        </element-citation>
      </ref>
      <ref id="B57-futureinternet-13-00117">
        <label>57.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Oser</surname>
              <given-names>P.</given-names>
            </name>
            <name>
              <surname>Kargl</surname>
              <given-names>F.</given-names>
            </name>
            <name>
              <surname>L&#xFC;ders</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>Identifying devices of the internet of things using machine learning on clock characteristics</article-title>
          <source>Proceedings of the International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage</source>
          <conf-loc>Melbourne, Australia</conf-loc>
          <conf-date>11&#x2013;13 December 2018</conf-date>
          <publisher-name>Springer</publisher-name>
          <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>
          <year>2018</year>
          <fpage>417</fpage>
          <lpage>427</lpage>
        </element-citation>
      </ref>
      <ref id="B58-futureinternet-13-00117">
        <label>58.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Meidan</surname>
              <given-names>Y.</given-names>
            </name>
            <name>
              <surname>Bohadana</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Shabtai</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Guarnizo</surname>
              <given-names>J.D.</given-names>
            </name>
            <name>
              <surname>Ochoa</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Tippenhauer</surname>
              <given-names>N.O.</given-names>
            </name>
            <name>
              <surname>Elovici</surname>
              <given-names>Y.</given-names>
            </name>
          </person-group>
          <article-title>ProfilIoT: A machine learning approach for IoT device identification based on network traffic analysis</article-title>
          <source>Proceedings of the Symposium on Applied Computing</source>
          <conf-loc>Marrakech, Morocco</conf-loc>
          <conf-date>3&#x2013;7 April 2017</conf-date>
          <fpage>506</fpage>
          <lpage>509</lpage>
        </element-citation>
      </ref>
      <ref id="B59-futureinternet-13-00117">
        <label>59.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Bai</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Yao</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Kanhere</surname>
              <given-names>S.S.</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>X.</given-names>
            </name>
            <name>
              <surname>Yang</surname>
              <given-names>Z.</given-names>
            </name>
          </person-group>
          <article-title>Automatic device classification from network traffic streams of internet of things</article-title>
          <source>Proceedings of the 2018 IEEE 43rd Conference on Local Computer Networks (LCN)</source>
          <conf-loc>Chicago, IL, USA</conf-loc>
          <conf-date>1&#x2013;4 October 2018</conf-date>
          <fpage>1</fpage>
          <lpage>9</lpage>
        </element-citation>
      </ref>
      <ref id="B60-futureinternet-13-00117">
        <label>60.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Thangavelu</surname>
              <given-names>V.</given-names>
            </name>
            <name>
              <surname>Divakaran</surname>
              <given-names>D.M.</given-names>
            </name>
            <name>
              <surname>Sairam</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Bhunia</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Gurusamy</surname>
              <given-names>M.</given-names>
            </name>
          </person-group>
          <article-title>DEFT: A distributed IoT fingerprinting technique</article-title>
          <source>IEEE Internet Things J.</source>
          <year>2018</year>
          <volume>6</volume>
          <fpage>940</fpage>
          <lpage>952</lpage>
          <pub-id pub-id-type="doi">10.1109/JIOT.2018.2865604</pub-id>
        </element-citation>
      </ref>
      <ref id="B61-futureinternet-13-00117">
        <label>61.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Kozik</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Chora&#x15B;</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Ficco</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Palmieri</surname>
              <given-names>F.</given-names>
            </name>
          </person-group>
          <article-title>A scalable distributed machine learning approach for attack detection in edge computing environments</article-title>
          <source>J. Parallel Distrib. Comput.</source>
          <year>2018</year>
          <volume>119</volume>
          <fpage>18</fpage>
          <lpage>26</lpage>
          <pub-id pub-id-type="doi">10.1016/j.jpdc.2018.03.006</pub-id>
        </element-citation>
      </ref>
      <ref id="B62-futureinternet-13-00117">
        <label>62.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Kataria</surname>
              <given-names>A.N.</given-names>
            </name>
            <name>
              <surname>Adhyaru</surname>
              <given-names>D.M.</given-names>
            </name>
            <name>
              <surname>Sharma</surname>
              <given-names>A.K.</given-names>
            </name>
            <name>
              <surname>Zaveri</surname>
              <given-names>T.H.</given-names>
            </name>
          </person-group>
          <article-title>A survey of automated biometric authentication techniques</article-title>
          <source>Proceedings of the 2013 Nirma University International Conference on Engineering (NUiCONE)</source>
          <conf-loc>Ahmedabad, India</conf-loc>
          <conf-date>28&#x2013;30 November 2013</conf-date>
          <fpage>1</fpage>
          <lpage>6</lpage>
        </element-citation>
      </ref>
      <ref id="B63-futureinternet-13-00117">
        <label>63.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Bartlow</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Waymire</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Zektser</surname>
              <given-names>G.</given-names>
            </name>
          </person-group>
          <article-title>Holistic Evaluation of Multi-Biometric Systems</article-title>
          <source>Proceedings of the 2010 National Institute of Standards and Technology</source>
          <conf-loc>Washington, DC, USA</conf-loc>
          <conf-date>1&#x2013;5 March 2009</conf-date>
        </element-citation>
      </ref>
      <ref id="B64-futureinternet-13-00117">
        <label>64.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Shanmugapriya</surname>
              <given-names>D.</given-names>
            </name>
            <name>
              <surname>Padmavathi</surname>
              <given-names>G.</given-names>
            </name>
          </person-group>
          <article-title>A survey of biometric keystroke dynamics: Approaches, security and challenges</article-title>
          <source>arXiv</source>
          <year>2009</year>
          <pub-id pub-id-type="arxiv">0910.0817</pub-id>
        </element-citation>
      </ref>
      <ref id="B65-futureinternet-13-00117">
        <label>65.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>St&#xF6;ber</surname>
              <given-names>T.</given-names>
            </name>
            <name>
              <surname>Frank</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Schmitt</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Martinovic</surname>
              <given-names>I.</given-names>
            </name>
          </person-group>
          <article-title>Who do you sync you are? smartphone fingerprinting via application behaviour</article-title>
          <source>Proceedings of the Sixth ACM Conference on Security and Privacy in Wireless and Mobile Networks</source>
          <conf-loc>Budapest, Hungary</conf-loc>
          <conf-date>17&#x2013;19 April 2013</conf-date>
          <fpage>7</fpage>
          <lpage>12</lpage>
        </element-citation>
      </ref>
      <ref id="B66-futureinternet-13-00117">
        <label>66.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Marche</surname>
              <given-names>C.</given-names>
            </name>
            <name>
              <surname>Atzori</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Pilloni</surname>
              <given-names>V.</given-names>
            </name>
            <name>
              <surname>Nitti</surname>
              <given-names>M.</given-names>
            </name>
          </person-group>
          <article-title>How to exploit the Social Internet of Things: Query Generation Model and Device Profiles&#x2019; Dataset</article-title>
          <source>Comput. Netw.</source>
          <year>2020</year>
          <volume>174</volume>
          <fpage>107248</fpage>
          <pub-id pub-id-type="doi">10.1016/j.comnet.2020.107248</pub-id>
        </element-citation>
      </ref>
      <ref id="B67-futureinternet-13-00117">
        <label>67.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Mei</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Stefa</surname>
              <given-names>J.</given-names>
            </name>
          </person-group>
          <article-title>SWIM: A simple model to generate small mobile worlds</article-title>
          <source>Proceedings of the IEEE INFOCOM 2009</source>
          <conf-loc>Rio de Janeiro, Brazil</conf-loc>
          <conf-date>19&#x2013;25 April 2009</conf-date>
          <fpage>2106</fpage>
          <lpage>2113</lpage>
        </element-citation>
      </ref>
      <ref id="B68-futureinternet-13-00117">
        <label>68.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Kosta</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Mei</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Stefa</surname>
              <given-names>J.</given-names>
            </name>
          </person-group>
          <article-title>Small world in motion (SWIM): Modeling communities in ad-hoc mobile networking</article-title>
          <source>Proceedings of the 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)</source>
          <conf-loc>Boston, MA, USA</conf-loc>
          <conf-date>21&#x2013;25 June 2010</conf-date>
          <fpage>1</fpage>
          <lpage>9</lpage>
        </element-citation>
      </ref>
      <ref id="B69-futureinternet-13-00117">
        <label>69.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Adamic</surname>
              <given-names>L.A.</given-names>
            </name>
            <name>
              <surname>Lukose</surname>
              <given-names>R.M.</given-names>
            </name>
            <name>
              <surname>Puniyani</surname>
              <given-names>A.R.</given-names>
            </name>
            <name>
              <surname>Huberman</surname>
              <given-names>B.A.</given-names>
            </name>
          </person-group>
          <article-title>Search in power-law networks</article-title>
          <source>Phys. Rev. E</source>
          <year>2001</year>
          <volume>64</volume>
          <fpage>046135</fpage>
          <pub-id pub-id-type="doi">10.1103/PhysRevE.64.046135</pub-id>
        </element-citation>
      </ref>
      <ref id="B70-futureinternet-13-00117">
        <label>70.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Ali</surname>
              <given-names>I.</given-names>
            </name>
            <name>
              <surname>Sabir</surname>
              <given-names>S.</given-names>
            </name>
            <name>
              <surname>Ullah</surname>
              <given-names>Z.</given-names>
            </name>
          </person-group>
          <article-title>Internet of things security, device authentication and access control: A review</article-title>
          <source>arXiv</source>
          <year>2019</year>
          <pub-id pub-id-type="arxiv">1901.07309</pub-id>
        </element-citation>
      </ref>
      <ref id="B71-futureinternet-13-00117">
        <label>71.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Fouque</surname>
              <given-names>P.</given-names>
            </name>
            <name>
              <surname>Poupard</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Stern</surname>
              <given-names>J.</given-names>
            </name>
          </person-group>
          <article-title>Sharing decryption in the context of voting or lotteries</article-title>
          <source>Proceedings of the International Conference on Financial Cryptography (FC&#x2019;00)</source>
          <conf-loc>Anguilla, British West Indies</conf-loc>
          <conf-date>20&#x2013;24 February 2000</conf-date>
          <fpage>90</fpage>
          <lpage>104</lpage>
        </element-citation>
      </ref>
      <ref id="B72-futureinternet-13-00117">
        <label>72.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Cramer</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Gennaro</surname>
              <given-names>R.</given-names>
            </name>
            <name>
              <surname>Schoenmakers</surname>
              <given-names>B.</given-names>
            </name>
          </person-group>
          <article-title>A secure and optimally efficient multi-authority election scheme</article-title>
          <source>Eur. Trans. Telecommun.</source>
          <year>1997</year>
          <volume>8</volume>
          <fpage>481</fpage>
          <lpage>490</lpage>
          <pub-id pub-id-type="doi">10.1002/ett.4460080506</pub-id>
        </element-citation>
      </ref>
      <ref id="B73-futureinternet-13-00117">
        <label>73.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Perrig</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Stankovic</surname>
              <given-names>J.</given-names>
            </name>
            <name>
              <surname>Wagner</surname>
              <given-names>D.</given-names>
            </name>
          </person-group>
          <article-title>Security in wireless sensor networks</article-title>
          <source>Commun. ACM</source>
          <year>2004</year>
          <volume>47</volume>
          <fpage>53</fpage>
          <lpage>57</lpage>
          <pub-id pub-id-type="doi">10.1145/990680.990707</pub-id>
        </element-citation>
      </ref>
      <ref id="B74-futureinternet-13-00117">
        <label>74.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Mitrokotsa</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Rieback</surname>
              <given-names>M.R.</given-names>
            </name>
            <name>
              <surname>Tanenbaum</surname>
              <given-names>A.S.</given-names>
            </name>
          </person-group>
          <article-title>Classification of RFID attacks</article-title>
          <source>Gen</source>
          <year>2010</year>
          <volume>15693</volume>
          <fpage>14</fpage>
        </element-citation>
      </ref>
      <ref id="B75-futureinternet-13-00117">
        <label>75.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Liang</surname>
              <given-names>L.</given-names>
            </name>
            <name>
              <surname>Zheng</surname>
              <given-names>K.</given-names>
            </name>
            <name>
              <surname>Sheng</surname>
              <given-names>Q.</given-names>
            </name>
            <name>
              <surname>Huang</surname>
              <given-names>X.</given-names>
            </name>
          </person-group>
          <article-title>A denial of service attack method for an iot system</article-title>
          <source>Proceedings of the 2016 8th international conference on Information Technology in Medicine and Education (ITME)</source>
          <conf-loc>Fuzhou, China</conf-loc>
          <conf-date>23&#x2013;25 December 2016</conf-date>
          <fpage>360</fpage>
          <lpage>364</lpage>
        </element-citation>
      </ref>
      <ref id="B76-futureinternet-13-00117">
        <label>76.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Kolias</surname>
              <given-names>C.</given-names>
            </name>
            <name>
              <surname>Kambourakis</surname>
              <given-names>G.</given-names>
            </name>
            <name>
              <surname>Stavrou</surname>
              <given-names>A.</given-names>
            </name>
            <name>
              <surname>Voas</surname>
              <given-names>J.</given-names>
            </name>
          </person-group>
          <article-title>DDoS in the IoT: Mirai and other botnets</article-title>
          <source>Computer</source>
          <year>2017</year>
          <volume>50</volume>
          <fpage>80</fpage>
          <lpage>84</lpage>
          <pub-id pub-id-type="doi">10.1109/MC.2017.201</pub-id>
        </element-citation>
      </ref>
      <ref id="B77-futureinternet-13-00117">
        <label>77.</label>
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Bouabdellah</surname>
              <given-names>M.</given-names>
            </name>
            <name>
              <surname>Kaabouch</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Bouanani</surname>
              <given-names>F.E.</given-names>
            </name>
            <name>
              <surname>Ben-Azza</surname>
              <given-names>H.</given-names>
            </name>
          </person-group>
          <article-title>Network layer attacks and countermeasures in cognitive radio networks: A survey</article-title>
          <source>J. Inf. Secur. Appl.</source>
          <year>2018</year>
          <volume>38</volume>
          <fpage>40</fpage>
          <lpage>49</lpage>
          <pub-id pub-id-type="doi">10.1016/j.jisa.2017.11.010</pub-id>
        </element-citation>
      </ref>
      <ref id="B78-futureinternet-13-00117">
        <label>78.</label>
        <element-citation publication-type="book">
          <person-group person-group-type="author">
            <name>
              <surname>Chouhan</surname>
              <given-names>N.</given-names>
            </name>
            <name>
              <surname>Saini</surname>
              <given-names>H.</given-names>
            </name>
            <name>
              <surname>Jain</surname>
              <given-names>S.</given-names>
            </name>
          </person-group>
          <article-title>Internet of Things: Illuminating and Study of Protection and Justifying Potential Countermeasures</article-title>
          <source>Soft Computing and Signal Processing</source>
          <publisher-name>Springer</publisher-name>
          <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>
          <year>2019</year>
          <fpage>21</fpage>
          <lpage>27</lpage>
        </element-citation>
      </ref>
      <ref id="B79-futureinternet-13-00117">
        <label>79.</label>
        <element-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Yang</surname>
              <given-names>W.</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>Y.</given-names>
            </name>
            <name>
              <surname>Lai</surname>
              <given-names>Z.</given-names>
            </name>
            <name>
              <surname>Wan</surname>
              <given-names>Y.</given-names>
            </name>
            <name>
              <surname>Cheng</surname>
              <given-names>Z.</given-names>
            </name>
          </person-group>
          <article-title>Security Vulnerabilities and Countermeasures in the RPL-based Internet of Things</article-title>
          <source>Proceedings of the International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC&#x2019;18)</source>
          <conf-loc>Zhengzhou, China</conf-loc>
          <conf-date>18&#x2013;20 October 2018</conf-date>
          <fpage>49</fpage>
          <lpage>495</lpage>
        </element-citation>
      </ref>
    </ref-list>
    <sec sec-type="display-objects">
      <title>Figures and Tables</title>
      <fig id="futureinternet-13-00117-f001" position="float">
        <label>Figure 1</label>
        <caption>
          <p>A representation different nodes&#x2019; groups in H2O Network.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g001.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f002" position="float">
        <label>Figure 2</label>
        <caption>
          <p>A representation of H2O Network with entity operations.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g002.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f003" position="float">
        <label>Figure 3</label>
        <caption>
          <p>The steps of our approach for a human-to-human interaction.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g003.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f004" position="float">
        <label>Figure 4</label>
        <caption>
          <p>A network portion of H2O.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g004.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f005" position="float">
        <label>Figure 5</label>
        <caption>
          <p>The sequence diagram for a human-to-human communication.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g005.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f006" position="float">
        <label>Figure 6</label>
        <caption>
          <p>The maps of smart things of Santander used in our experiments.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g006.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f007" position="float">
        <label>Figure 7</label>
        <caption>
          <p>Different percentage of transaction between our solution and a naive approach.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g007.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f008" position="float">
        <label>Figure 8</label>
        <caption>
          <p>Nodes degree distribution in H2O network.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g008.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f009" position="float">
        <label>Figure 9</label>
        <caption>
          <p>The percentage of assessable nodes for different values of <italic>r</italic>.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g009.tif"/>
      </fig>
      <fig id="futureinternet-13-00117-f010" position="float">
        <label>Figure 10</label>
        <caption>
          <p>Number of prevented attacks against the number of hacked/corrupted nodes with different values of <italic>r</italic>.</p>
        </caption>
        <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-g010.tif"/>
      </fig>
      <table-wrap id="futureinternet-13-00117-t002" position="float">
        <object-id pub-id-type="pii">futureinternet-13-00117-t002_Table 2</object-id>
        <label>Table 2</label>
        <caption>
          <p>Notation used throughout this paper.</p>
        </caption>
        <table>
          <thead>
            <tr>
              <th align="left" valign="middle" style="border-bottom:solid thin;border-top:solid thin">Parameter</th>
              <th align="left" valign="middle" style="border-bottom:solid thin;border-top:solid thin">Meaning</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left" valign="middle">
                <italic>N</italic>
              </td>
              <td align="left" valign="middle">set of nodes of the network</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <italic>E</italic>
              </td>
              <td align="left" valign="middle">set of edges of the network</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm292" display="block">
                    <mml:semantics>
                      <mml:msub>
                        <mml:mi>n</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle"><italic>i</italic>th node of the network</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm293" display="block">
                    <mml:semantics>
                      <mml:mrow>
                        <mml:mo>&#x393;</mml:mo>
                        <mml:mo>(</mml:mo>
                        <mml:msub>
                          <mml:mi>n</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle">the neighbors of <inline-formula><mml:math id="mm294" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula></td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm295" display="block">
                    <mml:semantics>
                      <mml:msub>
                        <mml:mi>N</mml:mi>
                        <mml:mrow>
                          <mml:mi>P</mml:mi>
                          <mml:mi>A</mml:mi>
                          <mml:mi>N</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle">subset of nodes belonging to a Personal Area Network (<inline-formula><mml:math id="mm296" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula>)</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm297" display="block">
                    <mml:semantics>
                      <mml:msub>
                        <mml:mi>N</mml:mi>
                        <mml:mrow>
                          <mml:mi>P</mml:mi>
                          <mml:mi>U</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle">subset of public nodes of the network</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm298" display="block">
                    <mml:semantics>
                      <mml:msub>
                        <mml:mi>N</mml:mi>
                        <mml:mrow>
                          <mml:mi>P</mml:mi>
                          <mml:mi>P</mml:mi>
                          <mml:mi>A</mml:mi>
                          <mml:mi>N</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle">subset of nodes belonging to a <inline-formula><mml:math id="mm299" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> with high computational capabilities</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm300" display="block">
                    <mml:semantics>
                      <mml:msub>
                        <mml:mi>N</mml:mi>
                        <mml:mrow>
                          <mml:mi>L</mml:mi>
                          <mml:mi>P</mml:mi>
                          <mml:mi>A</mml:mi>
                          <mml:mi>N</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle">subset of nodes belonging to a <inline-formula><mml:math id="mm301" display="block"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> with low computational capabilities</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm302" display="block">
                    <mml:semantics>
                      <mml:msub>
                        <mml:mi>N</mml:mi>
                        <mml:mrow>
                          <mml:mi>P</mml:mi>
                          <mml:mi>P</mml:mi>
                          <mml:mi>U</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle">subset of public nodes with high computational capabilities</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm303" display="block">
                    <mml:semantics>
                      <mml:msub>
                        <mml:mi>N</mml:mi>
                        <mml:mrow>
                          <mml:mi>L</mml:mi>
                          <mml:mi>P</mml:mi>
                          <mml:mi>U</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle">subset of public nodes with low computational capabilities</td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <inline-formula>
                  <mml:math id="mm304" display="block">
                    <mml:semantics>
                      <mml:msub>
                        <mml:mi>P</mml:mi>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>n</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mo>,</mml:mo>
                          <mml:msub>
                            <mml:mi>n</mml:mi>
                            <mml:mi>j</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:msub>
                    </mml:semantics>
                  </mml:math>
                </inline-formula>
              </td>
              <td align="left" valign="middle">profile of object <inline-formula><mml:math id="mm305" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula> respect to object <inline-formula><mml:math id="mm306" display="block"><mml:semantics><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:semantics></mml:math></inline-formula></td>
            </tr>
            <tr>
              <td align="left" valign="middle">
                <italic>S</italic>
              </td>
              <td align="left" valign="middle">set of features</td>
            </tr>
            <tr>
              <td align="left" valign="middle" style="border-bottom:solid thin">
                <italic>r</italic>
              </td>
              <td align="left" valign="middle" style="border-bottom:solid thin">redundancy parameter</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <table-wrap id="futureinternet-13-00117-t003" position="float">
        <object-id pub-id-type="pii">futureinternet-13-00117-t003_Table 3</object-id>
        <label>Table 3</label>
        <caption>
          <p>Information about the dataset.</p>
        </caption>
        <table>
          <thead>
            <tr>
              <th align="left" valign="middle" style="border-bottom:solid thin;border-top:solid thin">Parameter</th>
              <th align="left" valign="middle" style="border-bottom:solid thin;border-top:solid thin">Value</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left" valign="middle">Total Number of objects</td>
              <td align="left" valign="middle">16,216</td>
            </tr>
            <tr>
              <td align="left" valign="middle">Number of private objects</td>
              <td align="left" valign="middle">14,600</td>
            </tr>
            <tr>
              <td align="left" valign="middle">Number of public objects</td>
              <td align="left" valign="middle">1616</td>
            </tr>
            <tr>
              <td align="left" valign="middle">Number of objects unique relation</td>
              <td align="left" valign="middle">550,939</td>
            </tr>
            <tr>
              <td align="left" valign="middle">Average objects degree</td>
              <td align="left" valign="middle">67.95</td>
            </tr>
            <tr>
              <td align="left" valign="middle">Number of persons</td>
              <td align="left" valign="middle">4000</td>
            </tr>
            <tr>
              <td align="left" valign="middle">Range of movements</td>
              <td align="left" valign="middle">2000 m</td>
            </tr>
            <tr>
              <td align="left" valign="middle">Simulation time</td>
              <td align="left" valign="middle">10 days</td>
            </tr>
            <tr>
              <td align="left" valign="middle" style="border-bottom:solid thin">Number of transactions</td>
              <td align="left" valign="middle" style="border-bottom:solid thin">1,101,878</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
    </sec>
    <bio>
      <title>Short Biography of Authors</title>
      <array>
        <tbody>
          <tr>
            <td align="left" valign="top">
              <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-i003.tif"/>
            </td>
            <td align="justify" valign="top"><bold>Marco Ferretti</bold> is a Full Professor at the University of Pavia. Marco Ferretti received the Laurea (cum laude) in Electronics Engineering from the University of Pavia (Italy) in 1979, where he is full professor since 1994. From 1984 to 1998 he was Chaiman of the IAPR TC for Special Purpose Architectures and from 2004 to 2008 he was President of GIRPR, the Italian branch of IAPR. He is Fellow of IAPR and member of IEEE. He published in excess of 150 articles in international peer reviewed journals and conference proceedings. He is inventor of 2 international patents in hardware for image compression. He is currently in the advisory board of CINECA that hosts the largest HPC facility in Italy and in the executive board of CINI, a consortium of some 50 universities active in ICT. His current research themes are in the exploitation of cloud resources for HPC and massive data analysis.</td>
          </tr>
          <tr>
            <td align="left" valign="top">
              <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-i004.tif"/>
            </td>
            <td align="justify" valign="top"><bold>Serena Nicolazzo</bold> got a PhD in Information Engineering at the University Mediterranea of Reggio Calabria in 2016. From 2016 to 2017 she was Research Fellow at the University Mediterranea of Reggio Calabria. Her research interests include: Data Science, Security, Privacy and Multi-Social Network Analysis. From 2019 she is Research Engineering Senior Engineer in the Architecture and KPI group of Sky Italia. She collaborates with the Innovation Group and she is responsible for the design of end-to-end architectures for Sky services. She is involved in several TPCs and editorial board of prestigious International Conferences and Journal in the context of Data Science and Cybersecurity. Currently, she is a Visiting Researcher at Middlesex University of London and she is collaborating with the Daisy Lab, Polytechnic University of Marche.</td>
          </tr>
          <tr>
            <td align="left" valign="top">
              <graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="futureinternet-13-00117-i005.tif"/>
            </td>
            <td align="justify" valign="top"><bold>Antonino Nocera</bold> is currently Assistant Professor at the University of Pavia from February 2019. He received his PhD in Information Engineering at the University Mediterranea of Reggio Calabria in March 2013. He actively collaborates with researchers of prestigious international research and academic institutions in different fields spanning over several research contexts, including: Security, Privacy, Social Network Analysis, Machine Learning, Recommender Systems, Internet of Things, Cloud Computing and Blockchain. In these research fields, he published about 70 scientific papers. He is involved in several TPCs of prestigious International Conferences in the context of Data Science and Cybersecurity and he is Associate Editor of Information Sciences (Elsevier).</td>
          </tr>
        </tbody>
      </array>
    </bio>
    <fn-group>
      <fn>
        <p><bold>Publisher&#x2019;s Note:</bold> MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.</p>
      </fn>
    </fn-group>
  </back>
</article>
