We consider the communication scenario where a source-destination pair wishes to keep information secret from relay node despite wanting enlist its help. For this scenario, an interesting question is whether should be deployed at all. That is, cooperation with untrusted can ever beneficial. first provide achievable secrecy rate for general channel, and proceed investigate two types of networks orthogonal components. model, there link source relay. second destination. we find equivocation...

Wireless communications systems are particularly vulnerable to security attacks because of the inherent openness transmission medium. In this article, we focus on guaranteeing confidentiality against eavesdropping where an unauthorized entity aims intercept ongoing wireless communication, and provide a comprehensive summary recent advances in area physical-layer that guarantees by using cooperative techniques unique These consist carefully designed coding signaling schemes able harness...

We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation from node is essential, we investigate whether achieving non-zero secrecy rate possible. Specifically, treat as eavesdropper whom source information needs to be kept secret, despite fact its in relaying needed. find positive indeed achievable, with aid of destination or external jams relay, i.e., by cooperative...

Recent results have shown that structured codes can be used to construct good channel codes, source and physical layer network for Gaussian channels. For channels with secrecy constraints, however, efforts date rely on random codes. In this paper, we advocate structure in code generation is useful providing as well. particular, a wiretap the presence of cooperative jammer studied. Previously, achievable rate was derived using signaling, which saturated at high signal-to-noise ratio (SNR),...

We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The node is willing to employ designated relaying scheme facilitate reliable communication between the source and destination. Yet, information it relays needs be kept secret from it. In this two-hop scenario, where use of essential, we find positive secrecy rate achievable. center piece achievability help provided by either destination with transmission capability, or external "good...

We consider a Gaussian two-hop network where the source and destination can communicate only via relay node who is both an eavesdropper Byzantine adversary. Both nodes are allowed to transmit, receives superposition of their transmitted signals. propose new coding scheme that satisfies two requirements simultaneously: message must be kept secret from node, able detect any attack might launch reliably fast. The three main components proposed nested lattice code, privacy amplification scheme,...

Recent results have shown that structured codes can be used to construct good channel codes, source and physical layer network for Gaussian channels. For channels with secrecy constraints, however, efforts date rely on random codes. In this work, we advocate are useful providing secrecy, show how compute the rate when used. particular, solve problem of bounding equivocation rates one important class i.e., nested lattice Having established result, next demonstrate use in two-user prove a...

A two-transmitter Gaussian multiple access wiretap channel with antennas at each of the nodes is investigated. The matrices legitimate users are fixed and revealed to all terminals, whereas eavesdropper arbitrarily varying only known eavesdropper. secrecy degrees freedom (s.d.o.f.) region under a strong constraint characterized. transmission scheme that orthogonalizes transmit signals two intended receiver, uses single-user code for user, shown achieve s.d.o.f. region. converse involves...

In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel state completely unknown to legitimate parties. particular, Gaussian MIMO wiretap considered, can vary from one use next, and overall sequence known only eavesdropper. When has fewer antennas than transmitter its intended receiver, positive rate in sense strong proved be achievable shown match with converse secure degrees freedom. This yields conclusion that communication possible...

A multi-hop line network is considered, where each node can receive signals transmitted by its two neighbors. As such, the model embodies both interference and broadcast aspects of wireless networks. The leftmost wishes to send messages rightmost node, while keeping these confidential from all intermediate relay nodes. In this setting any or nodes be eavesdroppers, it shown that end-to-end secure reliable communication possible. Notably, an secrecy rate independent number hops, i.e.,...

Cloud and edge computing have been widely adopted in many application scenarios. With the increasing demand of fast iteration complexity business logic, it is challenging to achieve rapid development continuous delivery such highly distributed cloud environment. At present, microservice-based architecture has dominant deployment style, a microservice system evolve agilely offer stable Quality Service (QoS) situation where user requirement changes frequently. A lot research conducted...

Microservices along with cloud-edge computing technologies are widely adopted to take advantage of the abundant resources cloud and low latency, high bandwidth capabilities edge. However, factors such as frequent user requirement changes have made current deployment scheme not fully adaptable new requirements, resulting in an increase average response time. Therefore, microservice system needs adjust online continuously changing requirements reduce time, which is known collaborative problem....

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to legitimate parties. particular, MIMO wiretap models considered arbitrarily varying over time. Assuming that number antennas limited, rate in sense strong derived, and shown match with converse secure degrees freedom. It proved there exists universal coding scheme secures confidential message against any sequence experienced by eavesdropper. This yields...

Most practical communication links are bidirectional. In these models, since the source node also receives signals, its encoder has option of computing output based on signals it received in past. On other hand, from a point view, would be desirable to identify cases where such an design may not improve rates. This question is particularly interesting for case transmitted messages and feedback subject eavesdropping. this paper, we investigate how much impact secrecy capacity by studying two...

Recent results have shown that lattice codes can be used to construct good channel codes, source and physical layer network for Gaussian channels. On the other hand, channels with secrecy constraints, efforts date rely on random codes. In this work, we provide a tool bridge these two areas so rate computed when are used. particular, address problem of bounding equivocation rates under nonlinear modulus operation is present in encoders/decoders. The technique then demonstrated examples: (1)...

In this work, we consider achievable secrecy rates for symmetric $K$-user ($K \ge 3$) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing these channels. Achievable derived very strong interference. addition, derive the secure degrees of freedom a range channel parameters. As by-product our approach, also demonstrate K-user without constraints they yield higher than previous results.

The many-to-one interference channel has received interest by virtue of embodying the essence an network while being more tractable than general <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -user channel. In this paper, we introduce information theoretic secrecy to model and consider with confidential messages, in which each receiver, particular, one subject interference, is also from interfering users' messages need be kept secret from....

In this work, we derive new outer bounds for the two-user interference channel with confidential messages. An upper bound is found sum rate. When interfering link of first user greater than 1, a on 2R <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> + R xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> obtained by studying special form three-user channel. The are then compared known symmetric under strong regime. particular, examples...

We consider the secrecy rate of a relay network where an eavesdropper is co-located with node. This exemplifies scenario node not malicious by nature, but located in "untrusted region", and hence potentially compromised. Given that aim now to keep completely oblivious information sent from source destination, interesting question whether should be deployed at all. investigate this for two types networks orthogonal components. For first model, we find equivocation capacity region prove...

In this work, we prove that a positive secure degree of freedom is achievable for large class real Gaussian channels as long the channel not degraded and fully connected. This includes MAC wiretap channel, 2-user interference with confidential messages, an external eavesdropper. Best known schemes to date these use signaling. show structured codes outperform random at high SNR when gains are numbers.

We consider a three node network in which pair of nodes with stochastic arrivals communicate each other the help an intermediate relay. The bi-directional nature traffic, this setting, poses new energy delay trade-off. Namely, relay may choose to cache packets from one direction and send it only after arrive, using XOR coding scheme. Doing so would save energy, but also incur some for packet. In work, we analyze trade-off when queues uses first-come-first-serve policy. show that under even...

The interplay between different modalities can help to perceive stimuli more effectively. However, very few studies have focused on how multisensory distractors affect task performance. By adopting behavioral and event-related potentials (ERPs) techniques, the present study examined whether audiovisual could attract attention effectively than unisensory distractors. Moreover, we explored such a process was modulated by working memory load. Across three experiments, n-back tasks (1-back...