Processing math: 100%
Survey Special Issues

A survey of methods for encrypted network traffic fingerprinting

  • Privacy protection in computer communication is gaining attention because plaintext transmission without encryption can be eavesdropped on and intercepted. Accordingly, the use of encrypted communication protocols is on the rise, along with the number of cyberattacks exploiting them. Decryption is essential for preventing attacks, but it risks privacy infringement and incurs additional costs. Network fingerprinting techniques are among the best alternatives, but existing techniques are based on information from the TCP/IP stack. They are expected to be less effective because cloud-based and software-defined networks have ambiguous boundaries, and network configurations not dependent on existing IP address schemes increase. Herein, we investigate and analyze the Transport Layer Security (TLS) fingerprinting technique, a technology that can analyze and classify encrypted traffic without decryption while addressing the problems of existing network fingerprinting techniques. Background knowledge and analysis information for each TLS fingerprinting technique is presented herein. We discuss the pros and cons of two groups of techniques, fingerprint collection and artificial intelligence (AI)-based. Regarding fingerprint collection techniques, separate discussions on handshake messages ClientHello/ServerHello, statistics of handshake state transitions, and client responses are provided. For AI-based techniques, discussions on statistical, time series, and graph techniques according to feature engineering are presented. In addition, we discuss hybrid and miscellaneous techniques that combine fingerprint collection with AI techniques. Based on these discussions, we identify the need for a step-by-step analysis and control study of cryptographic traffic to effectively use each technique and present a blueprint.

    Citation: Sunghyun Yu, Yoojae Won. A survey of methods for encrypted network traffic fingerprinting[J]. Mathematical Biosciences and Engineering, 2023, 20(2): 2183-2202. doi: 10.3934/mbe.2023101

    Related Papers:

    [1] María Sancho, José Miguel Arnal, Gumersindo Verdú-Martín, Cristina Trull-Hernandis, Beatriz García-Fayos . Management of hospital radioactive liquid waste: treatment proposal for radioimmunoassay wastes. AIMS Environmental Science, 2021, 8(5): 449-464. doi: 10.3934/environsci.2021029
    [2] María Sancho . Radioactive waste management and disposal – introduction to the special issue. AIMS Environmental Science, 2023, 10(1): 125-128. doi: 10.3934/environsci.2023007
    [3] Francesca Giacobbo, Mirko Da Ros, Elena Macerata, Eros Mossini . A case study of management and disposal of TENORMs: radiological risk estimation by TSD Dose and RESRAD-ONSITE. AIMS Environmental Science, 2021, 8(5): 465-480. doi: 10.3934/environsci.2021030
    [4] Yifeng Wang, Carlos F. Jove-Colon, Robert J. Finch . On the Durability of Nuclear Waste Forms from the Perspective of Long-Term Geologic Repository Performance. AIMS Environmental Science, 2014, 1(1): 26-35. doi: 10.3934/environsci.2013.1.26
    [5] Lemuel Clark Velasco, Mary Jane Burden, Marie Joy Satiniaman, Rachelle Bea Uy, Luchin Valrian Pueblos, Reynald Gimena . Preliminary assessment of solid waste in Philippine Fabrication Laboratories. AIMS Environmental Science, 2021, 8(3): 255-267. doi: 10.3934/environsci.2021017
    [6] Joseph Muiruri, Raphael Wahome, Kiemo Karatu . Assessment of methods practiced in the disposal of solid waste in Eastleigh Nairobi County, Kenya. AIMS Environmental Science, 2020, 7(5): 434-448. doi: 10.3934/environsci.2020028
    [7] Siti Rachmawati, Syafrudin, Budiyono, Ellyna Chairani, Iwan Suryadi . Life cycle analysis and environmental cost-benefit assessment of utilizing hospital medical waste into heavy metal safe paving blocks. AIMS Environmental Science, 2024, 11(5): 665-681. doi: 10.3934/environsci.2024033
    [8] Sayali Sandbhor, Sayali Apte, Vaishnavi Dabir, Ketan Kotecha, Rajkumar Balasubramaniyan, Tanupriya Choudhury . AI-based carbon emission forecast and mitigation framework using recycled concrete aggregates: A sustainable approach for the construction industry. AIMS Environmental Science, 2023, 10(6): 894-910. doi: 10.3934/environsci.2023048
    [9] Jan Zloch, Dana Adamcová, Ondřej Šindelář, Markéta Šourková, Magdalena Daria Vaverková . Testing of phytotoxicity of mining waste to determine the direction of future development. AIMS Environmental Science, 2020, 7(4): 324-334. doi: 10.3934/environsci.2020021
    [10] Awe Richard, Koyang François, Bineng Guillaume Samuel, Ndimantchi Ayoba, Takoukam Soh Serge Didier, Saïdou . Contribution of 40K arising from agropastoral activities to the total effective dose by plant ingestion in the Far-North, Cameroon. AIMS Environmental Science, 2022, 9(4): 444-460. doi: 10.3934/environsci.2022027
  • Privacy protection in computer communication is gaining attention because plaintext transmission without encryption can be eavesdropped on and intercepted. Accordingly, the use of encrypted communication protocols is on the rise, along with the number of cyberattacks exploiting them. Decryption is essential for preventing attacks, but it risks privacy infringement and incurs additional costs. Network fingerprinting techniques are among the best alternatives, but existing techniques are based on information from the TCP/IP stack. They are expected to be less effective because cloud-based and software-defined networks have ambiguous boundaries, and network configurations not dependent on existing IP address schemes increase. Herein, we investigate and analyze the Transport Layer Security (TLS) fingerprinting technique, a technology that can analyze and classify encrypted traffic without decryption while addressing the problems of existing network fingerprinting techniques. Background knowledge and analysis information for each TLS fingerprinting technique is presented herein. We discuss the pros and cons of two groups of techniques, fingerprint collection and artificial intelligence (AI)-based. Regarding fingerprint collection techniques, separate discussions on handshake messages ClientHello/ServerHello, statistics of handshake state transitions, and client responses are provided. For AI-based techniques, discussions on statistical, time series, and graph techniques according to feature engineering are presented. In addition, we discuss hybrid and miscellaneous techniques that combine fingerprint collection with AI techniques. Based on these discussions, we identify the need for a step-by-step analysis and control study of cryptographic traffic to effectively use each technique and present a blueprint.



    The concept of memristor was proposed by Chua [1,2]. The characteristic of memristive systems is shown in Figure 1. Until more than 30 years later, Hewlett Packard laboratory [3,4] announced the realization of the physical devices of the memristor. The theory and application of memristor have attracted the attention of scholars again. Memristor has the advantages of smaller size, lower energy consumption, and larger information storage capacity. Memristor is Therefore, memristor is the best choice to construct the next generation neural network instead of resistor and improve the efficiency of intelligent algorithm in machine learning [5,6,7]. Therefore, memristor-based neural networks can be constructed (see Figure 2). In Figure 2, M1i1,...,M1in and M2i1,...,M2in are memristor, other parameters are same as traditional neural networks with resistor [8]. Shi and Cao et al. [9] first investigated exponential stability of complex-valued memristive neural networks. In [10], Yang and Ho analyzed the robustness of the memristive neural network. In [11], a more general situation of mixed delays is discussed. Mehrabbeik [12] et al. investigate synchronization of the m-Rulkov model. In addition, memristive neural networks with time delay [13,14], time-varying delay [15,16], mixed delays [17,18] and switching jumps mismatch [8,19] are discussed.

    Figure 1.  The state trajectories of current and voltage characteristics of the memoristor.
    Figure 2.  Circuit of the i-th memristive neural networks.

    Fractional calculus which was proposed in 1695, appears almost at the same time as classical calculus. In later research, scholars found that some models can not be well described by using classical integral calculus. On the contrary, fractional calculus can well describe those models. In recent years, the theory of fractional calculus has been successfully applied to various fields. There are more and more works on fractional order dynamical systems. Wang and Yang [23] first discussed the quasi-synchronization problem of fractional-order systems with different structures. In [24], Bifurcations of fractional complex-valued neural networks with delays is investigated. The synchronization of fractional order systems with discontinuous activation functions is studied in [25]. In addition, the fractional order system is also analyzed from the mathematical point of view [20,21,22].

    Synchronization is one of the most common collective behaviors of dynamical systems [26,27]. Synchronization usually refers to the phenomenon of phase consistency among dynamical systems. Synchronization not only exists widely in nature, but it is also very important in practical applications. There are a lot of results about synchronization. In these published results, some control strategies are used to achieve synchronization, such as predictive control [28], adaptive control [29], iterative learning control [30], fuzzy control [31], sliding-mode control [32], event-triggered control [33,34,35], sampled-date control [36], impulsive control [37,38,39,40], intermittent control [41,42,43] and so on. Among those control strategies, intermittent control strategy is the most representative one, and also the one most in line with actual needs. So, intermittent control attracts more and more attention. The intermittent strategy can be divided into periodically intermittent and aperiodically intermittent. Synchronization of integer order systems via periodically intermittent control or aperiodically intermittent control has been widely studied [41,42,43]. Synchronization of fractional order systems via periodically intermittent strategy has been investigated in [41,42]. However, as far as we know, there are no literatures on fractional order dynamical systems via aperiodically intermittent strategy.

    Inspired by the idea of aperiodically intermittent strategy of integer order, aperiodically intermittent strategy is extended to fractional order systems. In the works of integer-order dynamical behavior, both periodically intermittent control and aperiodically intermittent control are widely studied. Among those works, The advantages of aperiodically intermittent control are proven. In addition, unlike periodically intermittent control with fixed width control interval and non-control interval, aperiodically control has fewer interval constraints(see Figure 3), which makes aperiodically intermittent control more flexible and more in line with application requirements. This paper investigates synchronization of fractional order memeristive neural networks via aperiodically intermittent control. Firstly, according to the characteristics of memristive neural networks, dynamical systems with differential inclusion is obtained. Then, in the sense of Filipov's solution, systems with differential inclusion are transformed into conventional forms that can be processed. Finally, based on the periodically intermittent control theory, sufficient conditions of synchronization of memeristive neural networks via aperiodically intermittent control are derived. The structure of this paper is organized as follows: In Section 2, some useful definitions, basic assumptions and lemmas are recalled. In Section 3, based on the theory of fractional order periodically control, sufficient conditions for synchronization are derived by constructing appropriate Lyapunov functional. In addition, Some comparisons with existing results are given verify advantages of the derived conditions. In Section 4, a numerical example is given to demonstrate the derived conditions. Conclusions are given in Section 5.

    Figure 3.  Aperiodically intermittent control.

    Notations. This paper is a conducted in the sense of Filippov's. Rm×n denote the m×n real-valued matrix set. co{x,y} represents convex hull of x and y. λmax() denotes the max eigenvalue of a matrix. T denotes the matrix transposition. Inf() and Sup() denote the upper bound and lower bound. |||| denotes the norm of a matrix vector.

    The Captuto calculus is the most common of many types of calculus. The properties of some integer-order differentials can be applied directly, which is one of the reasons for the wide application of Caputo calculus. In this article, Captuto calculus is used for analysis.

    Definition 1. [23] For any integrable function f(t)C, the fractional integral of order α of function f(t) is defined as

    Iαf(t)=1Γ(α)tt0(ts)α1f(s)ds,

    where α>0, and Γ() is Gamma function.

    Definition 2. [23] For any function f(t), Caputo's derivative of order α is defined by

    Dαf(t)=1Γ(nα)tt0(ts)nα1fn(s)ds,

    where n is a positive number and n1<α<n. Particularly, when n=1,

    Dαf(t)=1Γ(1α)tt0f(s)(ts)αds.

    Fractional-order memristive neural networks of Caputo's derivative are defined by

    Dαx(t)=Cx(t)+A(x(t))f(x(t))+I(t), (2.1)

    where α is the order of Captuto's derivative, x(t)=(x1(t),x2(t),,xn(t))TCn, xi(t) is the complex-valued state variable. C=diag{ci}n×nRn×n is the ith self-feedback connection weight with ci>0(i=1,2,...,n). A(x(t))=aij(xij(t))n×n are connection weights f(x(t))=(f1(x1(t)),f2(x2(t)),...,fn(xn(t)))T are activation function. I(t)=(I1(t),I2(t),...,In(t))TCn are external input.

    Similarly, the slave-systems are denoted as follows:

    Dαy(t)=Cy(t)+A(y(t))f(y(t))+I(t)+u(t), (2.2)

    where u(t)=(u1(t),u2(t),...,un(t))T are controller.

    For the convenience of discussion, Figure 4 is used for discussion. Figure 4 is a simplified model of Figure 1. In this case, the connection weight aij(xj(t)) of (2.1) are defined as follows [15]

    aij(vj(s))={a,|vj(s)|T,a,|vj(s)|>T,
    Figure 4.  Two-state current-voltage characteristics of memristor.

    where T is the switching threshold value with master-systems (2.1) and slave-systems (2.2). a and a denote two states of aij(vj(t)).

    Lemma 1. [42] If x():[t0,)R is a continuous differential function and

    Dαx(t)ax(t),tt0,

    where a and b are positive constants, then

    x(t)(x(t0)ba)Eα(a(tt0)α),tt00,

    where Eα(a(ttα0)) is one-parameter Mittag-Leffler function which is defined by

    Eα(z)=Eα,1(z)=k=0zkΓ(α+1).

    Lemma 2. [41] For x() and y() are two continuous differential functions, if α,β>0, then

    DαDβx(t)=Dαβx(t),
    Dα(x(t)±y(t))=Dαx(t)±Dαy(t).

    Lemma 3. [25] Let f(t)=(f1(t),f2(t),...,fn(t))T is a n-dimensional vector differentiable function, for any positive definite symmetric matrix QRn×n. The following inequalities can be derived

    Dα(fT(s)Qf(s))2fT(s)QDαf(s),

    where α[0,1],0s.

    Assumption 1. [24] For the aperiodically intermittent strategy, the control interval and non-control interval satisfy the following equations

    {Infk(sktk)=h,Supk(tk+1tk)=H,

    where h and H are two positive scalars and satisfy 0<h<H<+.

    Based on the Assumption 1, (2.1) can be rewritten as the following differential inclusion:

    Dαx(t)Cx(t)+co[A(x(t))]f(x(t))+I(t),Dαy(t)Cy(t)+co[A(y(t))]f(y(t))+I(t). (2.3)

    Under the Assumption 1, define ej(t)=yj(t)xj(t) for j=1,2,...,n. So, error systems can be obtained:

    Dαe(t)C(y(t)x(t))+co[A(y(t))]f(y(t))co[A(x(t))]f(x(t))+u(t), (2.4)
    u(t)={K(y(t)x(t)),tkt<sk,0,skt<tk+1, (2.5)

    where K are gain coefficients.

    Lemma 4. [42] For any activation functions f(±T)=0, then one can derive that

    co[aij(y(t))]fj(yj(t))co[aij(xj(t))]fj(xj(t))aijlj|yj(t)xj(t)|,

    where lj is the Lipschitz condition and aij is the maximum of a and a.

    In this section, the synchronization problems of fractional order memristor-based neural netwroks via aperiodically intermittent control strategy would be investigated. Sufficient conditions will be derived.

    Theorem 1. Under the Lemmas 1–4, and Assumption 1, fractional-order master-system (2.1) and slave-systems (2.2) can achieve synchronization under controller (2.5), if

    ||C||+||A||||L||<||K||,
    Eα(γ1hα)Eα(γ2(Hh)α)<1,

    where, γ1=||C||+||A||||L||||K|| and γ2=||C||+||A||||L|| are two positive scalers.

    Proof. Constructing the following Lyapunov functional

    V(t)=12eT(t)e(t).

    For, tkt<sk, deriving derivative of V(t) along along with (2.3), one can get

    DαV(t)eT(t)Dαe(t).

    Combining the error systems (2.4) and Lemma 3,

    DαV(t)eT(t)(Ce(t)+A(y(t))f(y(t))A(x(t))f(x(t))+u(t))eT(t)(Ce(t)+(A(y(t))f(y(t))A(x(t))f(x(t)))Ke(t)))C||e(t)||2+||eT(t)||||(A(y(t))f(y(t))A(x(t))f(x(t)))||||K||||e(t)||2C||e(t)||2+||A||||L||||e(t)||2||K||||e(t)||2=(||C||+||A||||L||||K||)||e(t)||2.

    According to the Theorem conditions, γ1=||C||+||A||||L||||K||<0, so

    Dαγ1V(t).

    Based on the Lemma 4, the following equalities can be derived

    V(t)V(tk)Eα(γ1(tttk)α).

    Similarly, For, skt<tk+1 Deriving derivative of V(t) along along with (2.4), one can get

    DαV(t)eT(t)Dαe(t).

    Combining the error system (2.4) and Lemma 3,

    DαV(t)eT(t)(Ce(t)+A(y(t))f(y(t))A(x(t))f(x(t)))eT(t)(Ce(t)+(A(y(t))f(y(t))A(x(t))f(x(t)))))C||e(t)||2+||eT(t)||||(A(y(t))f(y(t))A(x(t))f(x(t)))||C||e(t)||2+||A||||L||||e(t)||2=(||C||+||A||||L||)||e(t)||2.

    According to the Theorem conditions, γ2=C+Al>0, so

    Dαγ2V(t).

    Based on the Lemma 4, the following equalities can be derived

    V(t)V(sk)Eα(γ2(tsk)α).

    According to the principle of mathematical induction, combining the control period sktk and non-control period tk+1sk, when k=0, one can get that:

    For 0=t0t<s0, based on the Lemma 2, one can get

    V(t)V(t0)Eα(γ1(tt0)α)=V(0)Eα(γ1tα), (3.1)

    so, one can derive

    V(s0)V(t0)Eα(γ1(s0t0)α). (3.2)

    For s0t<t1,

    V(t)V(s0)Eα(γ2(ts0)α), (3.3)

    so, one can derive

    V(t1)V(t0)Eα(γ1(s0t0)α)Eα(γ2(t1s0)α). (3.4)

    For t1t<s1,

    V(t)V(t1)Eα(γ1(tt1)α), (3.5)

    so, one can derive

    V(s1)V(t0)Eα(γ1(s0t0)α)Eα(γ2(t1s0)α)Eα(γ1(s1t1)α). (3.6)

    For s1t<t2,

    V(t)V(s1)Eα(γs(ts1)α), (3.7)

    so, one can derive

    V(t2)V(t0)Eα(γ1(s0t0)α)Eα(γ2(t1s0)α)Eα(γ1(s1t1)α)Eα(γs(t2s1)α). (3.8)

    For t2t<s2

    V(t)V(t2)Eα(γ1(tt2)α), (3.9)

    so, one can derive

    V(s2)V(t0)Eα(γ1(s0t0)α)Eα(γ2(t1s0)α)Eα(γ1(s1t1)α)Eα(γ1(t2s1)α)Eα(γ1(s2t2)α). (3.10)

    For s2t<t3,

    V(t)V(s2)Eα(γ1(ts2)α), (3.11)

    so, one can derive that

    V(t3)V(t0)Eα(γ1(s0t0)α)Eα(γ2(t1s0)α)Eα(γ1(s1t1)α)Eα(γs(t2s1)α)Eα(γ1(s2t2)α)Eα(γ1(ts2)α). (3.12)

    According to the principle of mathematical analogy, when k=m, one can assume

    For tmt<sm,

    V(t)V(t0)m1k=1(Eα(γ1(sktk)α)Eα(tk+1sk))Eα(γ1(ttm)α), (3.13)

    so, one can derive that

    V(sm)V(t0)m1k=1(Eα(γ1(sktk)α)Eα(γ2(tk+1sk)α))Eα(γ1(smtm)α). (3.14)

    For, smt<tm+1,

    V(t)V(s0)m1k=1(Eα(γ1(sktk)α)Eα(γ2(tk+1sk)α))Eα(γ1(smtm)α)Eα(γ2(tsm)), (3.15)

    so, one can get that

    V(tm+1)V(s0)m1k=1(Eα(γ1(sktk)α)Eα(γ2(tk+1sk)α))Eα(γ1(smtm)α)Eα(γ2(tm+1sm))=V(t0)mk=1(Eα(γ1(sktk)α)Eα(γ2(tk+1sk)α)). (3.16)

    Suppose the Eqs (3.13)–(3.16) are hold. According to the principle of mathematical recursive reasoning, when tm+1t<sm+1, one can get

    V(t)V(tm+1)(γ1Eα(ttm+1)α). (3.17)

    One can derive

    V(sm+1)V(t0)mk=1(Eα(γ1(sktk)α)Eα(γ2(tk+1sk)α))(γ1Eα(sm+1tm+1)α). (3.18)

    For sm+1t<tm+2,

    V(t)V(t0)mk=1(Eα(γ1(sktk)α)Eα(γ2(tk+1sk)α))Eα(γ1(sm+1tm+1)α)Eα(γ2(tsm+1)α). (3.19)

    Based on the Assumption 1, one can have that the lower bound of sktk is h and the upper bound of tk+1tk is H. The upper bound of tksk is Hh. Therefore, one can obtain that:

    For tm+1t<sm+1,

    V(t)V(t0)mk=1(Eα(γ1(h)α)Eα(γ2(Hh)α))Eα(γ1(ttm+1)α). (3.20)

    For sm+1t<tm+2,

    V(t)V(t0)(Eα(γ1(h)α)mEα(γ2(Hh)α))mEα(γ1(h)α)Eα(γ2(tsm+1)α). (3.21)

    From the condition (Eα(γ1hα)mEα(γ2(Hh)α))m<1 and 0thtm<Hh, we can derive that (Eα(γ1hα)mEα(γ2(thtk)α))m is bounded. So, one can obtain

    limm(Eα(γ1(h)α)mEα(γ2(Hh)α))m=0.

    Then, limtV(t)=0, the proof of theorem is over.

    This completes the proof of Theorem.

    Remark 1. In Theorem 1, by using aperiodically intermittent controller, synchronization problem is investigated. Based on the property of Mittag-Leffler function, through strict mathematical reasoning, we can derive V(t)0 when t. Therefore, we can get that the theorem holds.

    Remark 2. Intermittent synchronization strategy has been studied [41] and [42]. In [41], synchronization via aperiodically intermittent strategy is first given in the form of a theory. Compared with [41] and [42], aperiodically intermittent strategy is more general. In Theorem 1, if the control interval tkskh and tkskH, aperiodically intermittent strategy is degraded to periodically intermittent control. That is to say, periodically intermittent control is a special form of aperiodically intermittent strategy. Aperiodically intermittent strategy owns more practical characteristics. In this case, a corollary (see Corollary 1) is given.

    Remark 3. Synchronization of integer order dynamical systems via aperiodically intermittent control has been investigated. As far as we know, there are no works on fractional order. As is known to all, integral order derivative is a special case of fractional order derivative. When the fractional order derivative a = 1, the derived conclusion can be directly applied to the integral order works. That is to say, the works of integer order on aperiodically intermittent are a special case of Theorem 1.

    Corollary 1. When tkskh and tktk+1J, the controller (2.5) is degenerated into

    u(t)={K(y(t)x(t)),tkt<sk+h,0,sk+ht<tk+1. (3.22)

    Controller (3.22) is rewritten as

    u(t)={K(y(t)x(t)),kHt<kH+h,0,kH+ht<(k+1)H. (3.23)

    Under the Lemmas 1–4, and Assumption 1, fractional-order master-system (2.1) and slave-systems (2.2) can achieve synchronization under controller (3.22) or (3.23), if

    ||C||+||A||||L||<||K||,
    Eα(γ1hα)Eα(γ2(Hh)α)<1,

    where, γ1=||C||+||A||||L||||K|| and γ2=||C||+||A||||L|| are two positive scalers. All the parameters are the same as Theorem 1.

    In this section, an example is given to verify the validity of the sufficient conditions derived by the Theorem 1.

    Example 1. Considering three-neuron fractional-order MRNNs, the master-systems are as follows:

    Dαy(t)=Cx(t)+A(x(t))f(x(t))+I(t), (4.1)

    where α=0.95, Ij(t)=(0,0,0),j=1,2,3

    C=(300030003),
    fj(xj(t))=tanh(xj(t))(j=1,2,3),

    and

    a11(x1(t))={2,|x1(t)|1,1.85,|x1(t)|>1,,a12(x2(t))={1.6,|x2(t)|1,1.5,|x2(t)|>1,,a13(x3(t))={9,|x3(t)|1,8.8,|x3(t)|>1,,
    a21(x1(t))={9,|x1(t)|1,8.8,|x1(t)|>1,,a22(x2(t))={2,|x2(t)|1,1.85,|x2(t)|>1,,a23(x3(t))={1.6,|x3(t)|1,1.5,|x3(t)|>1,,
    a31(x1(t))={1.6,|x1(t)|1,1.5,|x1(t)|>1,,a32(x2(t))={9,|x2(t)|1,8.8,|x2(t)|>1,,a33(x3(t))={2,|x3(t)|1,1.85,|x3(t)|>1.

    The slave-systems of MRNNs are considered as follows:

    Dαy(t)=Cy(t)+A(y(t))f(y(t))+I(t)+u(t), (4.2)

    some parameters are given as follows: H=2,h=1.4, K=18, l1=l2=l3=1, one can get γ1=||C||+||L||||A||K<0, γ2=7.5357>0 Eα(γ1hα)Eα(γ2(Hh)α)=0.5730<1. The state trajectories of x1(t),x2(t),x3(t) are depicted on Figure 5 with initial condition x(0)=[1,2,3]T. Under the initial condition of y(0)=[1,2,3]T, Figure 6 depicts the errors of x(t) and y(t) without control. Figures 79 depict synchronization state trajectories of (x1(t),y1(t))), (x2(t),y2(t)) and (x3(t),y3(t)) with control. Each dimensional synchronization error is described in Figure 10. From synchronization states Figures 79, one can derive that master-slave systems can get synchronization with designed controller. Synchronization error Figure 10 also verifies the derived theory.

    Figure 5.  The phase trajectories of x1,x2,x3.
    Figure 6.  The error trajectories without control.
    Figure 7.  The synchronization trajectories of x1,y1 with control.
    Figure 8.  The synchronization trajectories of x2,y2 with control.
    Figure 9.  The synchronization trajectories of x3,y3 with control.
    Figure 10.  The synchronization error of e1(t),e2(t),e3(t) with control.

    In this paper, by using aperiodically intermittent controller, the synchronization problem of fractional-order memristor-based recurrent neural networks is investigated. Although there have been some results about aperiodically intermittent control, those results are studied in integer domain. In the case of fractional calculus, as far as we know, there are only some works on periodically intermittent control. With reasonable assumptions and suitable lemmas, by means of Lyapunov method, synchronization is obtained via aperiodically intermittent control. A simulation example is presented to illustrate the validity of derived sufficient conditions which. Delays are widespread in dynamical systems. Different kinds of delay will have different effects on the dynamical system. It is of great significance to study the influence of delay on dynamical system. In this paper, system are considered without delay. Therefore, in the future, we consider the situation with delays. Furthermore, In addition, the selection of parameters usually depends on experience, resulting in high control costs. Therefore, in the future, optimization algorithm is considered to find the optimal parameter.

    This work was jointly supported by the Natural Science Foundation of Jiangsu Province of China under Grant No. BK20170171, Postgraduate Research & Practice Innovation Program of Jiangsu Province under Grant No. KYCX18_1857, No. KYCX18_1858.

    The authors declare there is no conflict of interest.



    [1] T. W. Kim, A. E. Azzaoui, B. Koh, J. Kim, J. H. Park, A secret sharing-based distributed cloud system for privacy protection, Hum. Centric Comput. Inf. Sci., 12 (2022). https://doi.org/10.22967/HCIS.2022.12.020 doi: 10.22967/HCIS.2022.12.020
    [2] C. Blundo, C. De Maio, M. Parente, L. Siniscalchi, Targeted advertising that protects the privacy of social networks users, Hum. Centric Comput. Inf. Sci., 11 (2021), 18. https://doi.org/10.22967/HCIS.2021.11.018 doi: 10.22967/HCIS.2021.11.018
    [3] C. Jia, C. Jia, L. Kong, W. Lin, L. Qi, Privacy-aware retrieval of electronic medical records by fuzzy keyword search, Hum. Centric Comput. Inf. Sci., 12 (2022). https://doi.org/10.22967/HCIS.2022.12.041 doi: 10.22967/HCIS.2022.12.041
    [4] L. Orans, A. Hils, J. D'Hoinne, E. Ahlm, Gartner, Predicts 2017: Network and Gateway Security, 2016.
    [5] Let's encrypt stats. Available from: https://letsencrypt.org/stats/
    [6] Cisco encrypted traffic analytics white paper. Available from: https://www.cisco.com/c/en/us/solutions/collateral/enterprise-networks/enterprise-network-security/nb-09-encrytd-traf-anlytcs-wp-cte-en.pdf
    [7] F. Veysset, O. Courtay, O. Heen, New tool and technique for remote operating system fingerprinting, Intranode Softw. Technol., 4 (2002).
    [8] L. Bernaille, R. Teixeira, I. Akodkenou, A. Soule, K. Salamatian, Traffic classification on the fly, in: ACM Sigcomm Comput. Commun. Rev., 36 (2006), 23–26. https://doi.org/10.1145/1129582.1129589
    [9] P. Velan, M. Čermák, P. Čeleda, M. Drašar, A survey of methods for encrypted traffic classification and analysis, Int. J. Netw. Manag., 25 (2015), 355–374. https://doi.org/10.1002/nem.1901 doi: 10.1002/nem.1901
    [10] F. Pacheco, E. Exposito, M. Gineste, C. Baudoin, J. Aguilar, Towards the deployment of machine learning solutions in network traffic classification: A systematic survey, IEEE Commun. Surv. Tutor., 23 (2018), 1988–2014. https://doi.org/10.1109/COMST.2018.2883147 doi: 10.1109/COMST.2018.2883147
    [11] C. Oh, J. Ha, H. Roh, A survey on TLS-encrypted malware network traffic analysis applicable to security operations centers, Appl. Sci., 12 (2021), 155. https://doi.org/10.3390/app12010155 doi: 10.3390/app12010155
    [12] E. Papadogiannaki, S. Ioannidis, A survey on encrypted network traffic analysis applications, techniques, and countermeasures, ACM Comput. Surv., 54 (2021), 1–35. https://doi.org/10.1145/3457904 doi: 10.1145/3457904
    [13] H. Gao, W. Huang, T. Liu, Y. Yin, Y. Li, PPO2: Location privacy-oriented task offloading to edge computing using reinforcement learning for intelligent autonomous transport systems, IEEE Trans. Intell. Transport. Syst., (2022), 1–14. https://doi.org/10.1109/TITS.2022.3169421 doi: 10.1109/TITS.2022.3169421
    [14] Z. Zhang, Y. Li, H. Dong, H. Gao, Y. Jin, W. Wang, Spectral-based directed graph network for malware detection, spectral-based directed graph network for malware detection, IEEE Trans. Netw. Sci. Eng., 8 (2021), 957–970. https://doi.org/10.1109/TNSE.2020.3024557 doi: 10.1109/TNSE.2020.3024557
    [15] H. Gao, B. Qiu, R. J. Duran Barroso, W. Hussain, Y. Xu, X. Wang, TSMAE: A novel anomaly detection approach for Internet of things time series data using memory-augmented autoencoder, IEEE Trans. Netw. Sci. Eng., (2022), 1–1. https://doi.org/10.1109/TNSE.2022.3163144 doi: 10.1109/TNSE.2022.3163144
    [16] P. Li, X. Wang, H. Gao, X. Xu, M. Iqbal, K. Dahal, A dynamic and scalable user-centric route planning algorithm based on polychromatic sets theory, IEEE Trans. Intell. Transp. Syst., 23 (2022), 2762–2772. https://doi.org/10.1109/TITS.2021.3085026 doi: 10.1109/TITS.2021.3085026
    [17] A. Freier, P. Karlton, P. Kocher, The secure sockets layer (SSL) protocol version 3.0, The Internet Engineering Task Force, IETF. https://www.rfc-editor.org/rfc/rfc6101.html
    [18] K. Moriarty, S. Farrell, Deprecating, TLS 1.0 and TLS 1.1, Internet Engineering Task Force, IETF. https://www.hjp.at/doc/rfc/rfc8996.html
    [19] R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM., 21 (1978), 120–126. https://doi.org/10.1145/359340.359342 doi: 10.1145/359340.359342
    [20] D. Johnson, A. Menezes, S. Vanstone, The elliptic curve digital signature algorithm (ECDSA), Int. J. Inf. Sec., 1 (2001), 36–63. https://doi.org/10.1007/s102070100002 doi: 10.1007/s102070100002
    [21] S. Josefsson, I. Liusvaara, Edwards-curve digital signature algorithm (EdDSA), Internet Engineering Task Force, IETF, (2017), No. rfc8032.
    [22] J. Bradley, B. Campbell, T. Lodderstedt, N. Sakimura, OAuth 2.0 mutual-TLS client authentication and certificate-bound access tokens, Internet Engineering Task Force, IETF, (2020), Rep. rfc8705.
    [23] K. L. Chung, Markov chains, Springer-Verlag, 1967. https://doi.org/10.1007/978-3-642-49686-8
    [24] D. Bertsekas, J. N. Tsitsiklis, Introduction to probability, Athena Scientific, 2008.
    [25] S. R. Eddy, What is a hidden Markov model?, Nat. Biotechnol., 22 (2004), 1315–1316. https://doi.org/10.1038/nbt1004-1315 doi: 10.1038/nbt1004-1315
    [26] L. Gong, X. Gong, Y. Liang, B. Zhang, A. Y. Yang, Life prediction of hydraulic concrete based on grey residual markov model, J. Inf. Process. Syst., 18 (2022), 457–469. https://doi.org/10.3745/JIPS.04.0247 doi: 10.3745/JIPS.04.0247
    [27] S. Dick, Artificial intelligence, Harv. Data Sci. Rev., 1 (2019). https://doi.org/10.1162/99608f92.92fe150c doi: 10.1162/99608f92.92fe150c
    [28] H. Yoon, S. Jeong, Electric power demand prediction using deep learning model with temperature data, KIPS transactions on software and data engineering, 11 (2022), 307–314. https://doi.org/10.3745/KTSDE.2022.11.7.307 doi: 10.3745/KTSDE.2022.11.7.307
    [29] H. Wang, Z. Lei, X. Zhang, B. Zhou, J. Peng, Machine learning basics, Deep Learn, (2016), 98–164.
    [30] M. I. Jordan, T. M. Mitchell, Machine learning: Trends, perspectives, and prospects, Science, 349 (2015), 255–260. https://doi.org/10.1126/science.aaa8415 doi: 10.1126/science.aaa8415
    [31] I. Ristic, HTTP client fingerprinting using SSL handshake analysis, 2009. Available from: http://www.ssllabs.com/projects/client-fingerprinting
    [32] M. Majkowski, SSL fingerprinting for p0f, 2012. Available from: https://idea.popcount.org/2012-06-17-ssl-fingerprinting-for-p0f
    [33] L. Brotherston, GitHub, FingerprinTLS, 2015. Available from: http://github.com/LeeBrotherston/tlsfingerprinting
    [34] J. Althouse, S. Engineering, J.A. Open Sourcing, 2017. Available from: http://engineering.salesforce.com/open-sourcing-ja3-92c9e53c3c41
    [35] TLS Fingerprinting addendum, Joy: A package for capturing and analyzing network Data features, 2019. Available from: https://github.com/cisco/joy
    [36] J. Althouse, T.L.S. Saleforce Engineering, Fingerprinting with JA3 and JA3S, 2019. Available from: http://engineering.salesforce.com/tls-fingerprinting-with-ja3-and-ja3s
    [37] B. Anderson, D. McGrew, TLS beyond the browser: Combining end host and network data to understand application behavior, in: Proceedings of the Internet Measurement Conference, (2019), 379–392. https://doi.org/10.1145/3355369.3355601
    [38] B. Anderson, D. McGrew, Accurate TLS fingerprinting using destination context and knowledge bases, (2020), preprint. https://doi.org/10.48550/arXiv.2009.01939
    [39] M. Korczyński, A. Duda, Markov chain fingerprinting to classify encrypted traffic, in: IEEE Conference on Computer Communications, IEEE Publications Infocom, IEEE Publications, (2014), 781–789. https://doi.org/10.1109/INFOCOM.2014.6848005
    [40] C. Liu, Z. Cao, G. Xiong, G. Gou, S. M. Yiu, L. He, MaMPF: Encrypted traffic classification based on multi-attribute markov probability fingerprints, in: 26th International Symposium on Quality of Service (IWQoS), IEEE Publications/ACM, IEEE Publications, (2018), 1–10. https://doi.org/10.1109/IWQoS.2018.8624124
    [41] C. Liu, G. Xiong, G. Gou, S. M. Yiu, Z. Li, Z. Tian, Classifying encrypted traffic using adaptive fingerprints with multi-level attributes, World Wide Web, 24 (2021), 2071–2097. https://doi.org/10.1007/s11280-021-00940-0 doi: 10.1007/s11280-021-00940-0
    [42] D. Chao, A fingerprint enhancement and second-order Markov chain based malicious encrypted traffic identification scheme, in: Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence, (2020), 328–333. https://doi.org/10.1145/3404555.3404590
    [43] Y. Zhao, Y. N. Yang, K. Wu, Y. Hao, H. Su, Q. Zhao, A classification and identification technology of TLS encrypted traffic applications, in: I.E.E.E. IV International (Ed.) Conference on Big Data and Artificial Intelligence (BDAI), IEEE Publications, (2021), 160–164. https://doi.org/10.1109/BDAI52447.2021.9515274
    [44] B. Garn, D. E. Simos, S. Zauner, R. Kuhn, R. Kacker, Browser fingerprinting using combinatorial sequence testing, in: Proceedings of the 6th Annual Symposium on Hot Topics in the Science of Security, (2019), 1–9. https://doi.org/10.1145/3314058.3314062
    [45] B. Garn, S. Zauner, D. E. Simos, M. Leithner, R. Kuhn, R. Kacker, A Two-Step TLS-Based Browser fingerprinting approach using combinatorial sequences, Comput. Secur. J., 114 (2022), 102575. https://doi.org/10.1016/j.cose.2021.102575 doi: 10.1016/j.cose.2021.102575
    [46] R. Dubin, A. Dvir, O. Pele, O. Hadar, I know what you saw last minute—Encrypted http adaptive video streaming title classification, IEEE Trans. Inf. Forensics Secur., 12 (2017), 3039–3049. https://doi.org/10.1109/TIFS.2017.2730819 doi: 10.1109/TIFS.2017.2730819
    [47] L. Yang, S. Fu, Y. Luo, J. Shi, Markov probability fingerprints: A method for identifying encrypted video traffic, in: 16th International Conference on Mobility, Sensing and Networking (MSN), IEEE Publications, (2020), 283–290. https://doi.org/10.1109/MSN50589.2020.00055
    [48] K. Al-Naami, S. Chandra, A. Mustafa, L. Khan, Z. Lin, K. Hamlen, et al., Adaptive encrypted traffic fingerprinting with bi-directional dependence, in: Proceedings of the 32nd Annual Conference on Computer Security Applications, (2016), 177–188. https://doi.org/10.1145/2991079.2991123
    [49] A. Kanda, M. Hashimoto, Identification of TLS communications using randomness testing, in: 2021 IEEE Publications 45th Annual Computers, software, and Applications Conference (COMPSAC), 1099–1106. https://doi.org/10.1109/COMPSAC51774.2021.00150
    [50] L. E. Bassham Ⅲ, A. L. Rukhin, J. Soto, J. R. Nechvatal, M. E. Smid, E. B. Barker, et al., A statistical test suite for random and pseudorandom number generators for cryptographic applications, National Institute of Standards & Technology, 800–822, 2010.
    [51] K. Böttinger, D. Schuster, C. Eckert, Detecting fingerprinted data in TLS traffic, in: Proceedings of the 10th ACM Symposium on Information, Comput. Commun. Security, (2015), 633–638. https://doi.org/10.1145/2714576.2714595
    [52] Z. Zhang, C. Kang, G. Xiong, Z. Li, Deep forest with LRRS feature for fine-grained website fingerprinting with encrypted SSL/TLS, in: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, (2019), 851–860. https://doi.org/10.1145/3357384.3357993
    [53] J. Lu, G. Gou, M. Su, D. Song, C. Liu, C. Yang, et al., GAP-WF: Graph attention pooling network for fine-grained SSL/TLS Website fingerprinting, in: International Joint Conference on Neural Networks (IJCNN), IEEE, (2021), 1–8. https://doi.org/10.1109/IJCNN52387.2021.9533543
    [54] C. Richter, M. Finsterbusch, J. A. Müller, K. Hänßgen, Classification of TLS applications, in: Proceedings of the 9th International Conference on Internet Monitoring and Protection, ICIMP, (2014), 1–6.
    [55] B. Anderson, Classifying encrypted traffic with TLS-aware telemetry, in: CERT, FloCon2016, (2016).
    [56] B. Anderson, D. McGrew, Identifying encrypted malware traffic with contextual flow data, in: Proceedings of the 2016 ACM Workshop on Artificial Intelligence and Security, (2016), 35–46. https://doi.org/10.1145/2996758.2996768
    [57] B. Anderson, S. Paul, D. McGrew, Deciphering malware's use of TLS (without decryption), J. Comput. Virol. Hacking Tech., 14 (2018), 195–211. https://doi.org/10.1007/s11416-017-0306-6 doi: 10.1007/s11416-017-0306-6
  • This article has been cited by:

    1. María Sancho, Radioactive waste management and disposal – introduction to the special issue, 2023, 10, 2372-0352, 125, 10.3934/environsci.2023007
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(3956) PDF downloads(192) Cited by(3)

Figures and Tables

Figures(12)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog