Secrecy in Security Protocols as Non Interference

n/

On the Throughput Cost of Physical Layer Security in Decentralized Wireless Networks

This paper studies the throughput of large-scale decentralized wireless networks with physical layer security constraints. In particular, we are interested in the question of how much throughput needs to be sacrificed for achieving a certain level of security. We consider random networks where the legitimate nodes and the eavesdroppers are distributed according to independent two-dimensional Poisson point processes. The transmission capacity framework is used to characterize the area spectral efficiency of secure transmissions with constraints on both the quality of service (QoS) and the level of security. This framework illustrates the dependence of the network throughput on key system parameters, such as the densities of legitimate nodes and eavesdroppers, as well as the QoS and security constraints. One important finding is that the throughput cost of achieving a moderate level of security is quite low, while throughput must be significantly sacrificed to realize a highly secure network. We also study the use of a secrecy guard zone, which is shown to give a significant improvement on the throughput of networks with high security requirements.Comment: Accepted for publication in IEEE Transactions on Wireless Communication

Performance enhancement solutions in wireless communication networks

In this dissertation thesis, we study the new relaying protocols for different wireless network systems. We analyze and evaluate an efficiency of the transmission in terms of the outage probability over Rayleigh fading channels by mathematical analyses. The theoretical analyses are verified by performing Monte Carlo simulations. First, we study the cooperative relaying in the Two-Way Decode-and-Forward (DF) and multi-relay DF scheme for a secondary system to obtain spectrum access along with a primary system. In particular, we proposed the Two-Way DF scheme with Energy Harvesting, and the Two-Way DF Non-orthogonal Multiple Access (NOMA) scheme with digital network coding. Besides, we also investigate the wireless systems with multi-relay; the best relay selection is presented to optimize the effect of the proposed scheme. The transmission protocols of the proposed schemes EHAF (Energy Harvesting Amplify and Forward) and EHDF (Energy Harvesting Decode and Forward) are compared together in the same environment and in term of outage probability. Hence, with the obtained results, we conclude that the proposed schemes improve the performance of the wireless cooperative relaying systems, particularly their throughput. Second, we focus on investigating the NOMA technology and proposing the optimal solutions (protocols) to advance the data rate and to ensure the Quality of Service (QoS) for the users in the next generation of wireless communications. In this thesis, we propose a Two-Way DF NOMA scheme (called a TWNOMA protocol) in which an intermediate relay helps two source nodes to communicate with each other. Simulation and analysis results show that the proposed protocol TWNOMA is improving the data rate when comparing with a conventional Two-Way scheme using digital network coding (DNC) (called a TWDNC protocol), Two-Way scheme without using DNC (called a TWNDNC protocol) and Two-Way scheme in amplify-and-forward(AF) relay systems (called a TWANC protocol). Finally, we considered the combination of the NOMA and physical layer security (PLS) in the Underlay Cooperative Cognitive Network (UCCN). The best relay selection strategy is investigated, which uses the NOMA and considers the PLS to enhance the transmission efficiency and secrecy of the new generation wireless networks.V této dizertační práci je provedena studie nových přenosových protokolů pro různé bezdrátové síťové systémy. S využitím matematické analýzy jsme analyzovali a vyhodnotili efektivitu přenosu z hlediska pravděpodobnosti výpadku přes Rayleighův kanál. Teoretické analýzy jsou ověřeny provedenými simulacemi metodou Monte Carlo. Nejprve došlo ke studii kooperativního přenosu ve dvoucestném dekóduj-a-předej (Two-Way Decode-and-Forward–TWDF) a vícecestném DF schématu s větším počtem přenosových uzlů pro sekundární systém, kdy takto byl získán přístup ke spektru spolu s primárním systémem. Konkrétně jsme navrhli dvoucestné DF schéma se získáváním energie a dvoucestné DF neortogonální schéma s mnohonásobným přístupem (Non-orthogonal Multiple Access–NOMA) s digitálním síťovým kódováním. Kromě toho rovněž zkoumáme bezdrátové systémy s větším počtem přenosových uzlů, kde je přítomen výběr nejlepšího přenosového uzlu pro optimalizaci efektivnosti navrženého schématu. Přenosové protokoly navržených schémat EHAF (Energy Harvesting Amplify and Forward) a EHDF(Energy Harvesting Decode and Forward) jsou společně porovnány v identickém prostředí z pohledu pravděpodobnosti výpadku. Následně, na základě získaných výsledků, jsme dospěli k závěru, že navržená schémata vylepšují výkonnost bezdrátových kooperativních systémů, konkrétně jejich propustnost. Dále jsme se zaměřili na zkoumání NOMA technologie a navrhli optimální řešení (protokoly) pro urychlení datového přenosu a zajištění QoS v další generaci bezdrátových komunikací. V této práci jsme navrhli dvoucestné DF NOMA schéma (nazýváno jako TWNOMA protokol), ve kterém mezilehlý přenosový uzel napomáhá dvěma zdrojovým uzlům komunikovat mezi sebou. Výsledky simulace a analýzy ukazují, že navržený protokol TWNOMA vylepšuje dosaženou přenosovou rychlost v porovnání s konvenčním dvoucestným schématem používajícím DNC (TWDNC protokol), dvoucestným schématem bez použití DNC (TWNDNC protokol) a dvoucestným schématem v zesil-a-předej (amplify-and-forward) přenosových systémech (TWANC protokol). Nakonec jsme zvážili využití kombinace NOMA a zabezpečení fyzické vrstvy (Physical Layer Security–PLS) v podpůrné kooperativní kognitivní síti (Underlay Cooperative Cognitive Network–UCCN). Zde je zde zkoumán výběr nejlepšího přenosového uzlu, který užívá NOMA a bere v úvahu PLS pro efektivnější přenos a zabezpečení nové generace bezdrátových sítí.440 - Katedra telekomunikační technikyvyhově

Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical-layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical-layer message authentication is also introduced briefly. The survey concludes with observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials, 201

