Loading...
Search for:
secrecy-rate
0.011 seconds
A comparison between different meta-heuristic techniques in power allocation for physical layer security
, Article Iranian Journal of Electrical and Electronic Engineering ; Volume 13, Issue 4 , 2017 , Pages 310-317 ; 17352827 (ISSN) ; Mosavi, M. R ; Behroozi, H ; Sharif University of Technology
Abstract
Node cooperation can protect wireless networks from eavesdropping by using the physical characteristics of wireless channels rather than cryptographic methods. Allocating the proper amount of power to cooperative nodes is a challenging task. In this paper, we use three cooperative nodes, one as relay to increase throughput at the destination and two friendly jammers to degrade eavesdropper’s link. For this scenario, the secrecy rate function is a non-linear non-convex problem. So, in this case, exact optimization methods can only achieve suboptimal solution. In this paper, we applied different meta-heuristic optimization techniques, like Genetic Algorithm (GA), Partial Swarm Optimization...
Compressed sensing encryption: compressive sensing meets detection theory
, Article Journal of Communications ; Volume 13, Issue 2 , February , 2018 , Pages 82-87 ; 17962021 (ISSN) ; Ghanizade Bafghi, H ; Seyfe, B ; Sharif University of Technology
Engineering and Technology Publishing
2018
Abstract
Since compressive sensing utilizes a random matrix to map the sparse signal space to a lower dimensional transform domain, it may be possible to apply this matrix at the same time for encrypting the signal opportunistically. In this paper, a compressed sensing based encryption method is considered and the secrecy of measurement matrix of compressive sensing is analysed from the detection theory perspective. Here, the detection probability of intended and unintended receivers are compared by applying the Neyman-Pearson test. We prove that the detection probability of eavesdropper will be reduced significantly because he does not know the transform domain subspace. Furthermore, in some...
Imperfect and Perfect Secrecy in Compound Multiple Access Channel with Confidential Message
, Article IEEE Transactions on Information Forensics and Security ; Volume 11, Issue 6 , 2016 , Pages 1239-1251 ; 15566013 (ISSN) ; Akhbari, B ; Ahmadian Attari, M ; Aref, M. R ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
Abstract
In this paper, we study the problem of secret communication over a compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential, which is only decoded by its corresponding receiver and kept secret from the other receiver. We call this proposed setting the compound MAC with a confidential message. For this model, we derive general inner and outer bounds for both imperfect and perfect secrecy conditions for the second receiver. Also, as examples, we investigate less noisy and Gaussian versions of this channel, and extend the results of the discrete memoryless version to these cases. Moreover, providing numerical examples for the...
A genetic approach in relay-jammer selection and power allocation for physical layer security
, Article 8th International Symposium on Telecommunications, IST 2016, 27 September 2016 through 29 September 2016 ; 2017 , Pages 374-379 ; 9781509034345 (ISBN) ; Mosavi, M. R ; Behroozi, H ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2017
Abstract
Node cooperation approaches improve physical layer security in wireless networks without applying data encryption. Selecting the appropriate nodes to cooperate as relays or friendly jammers, to degrade eavesdropper's link, is a challenging problem which has attracted a lot of attention in recent years. Various approaches, based on conventional exhaustive search, have been suggested for optimal relay-jammer selection and power allocation in the literature. The complexity of these methods is proportional to the number of intermediate nodes. As the number of intermediate nodes exceeds a specific bound, conventional exhaustive search appears infeasible due to high computational complexity. In...
Achievablity and Secrecy Analysis of Rates in Communication Systems for Having Coordinated Behaviour
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor) ; Aminzadeh Gohari, Amin (Co-Advisor)
Abstract
Elements of a theory of cooperation and coordination in networks will be developed. Rather than considering a communication network as a means of distributing information, or of reconstructing random processes at remote nodes, we ask what dependence can be established among the nodes given the communication constraints. Specifically, in a network with communication rates {R(i,j)} between the nodes, we ask what the set of all is achievable joint distributions p(x1,…,xm) of actions at the nodes of the network. After describing the concepts of empirical coordination for some special networks, we will consider secrecy concepts in coordination. Then we will discuss the concepts of strong...
Secure Transmission on the Multi-Terminal Two-Hop Untrusted Relay with Lattice Coding and Decoding
, M.Sc. Thesis Sharif University of Technology ; Behroozi, Hamid (Supervisor)
Abstract
Analysis of the achievable secrecy rate in channels has always been of significant importance.The importance further increased probably due to development of new generations of communication networks in recent years. The secrecy rate refers to the maximum transmission rate for which transmitted data during the transmission process is guaranteed to be error-free and not sniffable. In this thesis, we will investigate the two-hop channel with untrusted relay using lattice coding. In other words, the purpose of this study is to provide a decoder-encoder architecture based on lattice codes, in order to obtain a secrecy rate in a channel where two pairs of transmitter-receivers attempt to exchange...
One-receiver two-eavesdropper broadcast channel with degraded message sets
, Article IEEE Transactions on Information Forensics and Security ; Volume 8, Issue 7 , 2013 , Pages 1162-1172 ; 15566013 (ISSN) ; Mirmohseni, M ; Aref, M. R ; Sharif University of Technology
2013
Abstract
In this paper, we study the one-receiver two-eavesdropper Broadcast Channel (BC) with three degraded message sets. A common message is sent to three receivers. Another message is sent to the first and second receivers and needs to be kept secret from the third receiver (second eavesdropper). The third message is sent to the first receiver and needs to be kept secret from the second and third receivers (first and second eavesdroppers). First, we consider perfect secrecy conditions at the eavesdroppers, where we find an achievable perfect secrecy region. In the achievability scheme, we use superposition coding which divides the available randomness into different levels. These levels are used...
Physical Layer Security in Wireless Communication Networks in Presence of Intelligent Reflecting Surfaces
, M.Sc. Thesis Sharif University of Technology ; Nasiri Kenari, Masoumeh (Supervisor) ; Mirmohseni, Mahtab (Co-Supervisor)
Abstract
The ever-increasing demand for wireless communication has raised the need for better utilization of bandwidth and energy. Intelligent Reflecting Surface (IRS) is an emerging technology that has been proposed for the sixth generation of wireless communication. In this thesis, we study the essential role these surfaces can play in improving the physical layer security.First, we consider a relatively realistic scenario for the location of the eavesdroppers. In this scenario, we will assume that the transmitters, users, and eavesdroppers all use a single antenna configuration, and the eavesdroppers are placed randomly across the studied region. Two notable parameters in physical layer security,...
Physical layer security in AF and CF relay networks with RF-energy harvesting
, Article 2017 14th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, ISCISC 2017, 6 September 2017 through 7 September 2017 ; 2018 , Pages 86-92 ; 9781538665602 (ISBN) ; Mirmohseni, M ; Aref, M. R ; Sharif University of Technology
Abstract
In this paper, we investigate the achievable secrecy rate in a relay channel where the source and the destination wish to keep the information confidential from an untrusted relay (potential eavesdropper). The relay has no energy supply, and harvests its required energy for relaying from its received signals. For radio-frequency (RF) Energy Harvesting (EH) at the relay, we adopt power splitting (PS) approach. We study the problem of achieving positive secrecy rates between the transmitter and the receiver while making use of an untrusted relay. Energy limitation at the relay makes the problem more interesting. Because, the relay must choose either to eavesdrop the signal to be able to decode...
Jamming-resilient frequency hopping-aided secure communication for internet-of-things in the presence of an untrusted relay
, Article IEEE Transactions on Wireless Communications ; Volume 19, Issue 10 , July , 2020 , Pages 6771-6785 ; Kuhestani, A ; Behroozi, H ; Ng, D. W. K ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2020
Abstract
In this paper, we propose a light-weight jamming-resistant scheme for the Internet-of-Things (IoT) in 5G networks to ensure high-quality communication in a two-hop cooperative network. In the considered system model, a source communicates with a destination in the presence of an untrusted relay and a powerful multi-Antenna adversary jammer. The untrusted relay is an authorized necessary helper who may wiretap the confidential information. Meanwhile, the jammer is an external attacker who tries to damage both the training and transmission phases. Different from traditional frequency hopping spread spectrum (FHSS) techniques that require a pre-determined pattern between communicating nodes, in...