Search

Security threats increase as connectivity among vehicles increases. In particular, a lack of authentication, integrity, and confidentiality makes the controller area network (CAN) protocol, which is used in critical domains such as vehicle body and powertrain, vulnerable to threats. In this paper, we propose methods for CAN security enhancement that use a support vector machine (SVM) and the autocorrelation of the received signal to detect a malicious node. Robustness to temperature variation is also considered because autocorrelation is affected by temperature variation. There are two methods based on the degree of uniformity of the temperature distribution. If the temperature is uniformly distributed over the vehicle and the temperature sensor is embedded in the secure node, the first scheme (temperature measurement system) trains data in each segmented temperature range more precisely using multiple classifiers. If not (i.e., a nonuniform temperature distribution or an absence of a temperature sensor), the alternative scheme (all-temperature training system) trains data in all temperature ranges with a single classifier. The performances of the proposed systems are evaluated on a testbed. The proposed method can operate without modifying the CAN protocol because it is based on the characteristics of the physical layer. In addition, security can be enhanced redundantly by the system running independently without authentication protocols. [ABSTRACT FROM AUTHOR]

Recently, the intelligent reflecting surfaces (IRSs)-aided wireless transmission has drawn considerable attention. This paper investigates the use of IRS in enhancing the physical-layer security of the multiuser multiple-input single-output (MU-MISO) broadcast system, where a base station (BS) transmits a common data stream to multiple legitimate receivers in the presence of multiple eavesdroppers (Eves). The BS is assumed to have only some erroneous channel state information (CSI) of the Eves. The CSI error is modeled by a moment-based random error model, in which the BS only knows the first- and second-order statistics of the error, but not the exact distribution. Under this CSI error model, we investigate the joint robust design of the secure beamforming at the BS and the phase shift at the IRS to maximize the worst legitimate user’s SNR, while keeping the Eves’ SNR below certain threshold with high probability, evaluated with respect to any distribution fulfilling the given first and second-order statistics. This robust secure transmission design problem is a semi-infinite chance-constrained problem, which is in general intractable. We show that the considered problem admits an equivalent conic reformulation, which can be handled by alternately optimizing the beamformer at the BS and the phase shift at the IRS via semidefinite relaxation (SDR) and penalty convex-concave procedure (CCP), respectively. To further improve the secrecy performance, we also study another rank-two beamformed Alamouti transmission scheme at the BS, which can be seen as a generalization of conventional rank-one beamforming. Simulation results demonstrate that the proposed designs are robust against the error distribution, and that the inclusion of IRS is not only helpful for enhancing the security, but also useful for promoting a low-rank SDR solution. [ABSTRACT FROM AUTHOR]

In practical implementations, physical-layer key generation (PKG) encounters the bottlenecks of imperfect channel reciprocity, nearby attack, and high temporal auto-correlation. Existing One-Band Multiple-Antenna Loop-bAck key generation (OB-MALA) schemes try to address these challenges through establishing bi-directional channels via echoing rotated received signals. However, we find that OB-MALA schemes can be vulnerable to a multiply-divide (MD) attack, as they echo the received signals through the same band with the pilot signals. To overcome this deficiency, we propose a new method, named Two-Band Multiple-Antenna Loop-bAck key generation (TB-MALA), which exploits two separate bands for pilot transmission and echo reception. The TB-MALA is proved to be robust to the imperfect channel reciprocity caused by radio frequency (RF) front-ends and can resist both the nearby attack and the MD attack. It also reduces the auto-correlation of effective channels with the help of a rotation matrix. The secret key rate of TB-MALA is analyzed and the closed-form of a lower bound is derived for the worst case. Numerical results demonstrate that the proposed TB-MALA protects against these attacks and achieves performance comparable to the ideal case with the perfect reciprocity of RF front-ends. It can thus be used to form a robust, fast, and secure key generation in a multiple-input and multiple-output (MIMO) system. [ABSTRACT FROM AUTHOR]

The problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels is investigated, in which a transmitter attempts to reliably communicate with a legitimate receiver while avoiding detection by a passive adversary. The covert capacity of the MIMO AWGN channel is characterized under a variational distance covertness constraint when the MIMO channel matrices are static and known. The characterization of the covert capacity is also extended to a class of channels in which the legitimate channel matrix is known but the adversary’s channel matrix is only known up to a rank and a spectral norm constraint. [ABSTRACT FROM AUTHOR]

In this paper, we investigate secure content delivery in a two-tier cache-enabled millimeter wave (mmWave) heterogeneous network composed of a macro base station (MBS) and $K $ small base stations (SBSs) with caching capabilities. We allocate finite cache units at the SBSs and MBS to pre-store files with high popularities, where the SBSs store the most popular files, and the MBS stores the less popular ones. To deliver the file requested by a legitimate user securely, two secure transmission schemes, namely, distributed beamforming and direct transmission, are employed at the SBSs and MBS, respectively. Moreover, artificial noise (AN) is combined with the above two transmission schemes to further improve transmission security. The connection outage probability, secrecy outage probability, and secrecy throughput for the proposed mmWave transmission schemes are obtained. Based on these results, we jointly design the transmission rates and the cache resource allocation between the SBSs and MBS to maximize the overall secrecy throughput. We also provide insights into how the overall secrecy throughput is influenced by various parameters, including transmission rates, power allocation ratio of the AN scheme, and cache allocation factor. Numerical results are eventually presented to validate our theoretical analysis and demonstrate the effectiveness of the proposed transmission schemes and cache resource allocation strategy. [ABSTRACT FROM AUTHOR]

In multiple antenna systems employing time-division duplexing, spatial precoder design at the base station (BS) leverages channel state information acquired through uplink pilot transmission, under the assumption of channel reciprocity. Malicious eavesdroppers can start pilot spoofing attacks to alter such design, in order to improve their eavesdropping performance in downlink. The aim of this paper is to study the effects of pilot spoofing attacks on uplink channel estimation, by assuming that the BS knows the angle of arrivals (AoAs) of the legitimate channels. Specifically, after assessing the performance of the simple least squares estimator (LSE), we consider more sophisticated estimators, such as the maximum likelihood estimator (MLE) and different versions of the minimum mean square error estimator (MMSEE), involving different degrees of a priori information about the pilot spoofing attacks. Theoretical analysis and numerical simulations are used to compare the performance of such estimators. In particular, we analytically demonstrate that the spoofing effects in the high signal-to-noise ratio regime can be completely suppressed, under certain conditions involving the AoAs of the legitimate and spoofing channels. Moreover, we show that even an imperfect knowledge of the AoAs and of the average transmission power of the spoofing signals allows the MLE and MMSEE to achieve significant performance gains over the LSE. [ABSTRACT FROM AUTHOR]

Massive MIMO attains high spectral and power efficiency transmission by leveraging a large number of transmit antennas. However, to capture the benefits of massive MIMO, each antenna should be accompanied with a dedicated RF chain, and consequently, the hardware costs would scale up tremendously with the increase of the antennas. Cheap implementations of massive MIMO have recently gained considerable attention, and constant modulus (CM) signaling is seen as a promising solution, owing to its low peak-to-average power ratio (PAPR). This paper investigates the physical-layer (PHY) security in massive MIMO with an emphasis on the CM signaling. In particular, we consider a transmitter with massive antennas broadcast common confidential information to a group of legitimate receivers, and a number of eavesdroppers overhear the transmission and attempt to intercept the information. Our goal is to design the CM beamforming at the transmitter so that the multicast secrecy rate is maximized. This secrecy rate maximization (SRM) problem is generally NP-hard. To tackle it, two tractable approaches are developed. The first one employs the semidefinite relaxation (SDR) technique and the Charnes–Copper transformation to obtain a convex relaxation of the SRM problem. However, due to the dimension lifting of SDR, this approach is feasible only for small to medium antenna sizes. The second approach leverages the Dinkelbach method to work directly over the beamformer domain; a custom-build nonconvex alternating direction method of multipliers (ADMM) algorithm is proposed to efficiently perform each Dinkelbach update. Simulation results demonstrate that the second approach is computationally more efficient and can achieve nearly optimal performance when the number of antennas is large. [ABSTRACT FROM AUTHOR]

In this paper, the achievable secrecy rate of a relay-assisted massive multiple-input multiple-output (MIMO) downlink is investigated in the presence of a multi-antenna active/passive eavesdropper. The excess degrees-of-freedom offered by a massive MIMO base-station (BS) are exploited for sending artificial noise (AN) via random and null-space precoders. An active eavesdropper contaminates the uplink channel estimates by sending pilot sequences identical to those of the legitimate users/relay. This active pilot contamination makes the massive MIMO BS implicitly beamform the confidential signals toward the active eavesdropper during two-hop downlink transmissions. The achievable secrecy rates are derived by taking the detrimental effects of actively contaminated channel state information with estimation errors and spatially correlated fading at the multiple-antenna terminals into account. The secrecy rate loss incurred by active pilot attacks over passive eavesdropping is investigated, and the secrecy rate gap between random and null-space-based AN is compared. A novel transmit power control policy is designed to efficiently allocate transmit power at the BS/relay for payload data and AN sequences for maximizing the achievable secrecy rate. Our results reveal that active pilot contamination attacks significantly degrade the achievable secrecy rate in dual-hop transmissions, and the corresponding detrimental effects cannot be asymptotically mitigated in the infinite BS antenna regime. [ABSTRACT FROM AUTHOR]

We consider a single-cell massive multiple-input multiple-output (MIMO) system in which a base station (BS) with a large number of antennas transmits simultaneously to several single-antenna users. The BS acquires the channel state information (CSI) for various receivers using uplink pilot transmissions. We demonstrate the vulnerability of the CSI estimation process to pilot-contamination (PC) attacks. In our attack model, the attacker aims at minimizing the sum rate of downlink transmissions by contaminating the uplink pilots. We first study these attacks for two downlink power allocation strategies under the assumption that the attacker knows the locations of the BS and its users. Later on, we relax this assumption and consider the case when such knowledge is probabilistic. The formulated problems are solved using stochastic optimization, Lagrangian minimization, and game-theoretic methods. A closed-form solution for a special case of the problem is obtained. Furthermore, we analyze the achievable individual secrecy rates under PC attacks and provide an upper bound on these rates. We also study this scenario without a priori knowledge of user locations at the attacker by introducing chance constraints. Our results indicate that such attacks can degrade the throughput of a massive MIMO system by more than 50%. [ABSTRACT FROM AUTHOR]

Wireless energy harvesting, physical-layer security, and full-duplex wireless are important, emerging fifth generation (5G) technologies. In this paper, we thus investigate a source–destination link with an energy-harvesting full-duplex relay and a jammer (to degrade the eavesdropper channel) in the presence of an eavesdropper. Thus, to exploit energy harvesting and to improve security, we propose a full-duplex jammer (FDJ) protocol and its half-duplex version (HDJ). Two cases for availability of the eavesdropper channel state information (ECSI) are considered: complete ECSI and incomplete ECSI. For both FDJ and HDJ protocols and for complete ECSI, we derive the instantaneous and average secrecy rates and compute optimal time split for energy harvesting. To gain more insights, we consider a practical interference-limited scenario and derive closed-form cumulative distribution function of the signal-to-interference plus noise ratio at the destination and eavesdropper nodes. Comparatively, we show that FDJ improves instantaneous secrecy rate over HDJ. However, the degree of improvement is highly dependent on time split for energy harvesting, amount of self-interference, the channel gains, and locations of the nodes. Our findings reveal that FDJ increases the average secrecy rate 150% over HDJ and 260% over HD relaying without jammer. For incomplete ECSI scenario, we derive asymptotic secrecy outage and show that FDJ performs better for small-to-medium values of source powers; otherwise, HDJ yields a higher gain. [ABSTRACT FROM AUTHOR]