A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead

Physical layer security which safeguards data confidentiality based on the information-theoretic approaches has received significant research interest recently. The key idea behind physical layer security is to utilize the intrinsic randomness of the transmission channel to guarantee the security in physical layer. The evolution towards 5G wireless communications poses new challenges for physical layer security research. This paper provides a latest survey of the physical layer security research on various promising 5G technologies, including physical layer security coding, massive multiple-input multiple-output, millimeter wave communications, heterogeneous networks, non-orthogonal multiple access, full duplex technology, etc. Technical challenges which remain unresolved at the time of writing are summarized and the future trends of physical layer security in 5G and beyond are discussed.Comment: To appear in IEEE Journal on Selected Areas in Communication

A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends

This paper examines the security vulnerabilities and threats imposed by the inherent open nature of wireless communications and to devise efficient defense mechanisms for improving the wireless network security. We first summarize the security requirements of wireless networks, including their authenticity, confidentiality, integrity and availability issues. Next, a comprehensive overview of security attacks encountered in wireless networks is presented in view of the network protocol architecture, where the potential security threats are discussed at each protocol layer. We also provide a survey of the existing security protocols and algorithms that are adopted in the existing wireless network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term evolution (LTE) systems. Then, we discuss the state-of-the-art in physical-layer security, which is an emerging technique of securing the open communications environment against eavesdropping attacks at the physical layer. We also introduce the family of various jamming attacks and their counter-measures, including the constant jammer, intermittent jammer, reactive jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the integration of physical-layer security into existing authentication and cryptography mechanisms for further securing wireless networks. Finally, some technical challenges which remain unresolved at the time of writing are summarized and the future trends in wireless security are discussed.Comment: 36 pages. Accepted to Appear in Proceedings of the IEEE, 201

Relating two standard notions of secrecy

Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never be disclosed while equivalence-based secrecy states that two executions of a protocol with distinct instances for s should be indistinguishable to an attacker. Although the second formulation ensures a higher level of security and is closer to cryptographic notions of secrecy, decidability results and automatic tools have mainly focused on the first definition so far. This paper initiates a systematic investigation of the situations where syntactic secrecy entails strong secrecy. We show that in the passive case, reachability-based secrecy actually implies equivalence-based secrecy for digital signatures, symmetric and asymmetric encryption provided that the primitives are probabilistic. For active adversaries, we provide sufficient (and rather tight) conditions on the protocol for this implication to hold.Comment: 29 pages, published in LMC

Computer-aided proofs for multiparty computation with active security

Secure multi-party computation (MPC) is a general cryptographic technique that allows distrusting parties to compute a function of their individual inputs, while only revealing the output of the function. It has found applications in areas such as auctioning, email filtering, and secure teleconference. Given its importance, it is crucial that the protocols are specified and implemented correctly. In the programming language community it has become good practice to use computer proof assistants to verify correctness proofs. In the field of cryptography, EasyCrypt is the state of the art proof assistant. It provides an embedded language for probabilistic programming, together with a specialized logic, embedded into an ambient general purpose higher-order logic. It allows us to conveniently express cryptographic properties. EasyCrypt has been used successfully on many applications, including public-key encryption, signatures, garbled circuits and differential privacy. Here we show for the first time that it can also be used to prove security of MPC against a malicious adversary. We formalize additive and replicated secret sharing schemes and apply them to Maurer's MPC protocol for secure addition and multiplication. Our method extends to general polynomial functions. We follow the insights from EasyCrypt that security proofs can be often be reduced to proofs about program equivalence, a topic that is well understood in the verification of programming languages. In particular, we show that in the passive case the non-interference-based definition is equivalent to a standard game-based security definition. For the active case we provide a new NI definition, which we call input independence

Secrecy performance of TAS/SC-based multi-hop harvest-to-transmit cognitive WSNs under joint constraint of interference and hardware imperfection

In this paper, we evaluate the secrecy performance of multi-hop cognitive wireless sensor networks (WSNs). In the secondary network, a source transmits its data to a destination via the multi-hop relaying model using the transmit antenna selection (TAS)/selection combining (SC) technique at each hop, in the presence of an eavesdropper who wants to receive the data illegally. The secondary transmitters, including the source and intermediate relays, have to harvest energy from radio-frequency signals of a power beacon for transmitting the source data. Moreover, their transmit power must be adjusted to satisfy the quality of service (QoS) of the primary network. Under the joint impact of hardware imperfection and interference constraint, expressions for the transmit power for the secondary transmitters are derived. We also derive exact and asymptotic expressions of secrecy outage probability (SOP) and probability of non-zero secrecy capacity (PNSC) for the proposed protocol over Rayleigh fading channel. The derivations are then verified by Monte Carlo simulations.Web of Science195art. no. 116