ORIGINAL RESEARCH article

Front. Phys., 10 January 2022

Sec. Interdisciplinary Physics

Volume 9 - 2021 | https://doi.org/10.3389/fphy.2021.806647

Secure Communication Scheme for Brain-Computer Interface Systems Based on High-Dimensional Hyperbolic Sine Chaotic System

  • 1. School of Psychology, Northwest Normal University, Lanzhou, China

  • 2. Key Laboratory of and Mental Health of Gansu Province, Northwest Normal University, Lanzhou, China

  • 3. Lanzhou University Science Park, Lanzhou University, Lanzhou, China

  • 4. School of Information Science and Engineering, Lanzhou University, Lanzhou, China

Article metrics

View details

4

Citations

2,3k

Views

647

Downloads

Abstract

Brain-Computer Interface (BCI) is a direct communication pathway between the brain and the external environment without using peripheral nerves and muscles. This emerging topic is suffering from serious issues such as malicious tampering and privacy leakage. To address this issue, we propose a novel communication scheme for BCI Systems. In particular, this scheme first utilizes high-dimensional chaotic systems with hyperbolic sine nonlinearity as the random number generator, then decorrelation operation is used to remove the physical characteristics of the output sequences. Finally, each of the sequences is applied in differential chaos shift keying (DCSK). Since each output sequence corresponds to a unique electrode, the communication data of different electrodes will not interfere with each other. Compared with popular multi-user DSCK schemes using Walsh code sequences, this scheme does not require the channel data of all electrodes while decoding. Therefore, this scheme has higher efficiency. Experimental results on communication data indicate that the proposed scheme can provide a high level of security.

Introduction

Brain-computer interface (BCI) is a real-time communication system in which messages or commands sent by the user do not pass through the brain’s natural output pathways [1]. This technology provides a new way of brain monitoring, human-computer interaction, and it has broad applications in medical rehabilitation and other fields [2]. The representative works of BCI systems mainly involve two paths [3]. The first path is the realization of information exchange and control with the external environment by directly decoding the brain’s instructions [4]. Such applications like BCI-based cursor system [5], robotic arm [6], wheelchair [7], text input method [8] help disabled patients to control external devices without using peripheral nerves and muscles. The second path is rehabilitation, enhancement, and improvement of the central nervous system [9]. By using BCI systems, new rehabilitation paradigms are proposed to help patients to recover from nervous system disease. Such BCI auxiliary training strategy can benefit stroke rehabilitation training [10] and spinal injury rehabilitation training [11].

Most of the above BCI systems use plain-text to transmit EEG data, which have serious issues such as malicious tampering and privacy leakage [12, 13]. For example, an attacker can easily decode the commands from the brain and control the device through tampering [14]. For BCI-based rehabilitation methods, malicious tampering can aggravate the patient’s condition [15]. Therefore, the communication data need to be encrypted to prevent the BCI systems from threats.

The basic communication system consists of an information source and an information sink connected by a channel. Unlike image data or video data, EEG is a high-dimensional and continuous data flow [16]. In BCI systems, the EEG data are collected by the electrode and then converted to digital signals by the AD converter. Next, the digital EEG data flow are transmitted to the servers. The servers extract the features from the EEG signals and decode them to human commands. Considering those characteristics of EEG data and BCI systems, we designed a secure communication scheme to protect the transmissive EEG data flow. In particular, we applied a high-dimensional chaotic system of hyperbolic sine nonlinearity in the differential chaos shift keying (DCSK) scheme to prevent BCI systems from malicious tampering and privacy leakage [17].

DCSK is a chaos-based method for secure communication. Chaotic signals have many special characteristics, such as nonperiodicity, long-term unpredictability, wide spectrum, self- and cross-correlation characteristics [18, 19]. It is worth noting that the chaotic system will not only produce chaotic attractors, but also several independent attractors under certain parameters, that is, multiple coexisting attractors [2022]. These characteristics meet the requirements of cryptosystem and secure communication system [23, 24]. A large number of literatures have proved that chaos-based image encryption schemes can provide high security and robustness, which can be used as a reliable image cryptosystem [25, 26].