In this paper, we propose a secret group-key generation scheme in physical layer, where an arbitrary number of multi-antenna LNs (LN) exist in mesh topology with a multi-antenna passive eavesdropper. In the first phase of the scheme, pilot signals are transmitted from selected antennas of all nodes and each node estimates channels linked to it. In the second phase, each node sequentially broadcasts a weighted combination of the estimated channel information using selected coefficients. The other LNs can obtain the channel information used for group-key generation while the eavesdropper cannot. Each node then can generate a group key by quantizing and encoding the estimated channels into keys. We apply well-known quantization schemes, such as scalar and vector quantizations, and compare their performance. To further enhance the key-generation performance, we also provide how to determine the antennas at each node used for group-key generation and the coefficients used in the broadcast phase. The simulation results verify the performance of the proposed secret group-key generation scheme using various key-related metrics. We also verify the practical robustness of our scheme by implementing a testbed using universal software radio peripheral. After generating secret common key among three nodes, we also test it using the National Institute of Standards and Technology test suit. The generated key passes the test and it is random enough for communication secrecy. [ABSTRACT FROM AUTHOR]

This paper investigates and quantifies the advantages of a Full-Duplex (FD) transmitter/receiver pair in improving the secrecy rate of the system. We consider a linear precoder design for a multiple-input multiple-output Gaussian wiretap channel, which comprises two legitimate nodes, i.e., Alice and Bob, operating in FD mode and exchanging confidential messages in the presence of a passive eavesdropper. Using the sum secrecy degrees of freedoms (sum SDoFs) as metric, we formulate an optimization problem with respect to Alice’s and Bob’s precoding matrices. In order to solve this problem, we first propose a cooperative secrecy transmission scheme, whose feasible set is sufficient to achieve the maximum sum SDoF. Based on that feasible set, we then determine in closed form the maximum achievable sum SDoF and also provide a method for constructing the precoding matrix pair, which achieves the maximum sum SDoF. The latter pair would be near-optimal in terms of the achievable secrecy sum rate in the high signal-to-noise ratio (SNR) regime. By providing the maximum achievable sum SDoF as a function of the number of antennas, one could select the optimal system parameters to further maximize the achievable sum SDoF. We use simulations to evaluate the performance of the proposed precoding matrices in realistic channel scenarios and at various levels of the SNR. [ABSTRACT FROM PUBLISHER]

We study the Gaussian multiple-input multiple-output multiple-eavesdropper wiretap channel where a transmitter wishes to communicate a confidential message to a legitimate receiver in the presence of eavesdroppers. Each node in the network is equipped with an arbitrary number of antennas. Furthermore, channels are time varying, and there is no channel state information available at the transmitter (CSIT) with respect to eavesdroppers’ channels; and transmitter only has access to delayed CSIT of the channel to the legitimate receiver. The secure degrees of freedom (SDoF) for such a network has only been characterized for special cases, and is unknown in general. We completely characterize the SDoF of this network for all antenna configurations. In particular, we strictly improve the state-of-the-art achievable scheme for this network by proposing more efficient artificial noise alignment at the receivers. Furthermore, we develop a tight upper bound by utilizing three important inequalities that provide lower bounds on the received signal dimensions at receivers which supply delayed CSIT or no CSIT. These inequalities together allow for analysis of signal dimensions in networks with heterogeneous CSIT; and as a result, we present a converse proof that leads to characterization of SDoF for all possible antenna configurations. [ABSTRACT FROM PUBLISHER]

