<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>On the feasibility of covert channels through Short-Message-Service</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sara Narteni</string-name>
          <email>sara.narteni@ieiit.cnr.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivan Vaccari</string-name>
          <email>ivan.vaccari@ieiit.cnr.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maurizio Mongelli</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maurizio Aiello</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Enrico Cambiaso</string-name>
          <email>enrico.cambiaso@ieiit.cnr.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Consiglio Nazionale delle Ricerche (CNR-IEIIT)</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Genoa</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Italy</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Short-Message-Service (SMS) is one of the most used ways to exchange text messages ofered by mobile networks. In this paper, we explore the feasibility of establishing a tunneling system based on SMS. Our proposed scheme allows a client (e.g. a web browser) to connect to the Internet by encapsulating HTTP/HTTPS requests/responses into SMS messages. Along with the development of the tunneling architecture and the attack modelling, we conducted some preliminary tests to evaluate the feasibility of the proposed tunneling system. Obtained results indicate that our system is able to handle up to 1200 bytes of web request data when using equal mobile operators, whereas 1248 bytes for diferent mobile operators.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;covert channel</kwd>
        <kwd>tunneling system</kwd>
        <kwd>short-message-service</kwd>
        <kwd>data exfiltration</kwd>
        <kwd>cyber-security</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        followed the last criterion to provide an overview of the existing covert channels. Protocols