Encryption is an effective way to protect data for information sources and an information sink, while secure communication scheme can protect the transmitted data in channel. DCSK is a secure communication scheme that employ non-periodic and wideband chaotic signals as carriers to achieve the effect of spectrum spreading in the process of digital modulation [27]. The reason why we use this route map is as follows: 1) The transmissive EEG data flow is a digital signal. There is no loss of EEG signal using the DCSK scheme for communication [28]. 2) The transmissive data in the DCSK scheme are the non-periodic chaotic signal or the modulated chaotic signal which can protect the EEG data from malicious tampering and privacy leakage [29]. 3) DCSK scheme is a simple method to achieve secure communication purposes without using chaos synchronization [30].

Since the BCI system is a multi-channel system, the multi-user DCSK schemes are required to protect the EEG data flow. Kolumban et al. first combined the multi-user technology with the DCSK system [31]. In 2005, Frequency Modulated Efficient DCSK, FM-E-DCSK is proposed, which uses a reference signal to modulate multiple information signals to increase the transmission rate [32]. In 2016, Zhang et al. proposed Multi User Segment Shift Differential Chaos Shift Keying, MU-SSDCSK. According to the number of users, this scheme divides the reference signals into signal segments, and then shifts these signal segments and matches them with different Walsh codes to form mutually orthogonal carrying signals [33]. In recent years, the DCSK scheme using Walsh code has gradually become the mainstream multi-user DCSK scheme [34]. However, all the above multi-user DCSK schemes are not suitable for BCI system. This is because BCI system requires high calculation accuracy to extract features from EEG signals [35]. Multiplexing the transmission signal will reduce the accuracy of feature extraction [36]. Although using Walsh codes can solve this problem, it needs all the channels to decode the transmission signal, while BCI systems only use a few of the EEG signals to extract the features corresponding to the command. For example, Zhang et al. selected part of 64-channel for improving BCI illiteracy [37]. Atkinson et al. proposed an improving BCI-based emotion recognition by using 14 channels of 32-electrode channels [38].

High Dimensional Multi User DCSK Scheme

To design an accurate and efficient secure communication scheme, we utilize high dimensional chaotic systems as the pseudo-random number generator, each variable corresponds to one channel which is used in the DCSK scheme. The flowchart is shown in Figure 1.

FIGURE 1

In this scheme, the controller selects the communication channel according to the corresponding BCI task. When a specific communication channel is selected, the channel first transmits a decorrelated chaotic sequence of length as a reference signal, then transmits a multiplied modulated signal which has the same length as the decorrelated chaotic sequence. The modulation rule is described as follows:Where is the decorrelated chaotic sequence generated by a high dimensional chaotic system, is the transmitted EEG data in BCI system, is the time slot (length of the reference signal and modulated signal), represents the iteration time.

For the demodulation process, the receiver calculates the correlation between the received signal and the signal , which is delayed by . The output of the correlator is:

Therefore, the information bit can be restored by the sign of the decision variable:

The difficulty of this scheme is to design a high-dimensional chaotic system to generate the pseudo-random sequences. Reference [39] introduced a new and unified approach for designing desirable dissipative hyperchaotic systems. Reference [40] proposed a design method for generating hyperchaotic cat maps with any desired number of positive Lyapunov exponents. Our previous work proposed a simple method for generating nth order chaotic systems with hyperbolic sine nonlinearity [41]. The proposed scheme utilizes two back-to-back diodes representing hyperbolic sine nonlinearity without any multiplier or subcircuits. Therefore, the proposed high dimensional chaotic systems can achieve both physical simplicity and analytic complexity at the same time.

Secure Communication Scheme for Brain-Computer Interface Based Speller and Microsleep Detector

Here we applied the proposed scheme in BCI-based speller and microsleep detector. Electroencephalography (EEG) -based P300 speller is a type of brain-computer interface (BCI) that uses EEG to allow a user to select characters without physical movement [42]. The EEG-based microsleep detector uses BCI technology to detect drowsiness, which can benefit the drivers to avoid car accidents [43]. If the communication data of these BCI systems have been maliciously tampered, the attackers may cause some serious accidents.

