The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Secure data transfer is often achieved by encryption. However, if transmitting across a Binary Symmetric Channel while an eavesdropper listens via a Wiretap Channel, the difference in signal quality can be exploited to improve the inherent transmission secrecy. If this exploitation involves the managed use of erasures, then the secrecy of a code transmitted across the channel can be improved whilst...
Cyber crime is the biggest shortcoming in this fully connected internetworking world. Third party attacks, phishing by intruder like hackers are always active to leak official, personal or legislative information in the form of a message using this public networks. This is why we call for Steganography where the sneaky message has been hiding the data/information firmly. Steganography is one of the...
Graph mining is widely used in fields like social network analysis. The synchronous vertex-centric frameworks strike better balance between the performance and ease-of-use, so they are widely used in realistic. However, traditional architectures of this type, like the vertex-based push architecture and GAS, are encumbered by high communication costs. In this paper we proposed a new replica-based push...
For enhancing spectrum efficiency, in-band full-duplex technology is one of the candidate technical solution. But, self-interference (SI) signal causes dramatically degrade the performance. In practically, memory effect which cause harmonic in amplifier will be hard to be estimated. Therefore, we utilizes the dynamic regression (DR) to implement digital interference cancellation (DIC) for mitigate...
We consider a communication scenario in which the channel undergoes two different classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is modeled by the concept of arbitrarily varying wiretap channels (AVWCs), in which the channel varies from one channel use to the other in an unknown and arbitrary manner. It has been shown that uncorrelated codes fail to...
In mixed-criticality systems, resource management services are required to recognize and fulfill system wide high-level constraints, e.g., end-to-end deadlines. This is not possible through individual resources in isolation. Instead, a system-wide view is necessary which requires system-wide decisions. In the European FP7 project DREAMS, services for system-wide adaptability of mixed-criticality applications...
Fingerprint embedding at the physical layer is a demonstrably powerful technique for secure message authentication. In this article, we build upon the general framework for embedding physical layer fingerprints to create an authenticated side channel for minimal cost. The authentication is enabled with the use of a low-power tag superimposed upon the message waveform; the signaling over the side channel...
We consider covert communication using a queuing timing channel in the presence of a warden. The covert message is encoded using the inter-arrival times of the packets, and the legitimate receiver and the warden observe the inter-departure times of the packets from their respective queues. The transmitter and the legitimate receiver also share a secret key to facilitate covert communication. We propose...
Two polar coding schemes are proposed for the degraded broadcast channel under different reliability and secrecy requirements. In these settings, the transmitter wishes to send multiple messages to a set of legitimate receivers keeping them masked from a set of eavesdroppers, and individual channels are assumed to gradually degrade in such a way that each legitimate receiver has a better channel than...
A record of food intake contains information that is useful for health care. We propose a new method for obtaining food intake data using intra-body communication. In this system, a transmitter is attached to each dish, and signals are sent to a receiver via dishes, food, and cutlery; the human body is the medium connecting the transmitter and the receiver. A receiver can detect the moment when the...
This paper shows that the slope at each corner point of the capacity region of the general broadcast channel coincides with that of the randomized time division (hence the Marton) inner bound and the Nair-El Gamal (as well as the Körner-Marton) outer bound. We then show that the optimal superposition coding inner bound by Bandemer, El Gamal, and Kim can be simplified to the convex closure of the union...
Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple groupcast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly unpredictable and personalized nature of the content that users consume challenges the efficiency of existing caching-based solutions...
We consider the state dependent channels with full state information with at the sender and partial state information at the receiver. For this state dependent channel, the channel capacity under rate constraint on the state information at the decoder was determined by Steinberg. In this paper, we study the correct probability of decoding at rates above the capacity. We prove that when the transmission...
In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via a finite rate feedback on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper...
In this article, we propose low complexity transmitter and receiver architectures for Faster Than Nyquist communications. Both architectures are based on circular convolutions rather than linear convolutions. These circular architectures allow us to consider a turbo-equalization scheme based on linear MMSE equalization. We can consider low-values for the time compression factor without increasing...
This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn with high confidence whether the legitimate parties are using the channel to communicate or not. Specifically, the relative entropy between the output quantum states at the eavesdropper when a codeword is transmitted...
The large-system decoupling property of a MAP estimator is studied when it estimates the i.i.d. vector x from the observation y = Ax + z with A being chosen from a wide range of matrix ensembles, and the noise vector z being i.i.d. and Gaussian. Using the replica method, we show that the marginal joint distribution of any two corresponding input and output symbols converges to a deterministic distribution...
The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a private (non-confidential) message to User 2. The secrecy-capacity region is characterized by showing that certain inner and outer bounds coincide and that the boundary...
In this paper we consider the classical problem of blind deconvolution of multiple signals from its superposition, also called blind demixing and deconvolution. One is given a signal ∑ri=1 wi ∗ xi = y ∊ RL which is the superposition of r unknown source signals {xi}ri=1 and convolution kernels {wi}ri=1 The goal is to reconstruct the vectors w; and x;, which are elements of known but random subspaces...
Most of all organizations try to get more benefit by gathering and analyzing various data. These systems work well in profit-making organizations especially, In recent year, permanent voluntary organizations such as universities become to be active in order to know themselves. However, temporary voluntary organizations hardly have any such systems. Therefore, such organizations can not always make...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.