اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدInterference-Assisted Secret Communication
120
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Wireless communication is susceptible to adversarial eavesdropping due to the broadcast nature of the wireless medium. In this paper it is shown how eavesdropping can be alleviated by exploiting the superposition property of the wireless medium. A wiretap channel with a helping interferer (WT-HI), in which a transmitter sends a confidential message to its intended receiver in the presence of a passive eavesdropper, and with the help of an independent interferer, is considered. The interferer, which does not know the confidential message, helps in ensuring the secrecy of the message by sending independent signals. An achievable secrecy rate for the WT-HI is given. The results show that interference can be exploited to assist secrecy in wireless communications. An important example of the Gaussian case, in which the interferer has a better channel to the intended receiver than to the eavesdropper, is considered. In this situation, the interferer can send a (random) codeword at a rate that ensures that it can be decoded and subtracted from the received signal by the intended receiver but cannot be decoded by the eavesdropper. Hence, only the eavesdropper is interfered with and the secrecy level of the confidential message is increased.
قيم البحث
اقرأ أيضاً
Wireless communication is susceptible to eavesdropping attacks because of its broadcast nature. This paper illustrates how interference can be used to counter eavesdropping and assist secrecy. In particular, a wire-tap channel with a helping interfer
er (WT-HI) is considered. Here, a transmitter sends a confidential message to its intended receiver in the presence of a passive eavesdropper and with the help of an independent interferer. The interferer, which does not know the confidential message, helps in ensuring the secrecy of the message by sending an independent signal. An achievable secrecy rate and several computable outer bounds on the secrecy capacity of the WT-HI are given for both discrete memoryless and Gaussian channels.
The unique information ($UI$) is an information measure that quantifies a deviation from the Blackwell order. We have recently shown that this quantity is an upper bound on the one-way secret key rate. In this paper, we prove a triangle inequality fo
r the $UI$, which implies that the $UI$ is never greater than one of the best known upper bounds on the two-way secret key rate. We conjecture that the $UI$ lower bounds the two-way rate and discuss implications of the conjecture.
We consider an extension of Masseys construction of secret sharing schemes using linear codes. We describe the access structure of the scheme and show its connection to the dual code. We use the $g$-fold weight enumerator and invariant theory to study the access structure.
Full-duplex (FD) communication is regarded as a key technology in future 5G and Internet of Things (IoT) systems. In addition to high data rate constraints, the success of these systems depends on the ability to allow for confidentiality and security
. Secret-key agreement from reciprocal wireless channels can be regarded as a valuable supplement for security at the physical layer. In this work, we study the role of FD communication in conjunction with secret-key agreement. We first introduce two complementary key generation models for FD and half-duplex (HD) settings and compare the performance by introducing the key-reconciliation function. Furthermore, we study the impact of the so called probing-reconciliation trade-off, the role of a strong eavesdropper and analyze the system in the high SNR regime. We show that under certain conditions, the FD mode enforces a deteriorating impact on the capabilities of the eavesdropper and offers several advantages in terms of secret-key rate over the conventional HD setups. Our analysis reveals as an interesting insight that perfect self-interference cancellation is not necessary in order to obtain performance gains over the HD mode.
In this paper, we study the problem of distributed multi-user secret sharing, including a trusted master node, $Nin mathbb{N}$ storage nodes, and $K$ users, where each user has access to the contents of a subset of storage nodes. Each user has an ind
ependent secret message with certain rate, defined as the size of the message normalized by the size of a storage node. Having access to the secret messages, the trusted master node places encoded shares in the storage nodes, such that (i) each user can recover its own message from the content of the storage nodes that it has access to, (ii) each user cannot gain any information about the message of any other user. We characterize the capacity region of the distributed multi-user secret sharing, defined as the set of all achievable rate tuples, subject to the correctness and privacy constraints. In the achievable scheme, for each user, the master node forms a polynomial with the degree equal to the number of its accessible storage nodes minus one, where the value of this polynomial at certain points are stored as the encoded shares. The message of that user is embedded in some of the coefficients of the polynomial. The remaining coefficients are determined such that the content of each storage node serves as the encoded shares for all users that have access to that storage node.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