The above BCI systems use 16-electrode to collect EEG signals. Therefore, it is needed to design a chaotic system that has sixteen dimensions. In this paper, EEG data were acquired from 16 scalp sites (extended 10–20 system) using a cap with active Ag/AgCl electrodes. Wet electrodes were used in the cap, and the electrode impedance was modulated to be less than 5 KΩ. The reference electrode was on the bilateral mastoid. A Neuroscan Synamps2 amplifier amplified the EEG signal. The sampling rate of the EEG signal was 1 kHz. We collected EEG data of subjects performing ballistic index finger abduction movements [28], and the data length is about 15 min.

16th-Order Hyperbolic Sine Chaotic System

Based on the design method proposed in Ref. [41], we proposed the 16th-order hyperbolic sine chaotic system, which is described as follows:

When , the system exhibits chaotic behavior, the waveform is shown as Figure 2, the phase space plot is shown in Figure 3.

FIGURE 2

FIGURE 3

To study the overall dynamic behavior of the proposed system, we plot the Largest Lyapunov exponent spectrum. Lyapunov exponent is a measure of a system’s predictability and sensitivity to changes in its initial conditions. If the largest Lyapunov exponent (LLE) is greater than zero, the system exhibits chaotic behavior. If LLE = 0, the system exhibits periodic behavior. If LLE <0, the system converges to a stable point. When , The largest Lyapunov exponent spectrum is shown as Figure 4.

FIGURE 4

From Figure 4, the chaos exists in except some period windows are embedded.

Physical Characteristics of the Output Sequence

Although the proposed system can generate pseudo-random sequences, it has physical characteristics [45], Figure 5 is the probability density distributions of the output sequence , , , .

FIGURE 5

From the results of Figure 5, the output sequences have physical characteristics. Therefore, it may be cracked by the side-channel attack. To remove the physical characteristics, we utilize the decorrelation operation:

The probability density distributions of the above sequences after decorrelation operation are plotted in Figure 6.

FIGURE 6

Experiments

This section is the performance analysis of the proposed scheme, which includes mutual interference suppression, security, bit error rate, and time efficiency.

Mutual Interference Between Channels

The decorrelation operation not only can remove the physical characteristics, but also can suppress mutual interference between channels. We test the Pearson product-moment correlation coefficient (PPMCC) of data of two output sequences. The comparative results are shown in Tables 1, 2.

TABLE 1

x16x15x14x13x12x11x10x9x8x7x6x5x4x3x2x1
0.0017−0.00660.05640.10630.12090.0483−0.1257−0.3534−0.5389−0.5843−0.44−0.12830.26930.64630.90841x1
0.0012−0.01210.06310.10860.0823−0.0578−0.2841−0.5009−0.5921−0.4838−0.18380.22470.62240.90210.9084x2
−0.0018−0.01540.07880.10230.0095−0.2025−0.4458−0.5871−0.5241−0.24330.17390.59470.894610.9020.6463x3
−0.0076−0.00790.09830.0682−0.1122−0.3733−0.5672−0.5587−0.30620.11610.5620.885810.89460.62240.2693x4
−0.01440.01880.1015−0.02−0.2834−0.5297−0.5851−0.37110.05160.52390.875210.88580.59470.2247−0.1283x5
−0.01820.06580.0559−0.1781−0.4711−0.5998−0.4361−0.01910.48010.862710.87520.5620.1739−0.1838−0.44x6
−0.01320.1181−0.0663−0.3847−0.5966−0.4988−0.09580.43080.848310.86270.52390.1161−0.2433−0.4838−0.5843x7
0.0040.144−0.2591−0.5614−0.5538−0.17850.37480.831710.84830.48010.0516−0.3062−0.5241−0.5921−0.5389x8
0.03150.106−0.4581−0.5856−0.26580.31060.812310.83170.4308−0.0191−0.3711−0.5587−0.5871−0.5009−0.3534x9
0.0626−0.0163−0.5467−0.35070.23520.788910.81230.3748−0.0958−0.4361−0.5851−0.5672−0.4458−0.2841−0.1257x10
0.0868−0.2097−0.40560.14240.758810.78890.3106−0.1785−0.4988−0.5998−0.5297−0.3733−0.2025−0.05780.0483x11
0.067−0.42180.01440.712910.75880.2352−0.2658−0.5538−0.5966−0.4711−0.2834−0.11220.00950.08230.1209x12
−0.1225−0.49090.619510.71290.1424−0.3507−0.5856−0.5614−0.3847−0.1781−0.020.06820.10230.10860.1063x13
−0.50650.0000310.61950.0144−0.4056−0.5467−0.4581−0.2591−0.06630.05590.10150.09830.07880.06310.0564x14
−0.000110.00003−0.4909−0.4218−0.2097−0.01630.1060.1440.11810.06580.0188−0.0079−0.0154−0.0121−0.0066x15
1−0.0001−0.5065−0.12250.0670.08680.06260.03150.004−0.0132−0.0182−0.0144−0.0076−0.00180.00120.0017x16