In this paper, a joint relay selection and power allocation (JRP) scheme is proposed to enhance the physical layer security of a cooperative network, where a multiple antennas source communicates with a single-antenna destination in the presence of untrusted relays and passive eavesdroppers (Eves). The objective is to protect the data confidentially while concurrently relying on the untrusted relays as potential Eves to improve both the security and reliability of the network. To realize this objective, we consider cooperative jamming performed by the destination while the JRP scheme is implemented. With the aim of maximizing the instantaneous secrecy rate, we derive a new closed-form solution for the optimal power allocation and propose a simple relay selection criterion under two scenarios of non-colluding Eves (NCE) and colluding Eves (CE). For the proposed scheme, a new closed-form expression is derived for the ergodic secrecy rate (ESR) and the secrecy outage probability as security metrics, and a new closed-form expression is presented for the average symbol error rate as a reliability measure over Rayleigh fading channels. We further explicitly characterize the high signal-to-noise ratio slope and power offset of the ESR to highlight the impacts of system parameters on the ESR. In addition, we examine the diversity order of the proposed scheme to reveal the achievable secrecy performance advantage. Finally, the secrecy and reliability diversity-multiplexing tradeoff of the optimized network are provided. Numerical results highlight that the ESR performance of the proposed JRP scheme for NCE and CE cases is increased with respect to the number of untrustworthy relays. [ABSTRACT FROM PUBLISHER]

This paper studies the privacy-preserving for downlink transmission in multiuser relay networks, where a source communicates with multiple users via a relay employing the amplify-and-forward protocol. Within any scheduling unit, only one user (desired user) is chosen for data reception, and the other users (undesired users) are viewed as potential eavesdroppers due to the broadcast nature of wireless medium. To prevent information leakage, we propose a physical-layer cooperative privacy preserving scheme, whose key idea is to schedule a cooperating user in addition to the desired user to deliver artificial noise (AN). By exploiting the characteristics of channels, the cooperating user carefully designs the AN transmitted during two time slots such that the AN can be canceled out at the desired user, but cannot be removed at the undesired users. As a result, the end-to-end signal-to-noise-ratio of any undesired user is heavily degraded, while that of the desired user is not seriously affected, thus preserving the data confidentiality of the desired user. To maximize the instantaneous secrecy rate, an opportunistic user selection criterion is developed. The lower bound of the ergodic secrecy rate (ESR) as well as the approximate upper bound of the secrecy outage probability is derived. The asymptotic performance of ESR is also analyzed via extreme value theory. Furthermore, to motivate users with heterogeneous channel conditions to participate in cooperation and guarantee the fairness among users, a user-grouping-based selection method is proposed. To evaluate the performance of this method, a novel concept called system fairness factor is introduced and studied. Theoretical analysis and simulation results show that, thanks to the proposed cooperative privacy preserving mechanism, the system ESR grows with the increasing number of users, and much higher secrecy rate and lower secrecy outage probability can be achieved compared with the existing schemes in the literature. [ABSTRACT FROM PUBLISHER]

In this paper, the secure transmission strategy for a multi-input-single-output multi-eavesdropper system with coexistence of a secure user (Bob) and a normal user (NU) is investigated. The NU and Bob require normal and secure data transmissions, respectively, and thus, the stream for the NU can be exploited to confuse the eavesdroppers. To guarantee the security of Bob, artificial noise (AN) is also deliberately injected into the null space of Bob and NU. The power allocation among Bob, NU, and AN, as well as the wiretap code rates, is jointly optimized to maximize the effective secrecy throughput (EST), under the average throughput constraint of the NU and statistical channel state information (CSI) of eavesdroppers. Both non-adaptive and adaptive transmission schemes are proposed, based on the statistical and instantaneous CSI of the legitimate channels, respectively. An alternative optimization algorithm is proposed to obtain the optimal parameters. It is proved that the EST is a quasi-concave function of the secrecy rate and the power allocated to Bob, and for fixed wiretap code rates, the optimal power allocation is derived in a closed-form expression. Numerical results show that the EST increases with the increase in transmitting power and the number of transmit antennas, and decreases with the increasing throughput constraint of the NU. Improved EST can be achieved through injecting AN and concurrent transmission of Bob and NU. [ABSTRACT FROM PUBLISHER]

