The emerging use of multi-homed wireless devices along with simultaneous multi-path data transfer offers tremendous potentials to improve the capacity of multi-hop wireless networks. The use of simultaneous data trans...
详细信息
The emerging use of multi-homed wireless devices along with simultaneous multi-path data transfer offers tremendous potentials to improve the capacity of multi-hop wireless networks. The use of simultaneous data transfer over separate disjoint paths in multi-hop wireless networks to increase network capacity is a less explored subject, mainly because of the challenges it triggers for the reliable transport layer protocols. Reliable transport layer protocols generally use packet sequence number as a mean to ensure delivery. As such, the out-of-order packet arrival in reliable transport layer protocols triggers receiver buffer blocking that causes throughput degradation and prevents the reliable multi-path transport layer protocol to realize its vast potential. This paper focuses on integrating network coding with a reliable multi-path transport layer protocol to resolve the receiver buffer blocking problem. We propose an adaptive network coding mechanism to desensitize the receiver against packet reordering and consequently eliminate the receiver buffer blocking problem. Our state-of-the-art network coding scheme uses a combination of Q-learning and logistic regression for rare data events to control the number of redundant packets based on the network dynamics. We confirmed the veracity of our proposed scheme by a queuing theory based mathematical model. Moreover, the effectiveness of the proposed scheme is demonstrated through simulations and testbed experiments.
We propose to incorporate encryption procedure into the lossy compression of voice data PCM(Pulse Code Modulation) based on the A-law approximation quantization. The proposed codec CPCM (Chaotic Pulse Code Modulaion) ...
详细信息
We propose to incorporate encryption procedure into the lossy compression of voice data PCM(Pulse Code Modulation) based on the A-law approximation quantization. The proposed codec CPCM (Chaotic Pulse Code Modulaion) will join the encryption to the compression of the voice data. This scheme provides the same compression ratio given by the PCM codec, but with an unintelligible content. Comparisons with many used schemes have been made to highlight the proposed method in terms of security and rapidity. CPCM codec can be a better alternative to Compress-then-encrypt classical methods which is a time and resource consuming and non suitable for real-time multimedia secure transmission.
Invented in the 1960s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications, especially flash memory....
详细信息
Invented in the 1960s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications, especially flash memory. In 2011 a polynomial time algorithm called linear programming (LP) decoding was introduced for a class of permutation codes where the feasible set of codewords was a subset of the vertex set of a code polytope. In this paper we investigate a new class of linear constraints for matrix polytopes with no fractional vertices through a new concept called "consolidation." We then introduce a necessary and sufficient condition for which LP decoding methods, originally designed for the Euclidean metric, may be extended to provide an efficient decoding algorithm for permutation codes with the Kendall tau metric.
The book presents theory and algorithms for secure networked inference in the presence of Byzantines. It derives fundamental limits of networked inference in the presence of Byzantine data and designs robust strategie...
详细信息
ISBN:
(数字)9789811323126
ISBN:
(纸本)9789811323119
The book presents theory and algorithms for secure networked inference in the presence of Byzantines. It derives fundamental limits of networked inference in the presence of Byzantine data and designs robust strategies to ensure reliable performance for several practical network architectures. In particular, it addresses inference (or learning) processes such as detection, estimation or classification, and parallel, hierarchical, and fully decentralized (peer-to-peer) system architectures. Furthermore, it discusses a number of new directions and heuristics to tackle the problem of design complexity in these practical network architectures for inference.
This book explains the fundamental concepts of informationtheory, so as to help students better understand modern communication technologies. It was especially written for electrical and communication engineers worki...
详细信息
ISBN:
(数字)9789811084324
ISBN:
(纸本)9789811084317
This book explains the fundamental concepts of informationtheory, so as to help students better understand modern communication technologies. It was especially written for electrical and communication engineers working on communication subjects. The book especially focuses on the understandability of the topics, and accordingly uses simple and detailed mathematics, together with a wealth of solved examples. The book consists of four chapters, the first of which explains the entropy and mutual information concept for discrete random variables. Chapter 2 introduces the concepts of entropy and mutual information for continuous random variables, along with the channel capacity. In turn, Chapter 3 is devoted to the typical sequences and data compression. One of Shannons most important discoveries is the channel coding theorem, and it is critical for electrical and communication engineers to fully comprehend the theorem. As such, Chapter 4 solely focuses on it. To gain the most from the book, readers should have a fundamental grasp of probability and random variables; otherwise, they will find it nearly impossible to understand the topics discussed.
The H. 264 Advanced Video coding (H. 264/AVC) standard is considered to be the most commonly used format for video compression. Although it supports a very broad applications range covering all forms of digital compre...
详细信息
ISBN:
(纸本)9781509043149
The H. 264 Advanced Video coding (H. 264/AVC) standard is considered to be the most commonly used format for video compression. Although it supports a very broad applications range covering all forms of digital compressed video, the confidentiality of the encoded content needs enhancements. The present work proposes a new selective encryption scheme with multiple security levels. In fact, depending on the encrypted coefficients nature, five different cryptographic scenarios are proposed. They provide an effective confidentiality and deal with the real-time processing requirements. The Hardware/Software co-simulation and the experimental results proved the efficiency of the proposed crypto-system that will be suitable for real-time video applications and resource-limited systems.
The access control problem in a hierarchy can be solved by using a hierarchical key assignment scheme, where each class is assigned an encryption key and some private information. A formal security analysis for hierar...
详细信息
The access control problem in a hierarchy can be solved by using a hierarchical key assignment scheme, where each class is assigned an encryption key and some private information. A formal security analysis for hierarchical key assignment schemes has been traditionally considered in two different settings, i.e., the unconditionally secure and the computationally secure setting, and with respect to two different notions: security against key recovery (KR-security) and security with respect to key indistinguishability (KI-security), with the latter notion being cryptographically stronger. Recently, Freire, Paterson and Poettering proposed strong key indistinguishability (SKI-security) as a new security notion in the computationally secure setting, arguing that SKI-security is strictly stronger than KI-security in such a setting. In this paper we consider the unconditionally secure setting for hierarchical key assignment schemes. In such a setting the security of the schemes is not based on specific unproven computational assumptions, i.e., it relies on the theoretical impossibility of breaking them, despite the computational power of an adversary coalition. We prove that, in this setting, SKI-security is not stronger than KI-security, i.e., the two notions are fully equivalent from an information-theoretic point of view.
This book presents two practical physical attacks. It shows how attackers can reveal the secret key of symmetric as well as asymmetric cryptographic algorithms based on these attacks, and presents countermeasures on t...
详细信息
ISBN:
(数字)9789812877871
ISBN:
(纸本)9789812877864;9789812877871
This book presents two practical physical attacks. It shows how attackers can reveal the secret key of symmetric as well as asymmetric cryptographic algorithms based on these attacks, and presents countermeasures on the software and the hardware level that can help to prevent them in the future. Though their theory has been known for several years now, since neither attack has yet been successfully implemented in practice, they have generally not been considered a serious threat. In short, their physical attack complexity has been overestimated and the implied security threat has been underestimated. First, the book introduces the photonic side channel, which offers not only temporal resolution, but also the highest possible spatial resolution. Due to the high cost of its initial implementation, it has not been taken seriously. The work shows both simple and differential photonic side channel analyses. Then, it presents a fault attack against pairing-based cryptography. Due to the need for at least two independent precise faults in a single pairing computation, it has not been taken seriously either. Based on these two attacks, the book demonstrates that the assessment of physical attack complexity is error-prone, and as such cryptography should not rely on it. Cryptographic technologies have to be protected against all physical attacks, whether they have already been successfully implemented or not. The development of countermeasures does not require the successful execution of an attack but can already be carried out as soon as the principle of a side channel or a fault attack is sufficiently understood.
暂无评论