of the network and transport layers (IP, TCP, ICMP) present header fields that can be misused
to convey secret data: this can be achieved by header bit modulation (e.g. unused header bits,
TCP ISN field, checksum field, address fields, etc.), header bit crafting (e.g. header extension,
padding, IP ID and Fragment Ofset) or optional header extension [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. An alternative is payload
tunneling [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], that is a covert channel where a forbidden protocol is encapsulated in the payload
of an allowed one, such as IP over ICMP, SSH over HTTP, UDP/TCP over HTTP. Moreover, it is
possible to employ headers of the application layer protocols, such as HTTP or DNS [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Covert
channels described above are known as covert storage channels (CSC). In contrast, covert timing
channels (CTC) are based on concealing information by modulating packet timing parameters.
Recent studies proposed covert channels in the field of mobile vocal calls belonging to CTC
category, exploiting VoLTE (VoIP over LTE) Protocol [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and VoIP [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Both works hide covert
data into silent periods of the voice signal. Along with the discovery of new covert channels,
researches on the development of new detection techniques have been carried out in recent
times [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>In recent years, we have assisted to a rapid growth of mobile technologies, so their security
is now a very important issue to take into account. It is often compromised: as an example, a
well-known phone company has recently declared that private and technical data have been
stolen from users’ SIM cards 1.</p>
      <p>Covert channels afecting mobile networks worth to be investigated; in particular, text
messages like SMSs can constitute a new opportunity to construct a covert channel, since they
are now widely available at relatively low cost.</p>
      <p>
        In this paper, we study the feasibility of a novel tunneling system based on CSC, in which
application data are carried inside Short-Message-Service (SMS) payload. Since people bring
their mobile phones everywhere today, as essential parts of their everyday activities, such
devices may become instruments for an attacker too. In fact, thinking about the insider threat
scenario [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], the insider (i.e. a member of an organization that wants to exfiltrate data to the
outside) could make misuse of mobiles to bypass his/her organization network by exploiting
the proposed SMS covert channel scheme, thus exposing the organization to serious damages.
      </p>
      <p>The remaining of the paper is structured as follows: Section 2 introduces SMS and their
functioning, while Section 3 describes the concept idea of the proposed innovative covert
channel. Instead, Section 4 reports some preliminary tests on the feasibility to establish
SMSbased tunnels. Section 5 reports the related works on the topic. Finally, Section 6 concludes the
paper and reports further work on the topic.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Short-Message-Service</title>
      <p>Short-Message-Service (SMS) is a service that allows the exchange of text messages between
mobile devices. A first implementation of SMS was carried by Global System for Mobile
Communications (GSM), the first standard developed for mobile telephony systems in the world.
SMS was implemented by GSM according to the European Telecommunication Stardard Institute
1More information is available at the following address: https://www.cybersecurity-help.cz/blog/1855.html
(ETSI) technical specifications, then it has been carried out in the scope of 3G Partnership Project
(3GPP) activities so that, by now, the service works in 3G and 4G networks too.</p>
      <p>A single SMS comprises a header, with useful information, and a payload, which is the text
content. The maximum size of a single SMS is 160 characters with 7-bit encoding.</p>
      <p>
        The flow of an SMS through the GSM network involves the following steps [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]:
1. An SMS is sent from the Mobile Station (MS), that is the mobile device equipped with
Subscriber Identity Module (SIM) card, to the Base Transceiver Station (BTS), which
receives and digitalizes the radio signals from MS.
2. BTS forwards the SMS to the Mobile Switching Centre (MSC), which has the
Equipment Identity Register (EIR) and Authentication Register (AUC) databases for equipment
verification and user authentication.
3. The message is then transmitted from MSC to SMSC, where it is stored in a queue until it
can’t be delivered. SMSC interrogates its databases (Home and Visitor Location Register
(HLR and VLR)) for the location information about the recipient’s MS.
4. By finding the location of the target MS, the message is sent from SMSC to the respective
      </p>
      <p>MSC and from here to the final recipient.</p>
      <p>
        There are two ways to submit a message on GSM network: Protocol Description Unit (PDU)
mode, that is in bits, and text format, i.e. the normal text. PDU format is more structured: the
message appears as a string of hexadecimal octets, grouped in diferent parts containing useful
information regarding the message and also details about the user. In PDU mode, SMS packets
are diferent depending on if the SMS is being sent or received: SMS_SUBMIT or SMS_DELIVER
formats are used respectively (see Section 3.3 of [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] for further details).
      </p>
      <sec id="sec-2-1">
        <title>2.1. AT Commands</title>
        <p>AT (ATtention) commands are a set of short text string commands used to control GSM phones
or modems. They can support many actions, including all the processes involved in
sending/receiving of SMSs. To understand the AT commands usage, in Table 1 we report a list of the
most common ones in the field of SMSs.</p>
        <p>Parameters can be added to the AT commands after an = sign to enable functionalities (e.g.
AT+CGMF=1 for SMS text mode). There are lots of AT commands, but manufacturers usually do
not implement all of them in the same way and with the same parameters. Hence, the use of AT
commands cannot be generalized for all kind of devices.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. The Proposed Covert Channel</title>
      <p>
        In network security context, the aim of a tunneling system is to carry a given communication
protocol into the payload of another one. Typically, such systems may be used to overcome
network limitations (i.e. firewalls) and potentially to leak private and sensitive data. Such
scenario can fit the insider threat problem [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <sec id="sec-3-1">
        <title>AT command</title>
        <p>AT
AT+CLIP
AT+CRC
AT+CMGF
AT+CNMI
AT+CMGL
AT+CMGD
AT+CMGW
AT+CMSS
AT+CMGS</p>
      </sec>
      <sec id="sec-3-2">
        <title>Description</title>
        <p>Returns OK when the communication between the device and the
application has been verified
Refers to the GSM/UMTS supplementary service CLIP (Calling Line
Identification Presentation)
Controls whether or not the extended format of incoming call indication
or GPRS network request for PDP context activation or notification for
VBS/VGCS calls is used
Message format (0 for PDU mode, 1 for Text mode)
New message indications to Terminal Equipment
Lists all text messages that are stored in memory
Deletes messages from memory
Writes SMSs to message storage area of SIM card
Sends SMSs from message storage area</p>
        <p>Sends SMSs directly to the recipient’s phone number</p>
        <p>Inspired by the rapid development of mobile technologies and the drastic cost reduction of
SMSs, we decided to investigate if it is possible to implement a tunneling system that exploits
the SMS protocol.</p>
        <p>Our SMS tunneling system can be described through the architecture shown in Figure 1.</p>
        <p>The proposed system is composed of four software modules: socks, tunnel client, tunnel
server, and tunnel proxy. In order to understand how the system works, the first two blocks
may be ideally coupled to form a socks server and, similarly, the other two blocks are referred
to as a unique tunnel receiver component. In our scenario, an attacker establishes a connection
over the tunnel by communicating with the socks server through a client (e.g. a web browser).
We assume that the socks server is located inside the targeted private network and used by the
malicious node to initiate the tunneling system. In contrast, the tunnel receiver component is
thought as an external node, which is under the control of the attacker too.</p>
        <p>Therefore, by exploiting such tunneling system, the client may be able to perform web
browsing activities.</p>
        <p>Suppose  →  and  →  being the request and response pathways respectively, involving
tunnel client  and tunnel server  modules. We now provide a more detailed description of the
single modules; in this context, our focus is on HTTP/HTTPS data, but the involved messages
can actually be of any kind:
• Socks server. In the  →  pathway, it receives the HTTP/HTTPS raw requests from
the client, splits their payload into -characters-sized parts and builds an SMS string for
each obtained portion. Such SMS is then sent to the tunnel receiver. In  → , it listens
for incoming connections from tunnel receiver and reconstructs the web response from
the received SMSs. Finally, such response reaches the client.
• Tunnel receiver. This component acts in a symmetric manner with respect to socks
server. It overtly communicates with a web server: while being in  →  phase, the
tunnel receiver reconstructs the original HTTP/HTTPS request from SMSs received by
the socks server; in  → , it receives a web response, then it generates SMSs in the
same way as socks server does for  →  and sends them to the socks server.</p>
        <p>Each SMS, both in  →  and  →  phases, is made up of a string containing five fields,
separated by a dash character (-), containing (i) the web server IP address (destination_ip
in the following), (ii) the web server listening port number (destination_port in the
following), (iii) the client port number, (iv) a message index (index in the following), and (v) the
payload (portion) to send. The first three fields represent a kind of header used to match
the connection between the client and the socks2. In addition, the tunnel proxy connects to
destination_ip:destination_port to get the information about the requested web page.</p>
        <p>The index is calculated in order to count how many fragments of the original request/response
are generated by splitting it into pieces of  characters. This information is needed to control
the correct order of SMSs after they travel along the tunnel.</p>
        <p>The content field encapsulates the request/response fragment. Before being sent through
the tunnel, it is encoded in base 64 in our design, in order to maintain the standard ASCII SMS
characters and prevent possible SMS reading issues. Once the SMS reaches its recipient, this
ifeld will then be decoded from base 64 for further processings.</p>
        <p>In order to handle the connection between the client and the socks server at the transport level,
so that the system acknowledges when the data exchange between them must be interrupted,
we introduced a particular SMS, which we call zero packet. Such SMS has the same header as
described above, while its index is fixed at 0. The content is put to 1 if the connection is
open, whereas it is 0 when closed. When the communication between client and socks server
ends, the closure zero packet is used to close it. Similarly, a zero packet with content=0 may
be sent to establish connections, although this may lead a connection closure, if the message
with index=1 is not received before the expiration of the server-side timeout waiting for data
after the three-way-handshake is completed.</p>
        <p>2Here, we assume a single client is present; in case of multiple clients, an additional field may be required,
specifying the IP address of the involved client.</p>
        <p>In order to better define the proposed attack and evaluate if it is possible to exploit it for
network communications, we will now model the attack behavior.</p>
        <sec id="sec-3-2-1">
          <title>3.1. Attack modelling</title>
          <p>In order to analyze if the proposed tunneling attack can be employed for a specific
communication, it is required to analyze the time delays introduced in the communication by the tunnel
architecture.</p>
          <p>In particular, referring to the scheme depicted in Figure 1, let’s suppose that a request message
 has to be sent from the client to the web server. Once  is received and interpreted by the
web server, the relative response message  is generated and sent back from the web server to
the client.</p>
          <p>Suppose | · | being the length of · , in bytes, and the addition symbol + the concatenation of
two strings, expressed in bytes. Let’s also define  as the maximum size (in bytes) of a single
SMS message. Given a message  to be sent through the tunnel by one endpoint to the other,
we can compute the number of required SMSs as follows:
 =
︂⌈ || ⌉︂

(1)
(2)
(3)
(4)
Similarly, for the  →  pathway, we define  as follows:</p>
          <p>= ∑︁ 
=1

 = ∑︁</p>
          <p>=1
where, for simplicity, we assume that no overhead is introduced on each message (for instance,
by headers, footers, or changes in data representation).</p>
          <p>Referring to the  →  pathway, we have:</p>
          <p>|| &gt;  =⇒  = 1 + . . . + 
where  &gt; 1 is the number of SMS messages required to send a message  , computed as in
Equation 1. Instead, for  = 1 , we have || ≤  .</p>
          <p>The expression of  in Equation 2 can then be simplified as:
with  being the number of SMSs needed to send , defined as in Equation 1.</p>
          <p>Now, in order to define if it is possible to exploit the proposed tunnel, it is required to analyze
the network requirements of the specific channel which has to be established. Such channel
depends both on the client and web server characteristics. For our scenario, such characteristics
are browser and server timeouts.</p>
          <p>In particular, considering a specific channel, let’s suppose that, through the proposed tunnel,
the number of sent SMSs per second is  .</p>
          <p>Notation

| · |</p>
          <p>Let’s suppose  be the timeout used by the client/browser and, similarly,  be the server
timeout. Let’s also define  the time required to send a message  from one endpoint to the
other one, through the proposed tunnel. Particularly, we define  in function of  , as follows:
(5)
(6)
(7)
(8)
 =


 &lt;</p>
          <p>In addition, for given  and , we define  the time required to the web server to process
the  request, in order to produce .</p>
          <p>Therefore, we expect a server side connection closure if the  timeout, related to the  → 
pathway, expires, according to the Equation 6.</p>
          <p>Also, we expect a client side connection closure if the  timeout, related to both the  → 
and  →  pathways, expires, according to the Equation 7.</p>
          <p>Finally, we state that the proposed tunnel is efective if Equation 8 is satisfied.</p>
          <p>&lt;  +  + 
 +  +  ≤  ∧  ≤</p>
          <p>For sake of clarity, in Table 2 we wrap up the notation adopted throughout our attack
description.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Tests and obtained results</title>
      <p>In order to perform an evaluation on the feasibility of the proposed attack, we conducted some
preliminary tests based on AT commands (Section 2.1), aimed at studying the behavior of SMSs
sent between the endpoints.</p>
      <p>For the implementation of our system, we used two Raspberry Pis, one as the socks server
and one as the tunnel receiver, each interfaced with a USB HSPA modem provided with a slot
for a SIM card.</p>
      <p>We performed a direct sending test, where SMSs were sent to the recipient without
intermediate steps, using the AT+CMGS command (Table 1).</p>
      <p>Let’s suppose ,  = [1, . . . , ] as the sequence of  diferent SMS messages that our
system is able to continuously send in a fixed time window  (expressed in seconds), being
 ≤  the number of messages which is possible to send in that time interval, with 
defined as in Equation 1. The goal of the preliminary tests we have accomplished is then to
compute  in two diferent test cases, involving (i) the same mobile operator (TIM Italian
mobile carrier) for both sender and receiver, and (ii) a diferent mobile operator between sender
(TIM Italian mobile carrier) and receiver (Iliad Italian mobile carrier). In both test cases, the
content of each message  was made up of a text string containing also a counter, which we
use to evaluate the SMSs sending, also in terms of reception order or losses.</p>
      <p>Such tests were conducted by fixing  = 60s as time window. Within such time window, we
found out the following results:
for the first scenario (same mobile operator), and
1 = 15
2 = 16
for the second scenario (diferent mobile operators).</p>
      <p>Referring to the attack model presented in Section 3.1, we exploited the obtained  values
to compute the total maximum size || of HTTP/HTTPS requests/responses payload we can
transfer over the tunnel, measured in bytes.</p>
      <p>First of all, we computed the frequency of SMS sending, expressed by  (i.e. how many SMSs
are sent per second), as follows:
 =  (11)

For our two scenarios we obtained  1 = 0.25 SMS/s (same operator) and  2 = 0.26 SMS/s
(diferent operators).</p>
      <p>
        Referring to Equation 8, we can assume, for simplicity,  = 0 s , hence an extremely reduced
server-side computation time. This may be reasonable, considered the greater impact of both
 and  . We can also assume  = 30 s, corresponding to a client-side timeout (e.g.
a browser timeout) of 30 seconds. Finally, we can assume  = 300 s, as it represents, for
instance, the default Apache2 timeout [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Particularly, as the web server may be under the
control of the attacker, the server timeout may also (mathematically) tend to infinite. Therefore,
we can consider only the first/left part of Equation 8, where, for simplicity in notation, we
define:
hence:
with  defined in Equation 5.
      </p>
      <p>=  + 
 ≤ 
(9)
(10)
(12)
(13)</p>
      <p>At this point, according to Equation 5, by fixing  =  = 30 s (as we do not want to
expire the client timeout), we get  =  ·  . The maximum payload length can be then
computed as || =  ·  ·  (Equation 1). By assuming, for simplicity, that the size of SMS
messages to be sent through the tunnel is the highest supported by the SMS protocol, we fix
 = 160 bytes/SMS (i.e., 160 characters with 7-bit encoding).</p>
      <p>Therefore, in our two test cases we get:
for the first scenario (same mobile operator), and
|1| =  ·  1 ·  = 1200 bytes
|2| =  ·  2 ·  = 1248 bytes
(14)
(15)
for the second scenario (diferent mobile operators). All payloads exceeding such sizes will
lead to a connection closure for the considered web scenario. Also, since the results show
|1| &lt; |2|, the exploitation of equal operators seems to slightly have a negative impact on the
tunnel performance. Other scenarios (like chats or SMTP data exchange) will be investigated in
the scope of further works on the topic.</p>
      <p>Moreover, by monitoring the SMS reception, we noticed that the order of the received SMSs
was not the same as the one in which the messages were sent: we expected such a behavior, in
fact our tunneling system embeds a reordering mechanism for the messages received from a
tunnel endpoint to another one.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Related Work</title>
      <p>In the era of mobile technologies outbreak, people are prone to make a massive use of their
mobile phones, they download lots of apps without being aware of the risks they may encounter.
For this reason, security of mobile devices is always more under threat.</p>
      <p>
        In recent years, a lot of work ([
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ],[16], [17], [18]) has been done to collect diferent
vulnerabilities, threats and attacks addressing mobile devices and their Operating Systems.
Between them, there are attacks versus the victim device itself (such as viruses, spyware, Trojan,
rootkit etc), while others steal information by eavesdropping the communication between
diferent devices (as for the case of Man-In-The-Middle attack) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. As regards the SMS context,
some attacks exploit SMSs for data leakage, e.g. Smishing (phishing via SMS) attack [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], that
consists in stealing information by sending trustworthy SMSs to the users.
      </p>
      <p>In another survey ([19]), SMS interception and manipulation attacks are presented, where
attackers act as SMSC and make use of fake MSC in order to get IMSI and address of the victim,
thus identifying it.</p>
      <p>SMSs are now a common method for two-factors authentication, even if they’re not so secure.
In [20], three methods to intercept SMSs are presented: GSM trafic capture; getting access to
Signalling System No. 7 (SS7) architecture and exploiting its protocols (like CAMEL) flaws; SIM
swapping, which consists in porting a user’s SIM card by fooling mobile operators, so that the
attacker receives all its data.</p>
      <p>
        Focusing on GSM network, a second generation standard for cellular networks that reached
90% of market share by 2017 [21], very few works explored the feasibility of creating covert
channels exploiting SMS protocols. The author in [22] demonstrated the possibility to embed
secret information inside SMS User Data Header redundant fields, in such a way that an
independent warden (recalling Simmons’s Prisoner Problem [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]) can interpret the SMS as
normal. Another work illustrated how to secretly convey data through SMS [23]: the aim of
such study was to develop a system able of transmitting SMS messages from an Android device
without the end user’s knowledge. Such a system design includes an Android application able
to covertly transmit SMSs and a network node able to receive them; in particular, OpenBTS and
SMSqueue softwares were used to establish a GSM network and manage SMS routing, acting
like a SMSC. In addition to the SMS-based approaches mentioned so far, it’s also possible to hide
information directly in text messages or other media: this method is known as steganography.
It can be achieved in many diferent ways: as an example, secret data may be hidden in text
manipulations (like abbreviations, blank spaces, synonyms and acronyms [24]) or into the
widely used emoticons [25]. However, steganographic methods are a sub-category of covert
channels, being based on modifications of the contents of the data being transmitted. Moreover,
all the SMS-based data exfiltration techniques mentioned so far are diferent from tunneling
systems, since they do not involve network protocols.
      </p>
      <p>The idea of an SMS tunneling was investigated in [26] too, where a so-called WebSIM was
developed, i.e. a SIM card acting as a web server for personal security. In this context, IP packets
were embedded into SMSs in order to reach the WebSIM and provide connectivity. In contrast,
in our system we use SMSs just as carriers for bringing connection outside. Another work [27]
developed a query/retrieve system, called iTrust with SMS, which allows users to search/get
information cointained in iTrust with HTTP network nodes[28] via SMS. The requests are made
through text keywords and then this framework is able to convert them to GET HTTP requests.
Such a system has limited application because of the limitation in SMS size (140 bytes) and it
cannot fit into a covert channel definition.</p>
      <p>To the best of our knowledge, no studies investigated the feasibility of a SMS tunneling,
intended as a way to exchange forbidden information between two nodes via SMS.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions and Further Work</title>
      <p>In this paper we have theorized an innovative tunneling attack based on the exchange of SMS
messages. Such a system may represent a potentially dangerous threat, as the stealing of
private and sensitive data could lead to serious problems in critical contexts like health, finance
or industry. In addition, using a third-party network, potentially uncontrolled, may hinder
detection and mitigation of the proposed threat. Despite many malicious tunneling applications
already exist and are well-established, involving the most common network protocols (DNS,
ICMP, SSH, etc), our proposed scheme allows to exploit a protocol in the field of mobile networks.
In our concept, this feature represents a great advantage, in virtue of the huge development of
mobile devices and the fact that the sending of SMSs has become cheaper in recent years.</p>
      <p>Nevertheless, in this paper we have presented a preliminary investigation on the feasibility of
the SMS tunneling. Due to the limited size of SMS messages, we expect performance limitations
of the tunnel: however, the obtained preliminary results indicate a promising starting point
for further investigations. Namely, future works will be addressed to a deeper testing of the
system, aimed to the individuation of the SMS tunneling capabilities and weaknesses.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledge</title>
      <p>This work was supported by the following research project: the Integrated Framework for
Predictive and Collaborative Security of Financial Infrastructures (FINSEC) project, which has
received funding from the European Union’s Horizon 2020 Research and Innovation Programme
under Grant Agreement No. 786727.
vulnerabilities and their defensive mechanism, International Journal of Computer
Applications 56 (2012) 24–29. doi:10.5120/8960-3163.
[16] M. La Polla, F. Martinelli, D. Sgandurra, A survey on security for mobile devices,
Communications Surveys &amp; Tutorials, IEEE 15 (2013) 446–471. doi:10.1109/SURV.2012.013012.
00028.
[17] B. Rashidi, C. Fung, A survey of android security threats and defenses, Journal of Wireless
Mobile Networks, Ubiquitous Computing, and Dependable Applications (JoWUA) 6 (2015)
3–35.
[18] S. Farhan, S. F. Zaidi, A. Munam, M. Shah, M. Kamran, Q. Javaid, S. Zhang, A survey on
security for smartphone device, International Journal of Advanced Computer Science and
Applications 7 (2016) 206–219. doi:10.14569/IJACSA.2016.070426.
[19] K. Ullah, I. Rashid, H. Afzal, M. M. W. Iqbal, Y. A. Bangash, H. Abbas, Ss7 vulnerabilities—a
survey and implementation of machine learning vs rule based filtering for detection
of ss7 network attacks, IEEE Communications Surveys Tutorials 22 (2020) 1337–1371.
doi:10.1109/COMST.2020.2971757.
[20] R. P. Jover, Security analysis of sms as a second factor of authentication, Commun. ACM
63 (2020) 46–52. URL: https://doi.org/10.1145/3424260. doi:10.1145/3424260.
[21] F. Hillebrand, The creation of standards for global mobile communication: Gsm and umts
standardization from 1982 to 2000, IEEE Wireless Communications 20 (2013) 24–33.
[22] M. Z. Rafique, K. Khan, K. Alghatbar, M. Farooq, Embedding high capacity covert channels
in short message service (sms), in: Communications in Computer and Information Science,
volume 186, 2011, pp. 1–10.
[23] K. G. Kangas, Clandestine transmissions and operations of embedded software on cellular
mobile devices, 2011.
[24] W. Mazurczyk, L. Caviglione, Steganography in modern smartphones and mitigation
techniques, IEEE Communications Surveys &amp; Tutorials 17 (2015) 334–357.
[25] S. Patiburn, V. Iranmanesh, P. Teh, Text steganography using daily emotions monitoring,</p>
      <p>International Journal of Education and Management Engineering 7 (2017) 1–14.
[26] S. Guthery, J. Posegga, M.-m. Deutsche, The websim - clever smartcards listen to port 80,
2000.
[27] I. Lombera, L. Moser, P. Melliar-Smith, Y.-T. Chuang, Mobile decentralized search and
retrieval using sms and http, Mobile Networks and Applications 18 (2013). doi:10.1007/
s11036-012-0412-0.
[28] Y.-T. Chuang, M. Isaí, L. Lombera, P. Moser, Melliar-Smith, Trustworthy distributed search
and retrieval over the internet, 2012.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>W.</given-names>
            <surname>Mazurczyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Szary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wendzel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Caviglione</surname>
          </string-name>
          ,
          <article-title>Towards reversible storage network covert channels</article-title>
          ,
          <source>in: Proceedings of the 14th International Conference on Availability, Reliability and Security</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B. W.</given-names>
            <surname>Lampson</surname>
          </string-name>
          ,
          <article-title>A note on the confinement problem</article-title>
          ,
          <source>Commun. ACM</source>
          <volume>16</volume>
          (
          <year>1973</year>
          )
          <fpage>613</fpage>
          -
          <lpage>615</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Simmons</surname>
          </string-name>
          ,
          <article-title>The prisoners' problem and the subliminal channel</article-title>
          ,
          <source>in: CRYPTO</source>
          ,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zander</surname>
          </string-name>
          ,
          <article-title>Detecting covert channels in fps online games</article-title>
          ,
          <source>in: 2017 IEEE 42nd Conference on Local Computer Networks (LCN)</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>555</fpage>
          -
          <lpage>558</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T. G.</given-names>
            <surname>Handel</surname>
          </string-name>
          , M. T. Sandford,
          <article-title>Hiding data in the osi network model</article-title>
          ,
          <source>in: Information Hiding</source>
          , Springer Berlin Heidelberg,
          <year>1996</year>
          , pp.
          <fpage>23</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zander</surname>
          </string-name>
          , G. Armitage,
          <string-name>
            <given-names>P.</given-names>
            <surname>Branch</surname>
          </string-name>
          ,
          <article-title>A survey of covert channels and countermeasures in computer network protocols</article-title>
          ,
          <source>IEEE Communications Surveys &amp; Tutorials</source>
          <volume>9</volume>
          (
          <year>2007</year>
          )
          <fpage>44</fpage>
          -
          <lpage>57</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Heda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <article-title>Covert channel design and detection techniques : a survey</article-title>
          ,
          <source>in: 2015 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>A covert channel over volte via adjusting silence periods</article-title>
          ,
          <source>IEEE Access 6</source>
          (
          <year>2018</year>
          )
          <fpage>9292</fpage>
          -
          <lpage>9302</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Schmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Mazurczyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kulesza</surname>
          </string-name>
          , J. Keller, L. Caviglione,
          <article-title>Exploiting ip telephony with silence suppression for hidden data transfers</article-title>
          ,
          <source>Computers and Security</source>
          <volume>79</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L.</given-names>
            <surname>Caviglione</surname>
          </string-name>
          ,
          <article-title>Trends and challenges in network covert channels countermeasures</article-title>
          ,
          <source>Applied Sciences</source>
          <volume>11</volume>
          (
          <year>2021</year>
          ). doi:
          <volume>10</volume>
          .3390/app11041641.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>I.</given-names>
            <surname>Homoliak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Tofalini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Guarnizo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Elovici</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ochoa</surname>
          </string-name>
          ,
          <article-title>Insight into insiders and it: A survey of insider threat taxonomies, analysis, modeling, and countermeasures</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>52</volume>
          (
          <year>2019</year>
          ). URL: https://doi.org/10.1145/3303771. doi:
          <volume>10</volume>
          .1145/3303771.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Chaudari</surname>
          </string-name>
          ,
          <source>Security analysis of sms and related technologies, 30 Nov</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>E.</given-names>
            <surname>Cambiaso</surname>
          </string-name>
          , G. Papaleo, G. Chiola,
          <string-name>
            <given-names>M.</given-names>
            <surname>Aiello</surname>
          </string-name>
          ,
          <article-title>Designing and modeling the slow next dos attack</article-title>
          ,
          <source>in: Computational Intelligence in Security for Information Systems Conference</source>
          , Springer,
          <year>2015</year>
          , pp.
          <fpage>249</fpage>
          -
          <lpage>259</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Taleby Ahvanooey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rabbani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rajput</surname>
          </string-name>
          ,
          <article-title>A survey on smartphones security: Software vulnerabilities, malware, and attacks</article-title>
          ,
          <source>International Journal of Advanced Computer Science and Applications</source>
          <volume>8</volume>
          (
          <year>2017</year>
          )
          <fpage>30</fpage>
          -.
          <source>doi:10</source>
          .14569/IJACSA.
          <year>2017</year>
          .
          <volume>081005</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Muthuswamy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ganapathi</surname>
          </string-name>
          ,
          <article-title>Mobile device security: A survey on mobile device threats,</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>