In this paper, we study secure hybrid automatic retransmission request (HARQ) over block-fading channels when the channel from a legitimate transmitter (i.e., Alice) to an eavesdropper (i.e., Eve) is less noisy than that to a legitimate receiver (i.e., Bob). In order to have a positive secrecy rate, we exploit the notion of the channel reciprocity in time division duplex mode, where the shared channel state information between Alice and Bob is used as a secret key. The resulting HARQ scheme is referred to as channel-aware secure HARQ (CAS-HARQ) in this paper. In this scheme, in order to keep Eve ignorant of the confidential message from Alice to Bob, deliberative transmissions of random message blocks are considered when the channel to Bob is weak. We derive closed-form expressions for bounds on the probabilities of connection outage and secrecy outage to see reliability and security, respectively, of CAS-HARQ. Based on our analysis, we can see that it is possible to have a positive secrecy rate with certain outage probabilities even if the channel to Eve is less noisy than that to Bob. [ABSTRACT FROM PUBLISHER]

We consider an amplify-and-forward relay network composed of a source, two relays, and a destination. In this network, the two relays are untrusted in the sense that they may perform Byzantine attacks by forwarding altered symbols to the destination. Note that every symbol received by the destination may be altered, and hence, no clean reference observation is available to the destination. For this network, we identify a large family of Byzantine attacks that can be detected in the physical layer. We further investigate how the channel conditions impact the detection against this family of attacks. In particular, we prove that all Byzantine attacks in this family can be detected with asymptotically small miss detection and false alarm probabilities by using a sufficiently large number of channel observations if and only if the network satisfies a non-manipulability condition. No pre-shared secret or secret transmission is needed for the detection of these attacks, demonstrating the value of this physical-layer security technique for counteracting Byzantine attacks. [ABSTRACT FROM PUBLISHER]

In this paper, we examine the use of a friendly full-duplex (FD) relay to increase the secrecy rate over a fading channel between the legitimate source and the destination in the presence of residual self-interference (SI) and eavesdropper. In particular, we consider two different protocols based on the FD capability of relay: 1) FD transmission (FDT), in which the FD-Relay receives and sends data concurrently; 2) FD-Relay with jamming (FDJ), where first, the FD-Relay simultaneously receives data and sends jamming to the eavesdropper; then, it forwards the data, while the source jams the eavesdropper. We first develop the secrecy rate expressions for half-duplex transmission (HDT), half-duplex with jamming (HDJ), FDT, and FDJ relaying protocols, and then use them to derive their performance properties in terms of the channel gains between nodes, eavesdropper types, and more importantly, the SI level in FD-Relay. We further investigate the non-convex power allocation problems for the developed FDT and FDJ to maximize the secrecy rate under the power constraints. In particular, we develop an efficient iterative algorithm based on the difference-of-two-concave-functions programming. Analytical and simulation results show the strong influence of SI level on the achieved secrecy rate of the FDT and the FDJ. For sufficiently low SI, FDT achieves a much higher secrecy rate than FDJ, HDJ, and HDT. However, for higher SI, FDJ becomes more effective in enhancing the achieved secrecy rate. The results also indicate that adaptive power allocation can significantly improve the performance and confirm that the proposed FDT and FDJ outperform the HDT and the HDJ. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the secrecy performance for a multiple-input multiple-output (MIMO) wiretap channel in the presence of a multiantenna eavesdropper. In particular, the legitimate transmitter uses transmit antenna selection (TAS) to transmit on a single antenna with the largest signal-to-noise ratio (SNR) while both the legitimate receiver and the eavesdropper adopt maximal ratio combining (MRC) for reception. We derive exact closed-form expressions for the probabilities of achieving positive secrecy rate and secrecy outage in the case of imperfect feedback due to feedback delay and/or feedback error. Furthermore, we derive the asymptotic secrecy outage probability at high SNR, which accurately reveals the secrecy diversity loss due to imperfect feedback. Simulation results are provided to verify our analytical results and illustrate the impact of imperfect feedback on the secrecy performance of such a wiretap system. [ABSTRACT FROM PUBLISHER]