Pearson product-moment correlation coefficient of the two output sequences before decorrelation operation.

TABLE 2

x16x15x14x13x12x11x10x9x8x7x6x5x4x3x2x1
−0.00060.00090.00001−0.000010.0002−0.0006−0.002−0.0009−0.0004−0.0004−0.00050.0004−0.00070.0004−0.00171x1
−0.0007−0.00150.0002−0.00010.00310.0012−0.0009−0.00130.00180.00210.00140.00050.0006−0.00041−0.0017x2
−0.0018−0.00050.00090.0004−0.0003−0.00010.00220.00010.0007−0.0016−0.00030.0001−0.00081−0.00040.0004x3
−0.0013−0.00050.00040.0013−0.0001−0.00090.0005−0.0004−0.00010.00110.0015−0.00111−0.00080.0006−0.0007x4
0.00120.0005−0.00110.0004−0.00060.0003−0.00010.0008−0.0002−0.00020.0011−0.00110.00010.00050.0004x5
0.001−0.00050.0007−0.0009−0.0002−0.00070.0004−0.00030.00050.000510.0010.0015−0.00030.0014−0.0005x6
−0.00110.00080.0007−0.00070.00150.00240.00003−0.0015−0.000910.0005−0.00020.0011−0.00160.0021−0.0004x7
−0.00290.00170.001−0.0004−0.0008−0.00010.001−0.00021−0.00090.0005−0.0002−0.00010.00070.0018−0.0004x8
0.00020.00090.00020.0019−0.00010.00050.00011−0.0002−0.0015−0.00030.0008−0.00040.0001−0.0013−0.0009x9
−0.00060.0009−0.00020.0004−0.0001−0.001110.00010.0010.000030.0004−0.00010.00050.0022−0.0009−0.002x10
0.00140.0019−0.0007−0.00120.00011−0.00110.0005−0.00010.0024−0.00070.0003−0.0009−0.00010.0012−0.0006x11
0.0017−0.00030.001−0.002810.0001−0.0001−0.0001−0.00080.0015−0.0002−0.0006−0.0001−0.00030.00310.0002x12
0.00170.00020.00071−0.0028−0.00120.00040.0019−0.0004−0.0007−0.00090.00040.00130.0004−0.0001−0.00001x13
0.00040.001710.00070.001−0.0007−0.00020.00020.0010.00070.0007−0.00110.00040.00090.00020.00001x14
0.001410.00170.0002−0.00030.00190.00090.00090.00170.0008−0.00050.0005−0.0005−0.0005−0.00150.0009x15
10.00140.00040.00170.00170.0014−0.00060.0002−0.0029−0.00110.0010.0012−0.0013−0.0018−0.0007−0.0006x16

Pearson product-moment correlation coefficient of the two output sequences after decorrelation operation.

From the results in Table 1. Most PPMCCs are greater than 0.4, some PPMCC like , are over 0.9, which means the original sequences have strong correlation. From the results in Table 2, PPMCC after decorrelation are less than 0.01, which means the sequences after decorrelation operation have strong interference suppression ability, the communication data flow of different channels will not interfere with each other, which ensures that the BCI systems can accurately extract EEG features.

Key Space Analysis

If the attackers have all the details of the HD-MU-DCSK scheme, this communication protocol will no longer be secure. In this circumstance, the defender can improve the security by frequently changing the secure key. For Eq. 4, all initial conditions and control parameters can set to be the secure keys. As shown in Figure 4, chaos exists in . Suppose all initial conditions and control parameters are equal, the key space will be larger than (for 32-bit system), if the defender changes secure key every second, the keys can be used for over years. Therefore, the proposed scheme can provide high security level.

