Secure Communication Under Channel Uncertainty and Adversarial Attacks

Schaefer, Rafael F.; Boche, Holger; Poor, H. Vincent

doi:10.1109/jproc.2015.2459652

Cited by 56 publications

(22 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, these basic ideas have been applied in other settings, such as optical communication (53,54) and situations with adversarial attacks (25), and in other application areas, such as biometric identification systems (55,56) and smart electricity grids (57).…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Wireless physical layer security

Poor

Schaefer

2016

Proc. Natl. Acad. Sci. U.S.A.

Self Cite

281

133

View full text Add to dashboard Cite

Security in wireless networks has traditionally been considered to be an issue to be addressed separately from the physical radio transmission aspects of wireless systems. However, with the emergence of new networking architectures that are not amenable to traditional methods of secure communication such as data encryption, there has been an increase in interest in the potential of the physical properties of the radio channel itself to provide communications security. Information theory provides a natural framework for the study of this issue, and there has been considerable recent research devoted to using this framework to develop a greater understanding of the fundamental ability of the so-called physical layer to provide security in wireless networks. Moreover, this approach is also suggestive in many cases of coding techniques that can approach fundamental limits in practice and of techniques for other security tasks such as authentication. This paper provides an overview of these developments.information theory | wireless networks | security W ireless communication is one of the most ubiquitous of modern technologies. Cellular communication alone is accessible to an estimated 5 billion people, and this is but one of an array of wireless technologies that have emerged in recent decades. Wireless networks are increasingly used for a very wide range of applications, including banking and other financial transactions, social networking, and environmental monitoring, among many others. For this reason, the security of wireless networks is of critical societal interest. Security has traditionally been implemented at the higher, logical layers of communication networks, rather than at the level of the physical transmission medium. For data confidentiality, encryption is the primary method of ensuring secrecy, a method that works well in most current situations. However, in some emerging networking architectures, issues of key management or computational complexity make the use of data encryption difficult. Examples include ad hoc networks, in which messages may pass through many intermediate terminals on the way from source to destination, and sensor or radio-frequency identification (RFID) networks such as might arise in the envisioned Internet of Things, in which the end devices are of very low complexity. For these and other reasons, there has been considerable recent interest in developing methods for secure data transmission that are based on the physical properties of the radio channel (the so-called wireless physical layer). These results are based on information theoretic characterizations of secrecy, which date to some of Claude Shannon's early work on the mathematical theory of communication (1). Whereas Shannon's work focused on symmetric key encryption systems, perhaps a more relevant development in this area was Aaron Wyner's work on the wiretap channel, which introduced the idea that secrecy can be imparted by the communication channel itself without resorting to the use of shared secret keys (2). A...

show abstract

Section: Resultsmentioning

confidence: 99%

“…A survey on secure communication under channel uncertainty and adversarial attacks can be found in ref. 25.…”

Section: [3]mentioning

confidence: 99%

Wireless physical layer security

Poor

Schaefer

2016

Proc. Natl. Acad. Sci. U.S.A.

Self Cite

281

133

View full text Add to dashboard Cite

show abstract

“…A characterization of achievable rates for this attack scenario is not known, except for the source model for secret key generation, which has been derived in [21]. For an overview of these types of attacks, see [22]. Recently, the corresponding problem for wiretap channels could be solved [23,24].…”

Section: Discussionmentioning

confidence: 99%

Robust Secure Authentication and Data Storage with Perfect Secrecy

Baur

Boche

2018

Cryptography

Self Cite

View full text Add to dashboard Cite

Abstract:We consider an authentication process that makes use of biometric data or the output of a physical unclonable function (PUF), respectively, from an information theoretical point of view. We analyse different definitions of achievability for the authentication model. For the secrecy of the key generated for authentication, these definitions differ in their requirements. In the first work on PUF based authentication, weak secrecy has been used and the corresponding capacity regions have been characterized. The disadvantages of weak secrecy are well known. The ultimate performance criteria for the key are perfect secrecy together with uniform distribution of the key. We derive the corresponding capacity region. We show that, for perfect secrecy and uniform distribution of the key, we can achieve the same rates as for weak secrecy together with a weaker requirement on the distribution of the key. In the classical works on PUF based authentication, it is assumed that the source statistics are known perfectly. This requirement is rarely met in applications. That is why the model is generalized to a compound model, taking into account source uncertainty. We also derive the capacity region for the compound model requiring perfect secrecy. Additionally, we consider results for secure storage using a biometric or PUF source that follow directly from the results for authentication. We also generalize known results for this problem by weakening the assumption concerning the distribution of the data that shall be stored. This allows us to combine source compression and secure storage.

show abstract

“…The golden section search [38] or uniform sampling search can be exploited to acquire the optimal α and γ * (τ ′ ). The optimal α should be chosen as the one that leads to the maximum γ * (τ ′ ) in (12). Ultimately, the optimal Q 0 , Q c and Q a , denoted by (Q * 0 , Q * c , Q * a ), can be retrieved through the relation (14).…”

Section: B a Charnes-cooper Transformation-based Line Searchmentioning

confidence: 99%

Artificial-noise aided transmit design for multi-user MISO systems with integrated services

Mei

Huang

2015

2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP)

View full text Add to dashboard Cite

Abstract-This paper considers artificial noise (AN)-aided transmit designs for multi-user MISO systems in the eyes of service integration. Specifically, we combine two sorts of services, and serve them simultaneously: one multicast message intended for all receivers and one confidential message intended for only one receiver. The confidential message is kept perfectly secure from all the unauthorized receivers. Our goal is to jointly design the optimal input covariances for the multicast message, confidential message and AN, such that the achievable secrecy rate region is maximized subject to the sum power constraint. This secrecy rate region maximization (SRRM) problem is a nonconvex vector maximization problem. To handle it, we reformulate the SRRM problem into a provably equivalent scalar optimization problem and propose a searching method to find all of its Pareto optimal points. The equivalent scalar optimization problem is identified as a secrecy rate maximization (SRM) problem with the quality of multicast service (QoMS) constraints. Further, we show that this equivalent QoMS-constrained SRM problem, albeit nonconvex, can be efficiently handled based on a two-stage optimization approach, including solving a sequence of semidefinite programs (SDPs). Moreover, we also extend the SRRM problem to an imperfect channel state information (CSI) case where a worst-case robust formulation is considered. In particular, while transmit beamforming is generally a suboptimal technique to the SRRM problem, we prove that it is optimal for the confidential message transmission whether in the perfect CSI scenario or in the imperfect CSI scenario. For implementation efficiency, we also analyze the computational complexity of our proposed methods and put forward two suboptimal schemes and two possible extensions. Finally, numerical results demonstrate that the AN-aided transmit designs are effective in expanding the achievable secrecy rate regions, and that the suboptimal strategies can achieve near-optimal performance.

show abstract

Secure Communication Under Channel Uncertainty and Adversarial Attacks

Cited by 56 publications

References 57 publications

Wireless physical layer security

Wireless physical layer security

Robust Secure Authentication and Data Storage with Perfect Secrecy

Artificial-noise aided transmit design for multi-user MISO systems with integrated services

Contact Info

Product

Resources

About