Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1310.4859 · 2012 International Conference on Computing, Networking and Communications (ICNC)

Practical provably secure multi-node communication

Omar Ali, Mahmoud F. Ayoub, Moustafa Youssef

Published Feb 1, 2014• 0 citations
arXivHTMLPDF

Abstract

We present a practical and provably-secure multinode communication scheme in the presence of a passive eavesdropper. The scheme is based on a random scheduling approach that hides the identity of the transmitter from the eavesdropper. This random scheduling leads to ambiguity at the eavesdropper with regard to the origin of the transmitted frame. Implementation of the scheme over Crossbow Telosb motes, equipped with CC2420 radio chips, shows that the scheme can achieve significant secrecy gain with vanishing outage probability. In addition, it has significant overhead advantage over direct extensions to two-nodes schemes. The technique also has the advantage of allowing inactive nodes to leverage sleep mode to further save energy.

DOI
10.1109/iccnc.2014.6785372

Related papers

Practical Provably Secure Multi-node Communication

Omar M. Ali, Mahmoud F. Ayoub, Moustafa A. Youssef

We present a practical and provably-secure multinode communication scheme in the presence of a passive eavesdropper. The scheme is based on a random scheduling approach that hides the identity of the transmitter from the eavesdropper. This random scheduling leads to ambiguity at the eavesdropper with regard to the origin of the transmitted frame. Implementation of the scheme over Crossbow Telosb motes, equipped with CC2420 radio chips, shows that the scheme can achieve significant secrecy gain with vanishing outage probability. In addition, it has significant overhead advantage over direct extensions to two-nodes schemes. The technique also has the advantage of allowing inactive nodes to leverage sleep mode to further save energy.

•Aug 14, 2016•2 citations

Demonstrating practical provably secure multi-node communication

Omar Hassan, Mahmoud F. Ayoub, Moustafa A. Youssef

We demonstrate a practical and provably-secure multi-node communication scheme in the presence of a passive eavesdropper. The scheme is based on a random scheduling approach that hides the identity of the transmitter from the eavesdropper.

ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH)•Aug 22, 2012•2 citations

Practical Provably Secure Communication for Half-Duplex Radios

Ahmed I. El-Morsy, Mohamed Yasser, Mohamed Elsabagh +1 more

In this paper, we present a practical and provably secure two-way wireless communication scheme in the presence of a passive eavesdropper. The scheme implements a randomized scheduling and power allocation mechanism, where each legitimate node transmits in random time slots and with random transmit power. Such randomization results in ambiguity at the eavesdropper with regard to the origin of each transmitted frame. The scheme is analyzed in a time-varying binary block erasure channel model and secrecy outage probabilities are derived and empirically evaluated. The scheme is implemented over an IEEE 802.15.4-enabled Sun SPOT sensor motes. The results show that the proposed scheme achieves significant secrecy gains with a vanishing outage probability, at the expense of slight decrease in throughput, even when the eavesdropper is equipped with a receive power based classifier and is located too close to the transmitter node.

International Conference on Communications•Jun 1, 2011•6 citations

The Two Way Wiretap Channel: Theory and Practice

Aly El Gamal, O. Ozan Koyluoglu, Moustafa A. Youssef +1 more

This work considers the two way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks; in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards to validate our theoretical analysis. Using this testbed, it is shown that one can exploit the two way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve. To the best of our knowledge, this is one of the first attempts aiming towards building practical secrecy protocols inspired by information theoretic principles.

•Jun 4, 2010•5 citations

An anti-eavesdrop transmission scheduling scheme based on maximizing secrecy outage probability in ad hoc networks

Wang Yajun, Liao Tongqing, Wang Chuanan

In this paper, we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations, where an eavesdropper attempts to intercept their transmissions. We propose an optimal transmission scheduling scheme to defend against the eavesdropper, where a source node having the highest secrecy rate is scheduled to access the wireless medium for transmitting to its destination in an opportunistic manner. To be specific, the secrecy rate between a pair of the source and destination in the presence of an eavesdropper varies temporally due to the wireless fading effect. The proposed optimal transmission scheduling scheme opportunistically selects a source node with the highest secrecy rate to transmit its data for the sake of maximizing the security of the ad hoc network against eavesdropping attacks. For comparison purposes, we also consider the conventional round-robin scheduling as a benchmark, where multiple source nodes take turns in accessing their shared wireless medium for transmitting to their respective destinations. We derive closed-form secrecy outage probability expressions of both the round-robin scheduling and the proposed optimal scheduling schemes over Rayleigh fading environments. Numerical results show that the proposed transmission scheduling scheme outperforms the conventional round-robin method in terms of its secrecy outage probability. Additionally, upon increasing the number of source-destination pairs, the secrecy outage probability of the round-robin scheme keeps unchanged, whereas the secrecy outage performance of the proposed transmission scheduling significantly improves, showing the security benefits of exploiting transmission scheduling for protecting wireless ad hoc networks against eavesdropping.