Security Analysis

Security is the most important performance considered in this work. To evaluate the data security of the proposed scheme, we use the standard statistical test suite (SP 800–22) for random number generators provided by the National Institute of Standard Technology (NIST). The test results of the output sequence after decorrelation operation is shown in Table 3.

TABLE 3

Testp-valueResult
Approximate Entropy0.098853Success
Block Frequency0.94943Success
Cumulative Sums0.392,502Success
FFT0.978,037Success
Frequency0.252,624Success
Linear Complexity0.906,511Success
Longest Run0.443,146Success
Non-Overlapping Template0.361,567Success
Overlapping Template1Success
Random Excursions0.05684Success
Random Excursions Variant0.627,287Success
Rank0.659,889Success
Runs0.668,711Success
Serial0.093027Success
Universal0.141,508Success

Results of SP 800–22 test using after decorrelation operation.

From Tables 36, the output sequence , , , and after decorrelation operation can pass all of the NIST tests. Therefore, it can provide a high level of security when these sequences as the carrier signal.

TABLE 4

Testp-valueResult
Approximate Entropy1Success
Block Frequency0.930,814Success
Cumulative Sums0.545,722Success
FFT0.201,659Success
Frequency0.352,521Success
Linear Complexity0.516,151Success
Longest Run0.113,107Success
Non-Overlapping Template0.257,712Success
Overlapping Template1Success
Random Excursions0.394,639Success
Random Excursions Variant0.785,267Success
Rank0.82942Success
Runs0.180,869Success
Serial0.485,295Success
Universal0.822,527Success

Results of SP 800–22 test using after decorrelation operation.

TABLE 5

Testp-valueResult
Approximate Entropy0.831,444Success
Block Frequency0.774,929Success
Cumulative Sums0.390,633Success
FFT0.516,412Success
Frequency0.439,182Success
Linear Complexity0.784,995Success
Longest Run0.159,788Success
Non-Overlapping Template0.186,118Success
Overlapping Template0.054513Success
Random Excursions0.301,755Success
Random Excursions Variant0.723,645Success
Rank0.142,671Success
Runs0.585,076Success
Serial0.978,004Success
Universal0.854,829Success

Results of SP 800–22 test using after decorrelation operation.

TABLE 6

Testp-valueResult
Approximate Entropy0.846,242Success
Block Frequency0.904,758Success
Cumulative Sums0.689,519Success
FFT0.832,839Success
Frequency0.523,474Success
Linear Complexity0.651,641Success
Longest Run0.276,194Success
Non-Overlapping Template0.07046Success
Overlapping Template0.051553Success
Random Excursions0.150,568Success
Random Excursions Variant0.616,838Success
Rank0.644,792Success
Runs0.900,739Success
Serial0.834,662Success
Universal0.881,265Success

Results of SP 800–22 test using after decorrelation operation.

Bit Error Rate

The proposed scheme can carry out secure communication under noisy channels. The performance of the bit error rate is shown in Figure 7.

FIGURE 7

Time Efficiency

We have tested 106 bit data to evaluate the time efficiency performance of the proposed scheme. The computer configuration used in this test is i5-8,265 processor (8-core, 1.60 GHz) with 8 GB memory. The average detailed results are shown in Table 7.

TABLE 7

IndexTime, sSpeed, kb/s
Generation of Carrier signal29.86433.485
Modulation0.2504,000
Demodulation0.2783,597.122

Results of time and speed of the scheme.

From the testing results of time efficiency performance, the main factor restricting the speed of this scheme is the generation of chaotic sequences. This is because we utilize Fourth-order Runge-Kutta algorithm to generate the output sequence, each iteration time requires 80 iterations. If a circuit or FPGA is used to generate high-speed pseudo-random numbers, this problem can be solved.

Conclusion and Future Work

In this work, we proposed a secure communication scheme for BCI systems based on high-dimensional hyperbolic sine chaotic systems. The testing results indicate that the proposed scheme can provide a high level of security. The communication data between the electrodes will not cause mutual interference. For the time efficiency of the proposed scheme, the generation of the pseudo-random sequences is the bottleneck restricting the execution speed of the scheme. Designing the corresponding circuit or FPGA system can solve this bottleneck.