This paper considers the information theoretic secrecy rates that are achievable by an orthogonal frequency-division multiplexing (OFDM) transmitter/receiver pair in the presence of an eavesdropper that might either use an OFDM structure or choose a more complex receiver architecture. The analysis is made possible by modeling the system as a particular instance of a high dimensional multiple-input multiple-output wiretap channel. [ABSTRACT FROM PUBLISHER]

This paper examines the use of nonsystematic channel codes to obtain secure transmissions over the additive white Gaussian noise wire-tap channel. Unlike the previous approaches, we propose to implement nonsystematic coded transmission by scrambling the information bits, and characterize the bit error rate of scrambled transmissions through theoretical arguments and numerical simulations. We have focused on some examples of Bose-Chaudhuri-Hocquenghem and low-density parity-check codes to estimate the security gap, which we have used as a measure of physical layer security, in addition to the bit error rate. Based on a number of numerical examples, we found that such a transmission technique can outperform alternative solutions. In fact, when an eavesdropper (Eve) has a worse channel than the authorized user (Bob), the security gap required to reach a given level of security is very small. The amount of degradation of Eve's channel with respect to Bob's that is needed to achieve sufficient security can be further reduced by implementing scrambling and descrambling operations on blocks of frames, rather than on single frames. While Eve's channel has a quality equal to or better than that of Bob's channel, we have shown that the use of a hybrid automatic repeat-request protocol with authentication still allows achieving a sufficient level of security. Finally, the secrecy performance of some practical schemes has also been measured in terms of the equivocation rate about the message at the eavesdropper and compared with that of ideal codes. [ABSTRACT FROM PUBLISHER]

Providing physical-layer security for mobile users in future broadband wireless networks is of both theoretical and practical importance. In this paper, we formulate an analytical framework for resource allocation in a downlink orthogonal frequency-division multiple access (OFDMA)-based broadband network with coexistence of secure users (SUs) and normal users (NUs). The SUs require secure data transmission at the physical layer while the NUs are served with conventional best-effort data traffic. The problem is formulated as joint power and subcarrier allocation with the objective of maximizing average aggregate information rate of all NUs while maintaining an average secrecy rate for each individual SU under a total transmit power constraint for the base station. We solve this problem in an asymptotically optimal manner using dual decomposition. Our analysis shows that an SU becomes a candidate competing for a subcarrier only if its channel gain on this subcarrier is the largest among all and exceeds the second largest by a certain threshold. Furthermore, while the power allocation for NUs follows the conventional water-filling principle, the power allocation for SUs depends on both its own channel gain and the largest channel gain among others. We also develop a suboptimal algorithm to reduce the computational cost. Numerical studies are conducted to evaluate the performance of the proposed algorithms in terms of the achievable pair of information rate for NU and secrecy rate for SU at different power consumptions. [ABSTRACT FROM PUBLISHER]