China Communications•Jan 1, 2016•6 citations

Achievable Secrecy Rate Regions for the Two-Way Wiretap Channel

Aly El Gamal, O. Ozan Koyluoglu, Moustafa A. Youssef +1 more

The two-way wiretap channel is considered in this paper. Two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, new achievable secrecy rate regions are obtained based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, the idea of randomized scheduling is introduced and shown to offer a significant gain in terms of the achievable secrecy sum-rate. A practical setup is further developed based on a near field wireless communication scenario, and it is shown that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.

IEEE Transactions on Information Theory•Sep 16, 2013•48 citations
We present a practical and provably-secure multinode communication scheme in the presence of a passive eavesdropper. The scheme is based on a random scheduling approach that hides the identity of the transmitter from the eavesdropper. This random scheduling leads to ambiguity at the eavesdropper with regard to the origin of the transmitted frame. Implementation of the scheme over Crossbow Telosb motes, equipped with CC2420 radio chips, shows that the scheme can achieve significant secrecy gain with vanishing outage probability. In addition, it has significant overhead advantage over direct extensions to two-nodes schemes. The technique also has the advantage of allowing inactive nodes to leverage sleep mode to further save energy.
We present a practical and provably-secure multinode communication scheme in the presence of a passive eavesdropper. The scheme is based on a random scheduling approach that hides the identity of the transmitter from the eavesdropper. This random scheduling leads to ambiguity at the eavesdropper with regard to the origin of the transmitted frame. Implementation of the scheme over Crossbow Telosb motes, equipped with CC2420 radio chips, shows that the scheme can achieve significant secrecy gain with vanishing outage probability. In addition, it has significant overhead advantage over direct extensions to two-nodes schemes. The technique also has the advantage of allowing inactive nodes to leverage sleep mode to further save energy.
In this paper, we present a practical and provably secure two-way wireless communication scheme in the presence of a passive eavesdropper. The scheme implements a randomized scheduling and power allocation mechanism, where each legitimate node transmits in random time slots and with random transmit power. Such randomization results in ambiguity at the eavesdropper with regard to the origin of each transmitted frame. The scheme is analyzed in a time-varying binary block erasure channel model and secrecy outage probabilities are derived and empirically evaluated. The scheme is implemented over an IEEE 802.15.4-enabled Sun SPOT sensor motes. The results show that the proposed scheme achieves significant secrecy gains with a vanishing outage probability, at the expense of slight decrease in throughput, even when the eavesdropper is equipped with a receive power based classifier and is located too close to the transmitter node.
This work considers the two way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks; in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards to validate our theoretical analysis. Using this testbed, it is shown that one can exploit the two way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve. To the best of our knowledge, this is one of the first attempts aiming towards building practical secrecy protocols inspired by information theoretic principles.
In this paper, we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations, where an eavesdropper attempts to intercept their transmissions. We propose an optimal transmission scheduling scheme to defend against the eavesdropper, where a source node having the highest secrecy rate is scheduled to access the wireless medium for transmitting to its destination in an opportunistic manner. To be specific, the secrecy rate between a pair of the source and destination in the presence of an eavesdropper varies temporally due to the wireless fading effect. The proposed optimal transmission scheduling scheme opportunistically selects a source node with the highest secrecy rate to transmit its data for the sake of maximizing the security of the ad hoc network against eavesdropping attacks. For comparison purposes, we also consider the conventional round-robin scheduling as a benchmark, where multiple source nodes take turns in accessing their shared wireless medium for transmitting to their respective destinations. We derive closed-form secrecy outage probability expressions of both the round-robin scheduling and the proposed optimal scheduling schemes over Rayleigh fading environments. Numerical results show that the proposed transmission scheduling scheme outperforms the conventional round-robin method in terms of its secrecy outage probability. Additionally, upon increasing the number of source-destination pairs, the secrecy outage probability of the round-robin scheme keeps unchanged, whereas the secrecy outage performance of the proposed transmission scheduling significantly improves, showing the security benefits of exploiting transmission scheduling for protecting wireless ad hoc networks against eavesdropping.
The two-way wiretap channel is considered in this paper. Two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, new achievable secrecy rate regions are obtained based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, the idea of randomized scheduling is introduced and shown to offer a significant gain in terms of the achievable secrecy sum-rate. A practical setup is further developed based on a near field wireless communication scenario, and it is shown that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.