Statements

Data availability statement

The original contributions presented in the study are included in the article/Supplementary Material, further inquiries can be directed to the corresponding author.

Author contributions

XZ raises the issue of security risks of BCI systems. JL designed the secure communication scheme. XZ, XD, DT, and PC performed the experiments. JL wrote the paper. All authors have proposed amendments to the manuscript.

Funding

This study is supported by the Natural Science Foundation of Gansu Province (No. 21JR7RA510), and Distinguished Young Scholars of Gansu Province of China (No. 21JR7RA345).

Acknowledgments

The authors would like to thank Jing Lian for the helpful suggestions.

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

References

  • 1.

    WolpawJRBirbaumerNHeetderksWJMcFarlandDJPeckhamPHSchalkGet alBrain-computer Interface Technology: a Review of the First International Meeting. IEEE Trans Rehab Eng (2000) 8(2):16473. 10.1109/tre.2000.847807

  • 2.

    OrtizMIáñezEGaxiola-TiradoJAGutiérrezDAzorínJM. Study of the Functional Brain Connectivity and Lower-Limb Motor Imagery Performance after Transcranial Direct Current Stimulation. Int J Neur Syst (2020) 30(08):2050038. 10.1142/s0129065720500380

  • 3.

    MühlCAllisonBNijholtAChanelG. A Survey of Affective Brain Computer Interfaces: Principles, State-Of-The-Art, and Challenges[J]. Brain-Computer Inter (2014) 1(2):6684.

  • 4.

    WolpawJRMcFarlandDJVaughanTMSchalkG. The Wadsworth Center Brain-Computer Interface (BCI) Research and Development Program. IEEE Trans Neural Syst Rehabil Eng (2003) 11(2):14. 10.1109/tnsre.2003.814442

  • 5.

    RohaniDASorensenHBDPuthusserypadyS. In: Brain-computer interface using P300 and virtual reality: A gaming approach for treating ADHD[C]//2014 36th Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE (2014). p. 36069.

  • 6.

    HsuW-Y. Continuous Eeg Signal Analysis for Asynchronous Bci Application. Int J Neur Syst (2011) 21(04):33550. 10.1142/s0129065711002870

  • 7.

    WolpawJRBirbaumerNMcFarlandDJPfurtschellerGVaughanTM. Brain-computer Interfaces for Communication and Control. Clin Neurophysiol (2002) 113(6):76791. 10.1016/s1388-2457(02)00057-3

  • 8.

    DobkinBH. Brain-computer Interface Technology as a Tool to Augment Plasticity and Outcomes for Neurological Rehabilitation. J Physiol (2007) 579(3):63742. 10.1113/jphysiol.2006.123067

  • 9.

    DalyJJHugginsJE. Brain-Computer Interface: Current and Emerging Rehabilitation Applications. Arch Phys Med Rehabil (2015) 96(3):S1S7. 10.1016/j.apmr.2015.01.007

  • 10.

    YangSLiRLiHXuKShiYWangQet alExploring the Use of Brain-Computer Interfaces in Stroke Neurorehabilitation. Biomed Res Int (2021) 2021:9967348. 10.1155/2021/9967348

  • 11.

    BroetzDBraunCWeberCSoekadarSRCariaABirbaumerN. Combination of Brain-Computer Interface Training and Goal-Directed Physical Therapy in Chronic Stroke: A Case Report. Neurorehabil Neural Repair (2010) 24(7):6749. 10.1177/1545968310368683

  • 12.

    LandauOCohenAGordonSNissimN. Mind Your Privacy: Privacy Leakage through BCI Applications Using Machine Learning Methods. Knowledge-Based Syst (2020) 198:105932. 10.1016/j.knosys.2020.105932

  • 13.

    ZhuHGuoYZhangL. An Improved Convolution Merkle Tree-Based Blockchain Electronic Medical Record Secure Storage Scheme. J Inf Security Appl (2021) 61:102952. 10.1016/j.jisa.2021.102952

  • 14.

    TakabiHBhalotiyaAAlohalyM. In: Brain computer interface (BCI) applications: Privacy threats and countermeasures[C]//2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC). IEEE (2016). p. 10211.

  • 15.

    LiQQDingDContiM. In: Brain-computer interface applications: Security and privacy challenges[C]//2015 IEEE Conference on Communications and Network Security (CNS). IEEE (2015). p. 6636.

  • 16.

    YangFZhaoXJiangWGaoPLiuG. Multi-method Fusion of Cross-Subject Emotion Recognition Based on High-Dimensional EEG Features. Front Comput Neurosci (2019) 13:53. 10.3389/fncom.2019.00053

  • 17.

    LiuJClinton SprottJWangSMaY. Simplest Chaotic System with a Hyperbolic Sine and its Applications in DCSK Scheme. IET Commun (2018) 12(7):80915. 10.1049/iet-com.2017.0455

  • 18.

    XiongLZhangXTengSQiLZhangP. Detecting Weak Signals by Using Memristor-Involved Chua's Circuit and Verification in Experimental Platform. Int J Bifurcation Chaos (2020) 30(13):2050193. 10.1142/s021812742050193x

  • 19.

    MaCMouJXiongLBanerjeeSLiuTHanX. Dynamical Analysis of a New Chaotic System: Asymmetric Multistability, Offset Boosting Control and Circuit Realization. Nonlinear Dyn (2021) 103(3):286780. 10.1007/s11071-021-06276-8

  • 20.

    LaiQ. A Unified Chaotic System with Various Coexisting Attractors. Int J Bifurcation Chaos (2021) 31(01):2150013. 10.1142/s0218127421500139

  • 21.

    LaiQWanZKengneLKKamdem KuatePDChenC. Two-memristor-based Chaotic System with Infinite Coexisting Attractors[J]. IEEE Trans Circuits Syst Express Briefs (2020) 68(6):2197201. 10.1109/tcsii.2020.3044096

  • 22.

    LaiQWanZKamdem KuatePD. Modelling and Circuit Realisation of a New No-Equilibrium Chaotic System with Hidden Attractor and Coexisting Attractors. Electron Lett (2020) 56(20):10446. 10.1049/el.2020.1630

  • 23.

    ZhuHDaiLLiuYWuL. A Three-Dimensional Bit-Level Image Encryption Algorithm with Rubik's Cube Method. Mathematics Comput Simulation (2021) 185:75470. 10.1016/j.matcom.2021.02.009

  • 24.

    LiXMouJXiongLWangZXuJ. Fractional-order Double-Ring Erbium-Doped Fiber Laser Chaotic System and its Application on Image Encryption. Opt Laser Tech (2021) 140:107074. 10.1016/j.optlastec.2021.107074

  • 25.

    ZhuHZhaoYSongY. 2D Logistic-Modulated-Sine-Coupling-Logistic Chaotic Map for Image Encryption. IEEE Access (2019) 7:1408198. 10.1109/access.2019.2893538

  • 26.

    ZhuHZhangXYuHZhaoCZhuZ. An Image Encryption Algorithm Based on Compound Homogeneous Hyper-Chaotic System. Nonlinear Dyn (2017) 89(1):6179. 10.1007/s11071-017-3436-y

  • 27.

    LuoRYangHMengCZhangX. A Novel SR-DCSK-Based Ambient Backscatter Communication System[J]. IEEE Trans Circuits Syst Express Briefs (2021) 1. 10.1109/tcsii.2021.3109020

  • 28.

    ZhangXLiHXieTLiuYChenJLongJ. Movement Speed Effects on Beta-Band Oscillations in Sensorimotor Cortex during Voluntary Activity. J Neurophysiol (2020) 124(2):3529. 10.1152/jn.00238.2020

  • 29.

    CaiXXuWHongSWangL. Discrete W Transform Based Index-Keying M-Ary DCSK for Non-coherent Chaotic Communications. IEEE Commun Lett (2021) 25(9):31048. 10.1109/lcomm.2021.3095075

  • 30.

    CapliginsFLitvinenkoAAboltinsAAustrumERusinsAChaotic Jerk Circuit Usage in Communication Systems[C]//2020 IEEE Microwave Theory and Techniques in Wireless Communications (MTTW). IEEE (2020) 1:22730.

  • 31.

    KolumbanGKennedyMPJakoZKisG. Chaotic Communications with Correlator Receivers: Theory and Performance Limits. Proc IEEE (2002) 90(5):71132. 10.1109/jproc.2002.1015003

  • 32.

    QiuHBWangM. Analysis of the System Character of FM-EDCSK[J]. Journal-China Inst Commun (2005) 26(5):113. 10.3321/j.issn:1000-436X.2005.05.018

  • 33.

    ZhangGZhaoCZhangT. Performance Analysis of MISO-MU-OHE-DCSK System over Rayleigh Fading Channels. AEU - Int J Elect Commun (2020) 115:153048. 10.1016/j.aeue.2019.153048

  • 34.

    ChenPWangLChenG. DDCSK-walsh Coding: A Reliable Chaotic Modulation-Based Transmission Technique. IEEE Trans Circuits Syst (2012) 59(2):12832. 10.1109/tcsii.2011.2180109

  • 35.

    ZhangXGuoYGaoBLongJ. In: Enhancing Mu-based BCI performance with rhythmic electrical stimulation at alpha frequency[C]//2019 41st Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC). IEEE (2019). p. 55403. 10.1109/EMBC.2019.8857321

  • 36.

    LiSZhaoYHeLWuZLiY. In: Design and performance analysis of a GFDM-DCSK communication system[C]//2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC). IEEE (2016). p. 8023.

  • 37.

    ZhangXGuoYGaoBLongJ. Alpha Frequency Intervention by Electrical Stimulation to Improve Performance in Mu-Based BCI. IEEE Trans Neural Syst Rehabil Eng (2020) 28(6):126270. 10.1109/tnsre.2020.2987529

  • 38.

    AtkinsonJCamposD. Improving BCI-Based Emotion Recognition by Combining EEG Feature Selection and Kernel Classifiers. Expert Syst Appl (2016) 47:3541. 10.1016/j.eswa.2015.10.049

  • 39.

    ShenCYuSLuJChenG. Designing Hyperchaotic Systems with Any Desired Number of Positive Lyapunov Exponents via A Simple Model. IEEE Trans Circuits Syst (2014) 61(8):23809. 10.1109/tcsi.2014.2304655

  • 40.

    WuYHuaZZhouY. $n$ -Dimensional Discrete Cat Map Generation Using Laplace Expansions. IEEE Trans Cybern (2015) 46(11):262233. 10.1109/TCYB.2015.2483621

  • 41.

    LiuJMaJLianJChangPMaY. An Approach for the Generation of an Nth-Order Chaotic System with Hyperbolic Sine. Entropy (2018) 20(4):230. 10.3390/e20040230

  • 42.

    McCannMTThompsonDESyedZHHugginsJE. Electrode Subset Selection Methods for an EEG-Based P300 Brain-Computer Interface. Disabil Rehabil Assistive Tech (2015) 10(3):21620. 10.3109/17483107.2014.884174

  • 43.

    PutraAEAtmajiCUtamiTG. In: EEG-based microsleep detector using microcontroller[C]//2016 8th International Conference on Information Technology and Electrical Engineering (ICITEE). IEEE (2016). p. 14.

  • 44.

    LiuJZhangXZhaoQLianJHuangFMaY. A Torus-Chaotic System and its Pseudorandom Properties[J]. Complexity (2020) 2020:112. 10.1155/2020/8315658

Summary

Keywords

secure communication scheme, BCI system, chaotic system, privacy protection, DCSK

Citation

Zhang X, Ding X, Tong D, Chang P and Liu J (2022) Secure Communication Scheme for Brain-Computer Interface Systems Based on High-Dimensional Hyperbolic Sine Chaotic System. Front. Phys. 9:806647. doi: 10.3389/fphy.2021.806647

Received

01 November 2021

Accepted

07 December 2021

Published

10 January 2022

Volume

9 - 2021

Edited by

Qiang Lai, East China Jiaotong University, China

Reviewed by

Hegui Zhu, Northeastern University, China

Qingchun Zhao, Northeastern University, China

Updates

Copyright

*Correspondence: Jizhao Liu,

This article was submitted to Interdisciplinary Physics, a section of the journal Frontiers in Physics

Disclaimer

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.

Outline

Figures

Cite article

Copy to clipboard


Export citation file


Share article

Article metrics