We consider secret key agreement based on radio propagation characteristics in a two-way relaying system where two legitimate parties named Alice and Bob communicate with each other via a trusted relay. In this system, Alice and Bob share secret keys generated from measured radio propagation characteristics with the help of the relay in the presence of an eavesdropper. We present four secret key agreement schemes: an amplify-and-forward (AF) scheme, a signal-combining amplify-and-forward (SC-AF) scheme, a multiple-access amplify-and-forward (MA-AF) scheme, and an amplify-and-forward with artificial noise (AF with AN) scheme. In these schemes, the basic idea is to share the effective fading coefficients between Alice and Bob and use them as the source of the secret keys. The AF scheme is based on a conventional amplify-and-forward two-way relaying method, whereas in the SC-AF scheme and the MA-AF scheme, we apply the idea of physical-layer network coding to the secret key agreement. In the AF with AN scheme, the relay transmits artificially generated noise, as well as channel information signal, in order to conceal the latter. Simulation results show that the MA-AF scheme outperforms the other schemes in Rayleigh fading channels, whereas the AF with AN scheme is suitable for Rician fading channels. [ABSTRACT FROM PUBLISHER]

In this paper, we discuss the ability of channel codes to enhance cryptographic secrecy. Toward that end, we present the secrecy metric of degrees of freedom in an attacker's knowledge of the cryptogram, which is similar to equivocation. Using this notion of secrecy, we show how a specific practical channel coding system can be used to hide information about the ciphertext, thus increasing the difficulty of cryptographic attacks. The system setup is the wiretap channel model where transmitted data traverse through independent packet erasure channels (PECs) with public feedback for authenticated automatic repeat-request (ARQ). The code design relies on puncturing nonsystematic low-density parity-check (LDPC) codes with the intent of inflicting an eavesdropper with stopping sets in the decoder. The design amplifies errors when stopping sets occur such that a receiver must guess all the channel-erased bits correctly to avoid an error rate of one half in the ciphertext. We extend previous results on the coding scheme by giving design criteria that reduce the effectiveness of a maximum-likelihood (ML) attack to that of a message-passing (MP) attack. We further extend security analysis to models with multiple receivers and collaborative attackers. Cryptographic security is even enhanced by the system when eavesdroppers have better channel quality than legitimate receivers. [ABSTRACT FROM PUBLISHER]

The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presence of a wiretapper who observes the transmission through another Gaussian channel. Two constraints are imposed on the source-to-destination channel; namely, the source can transmit only binary phase-shift-keyed (BPSK) symbols, and symbol-by-symbol hard-decision quantization is applied to the received symbols of the destination. An error-free public channel is also available for the source and destination to exchange messages in order to help the secret-sharing process. The wiretapper can perfectly observe all messages in the public channel. It is shown that a secret-sharing scheme that employs a random ensemble of regular low-density parity-check (LDPC) codes can achieve the key capacity of the BPSK-constrained Gaussian wiretap channel asymptotically with increasing block length. To accommodate practical constraints of finite block length and limited decoding complexity, fixed irregular LDPC codes are also designed to replace the regular LDPC code ensemble in the proposed secret-sharing scheme. [ABSTRACT FROM PUBLISHER]

This paper presents a coding scheme for the Gaussian wiretap channel based on low-density parity-check (LDPC) codes. The messages are transmitted over punctured bits to hide data from eavesdroppers. The proposed coding scheme is asymptotically effective in the sense that it yields a bit-error rate (BER) very close to 0.5 for an eavesdropper whose signal-to-noise ratio (SNR) is lower than the threshold \SNR_E, even if the eavesdropper has the ability to use a bitwise maximum a posteriori (MAP) decoder. Such codes also achieve high reliability for the friendly parties provided they have an SNR above a second threshold \SNR_B. It is shown how asymptotically optimized LDPC codes are designed with differential evolution where the goal is to achieve high reliability between friendly parties while keeping the security gap \SNR_B /\SNR_E as small as possible to protect against passive eavesdroppers. The proposed coding scheme is encodable in linear time, applicable at finite block lengths, and can be combined with existing cryptographic schemes to deliver improved data security by taking advantage of the stochastic nature of many communication channels. [ABSTRACT FROM PUBLISHER]