English
Related papers

Related papers: Universal Secure Error-Correcting Schemes for Netw…

200 papers

This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast…

Information Theory · Computer Science 2019-01-10 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

In this paper, we consider how the uplink transmission of a spatially correlated massive multiple-input multiple-output (MIMO) system can be protected from a jamming attack. To suppress the jamming, we propose a novel framework including a…

Information Theory · Computer Science 2020-03-02 Hossein Akhlaghpasand , Emil Björnson , S. Mohammad Razavizadeh

Silva et al. proposed a universal secure network coding scheme based on MRD codes, which can be applied to any underlying network code. This paper considers a stronger eavesdropping model where the eavesdroppers possess the ability to…

Information Theory · Computer Science 2010-11-03 Eitaro Shioji , Ryutaroh Matsumoto , Tomohiko Uyematsu

Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits…

Cryptography and Security · Computer Science 2016-11-17 Joao P. Vilela , Luisa Lima , Joao Barros

In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of…

Information Theory · Computer Science 2016-11-17 Mohammad Mahdi Mojahedian , Mohammad Reza Aref , Amin Gohari

This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors…

Information Theory · Computer Science 2013-01-15 Wentao Huang , Tracey Ho , Hongyi Yao , Sidharth Jaggi

In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent…

Information Theory · Computer Science 2011-11-09 Ryutaroh Matsumoto , Masahito Hayashi

This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…

Information Theory · Computer Science 2011-02-09 Hung D. Ly , Tie Liu , Yufei Blankenship

Physical layer security has recently been regarded as an emerging technique to complement and improve the communication security in future wireless networks. The current research and development in physical layer security is often based on…

Information Theory · Computer Science 2013-10-02 Biao He , Xiangyun Zhou

In this paper, an anti-eavesdropping estimation problem is investigated. A linear encryption scheme is utilized, which first linearly transforms innovation via an encryption matrix and then encrypts some components of the transformed…

Systems and Control · Electrical Eng. & Systems 2024-06-18 Zhongyao Hu , Bo Chen , Pindi Weng , Jianzheng Wang , Li Yu

Random jammers that overpower transmitted signals are a practical concern for many wireless communication protocols. As such, wireless receivers must be able to cope with standard channel noise and jamming (intentional or unintentional). To…

Information Theory · Computer Science 2023-01-25 Furkan Ercan , Kevin Galligan , David Starobinski , Muriel Medard , Ken R. Duffy , Rabia Tugce Yazicigil

Index coding is concerned with efficient broadcast of a set of messages to receivers in the presence of receiver side information. In this paper, we study the secure index coding problem with security constraints on the receivers…

Information Theory · Computer Science 2020-04-16 Yucheng Liu , Parastoo Sadeghi , Neda Aboutorab , Arman Sharififar

This paper studies the secrecy rate maximization problem of a secure wireless communication system, in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming, with the help of…

Information Theory · Computer Science 2017-01-13 Kanapathippillai Cumanan , George C. Alexandropoulos , Zhgiuo Ding , George K. Karagiannidis

We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols yet are assumed to be potential eavesdroppers (i.e. "nice but curious").…

Information Theory · Computer Science 2007-07-13 Luísa Lima , Muriel Médard , João Barros

We investigate the problem of reliable communication between two legitimate parties over deletion channels under an active eavesdropping (aka jamming) adversarial model. To this goal, we develop a theoretical framework based on…

Machine Learning · Statistics 2018-04-12 Shahab Asoodeh , Yi Huang , Ishanu Chattopadhyay

We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The network consists of a set of bidirectional primary path connections that carry the…

Information Theory · Computer Science 2010-09-02 Shizheng Li , Aditya Ramamoorthy

We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes…

Quantum Physics · Physics 2020-01-28 Seunghoan Song , Masahito Hayashi

In the paradigm of network coding, the information-theoretic security problem is encountered in the presence of a wiretapper, who has capability of accessing an unknown channel-subset in communication networks. In order to combat this…

Information Theory · Computer Science 2016-11-28 Xuan Guang

In secure network coding, there is a possibility that the eavesdropper can improve her performance when she changes (contaminates) the information on the attacked edges (active attack) and chooses the attacked edges adaptively (adaptive…

Information Theory · Computer Science 2024-09-10 Ning Cai , Masahito Hayashi

We study the index coding problem in the presence of an eavesdropper, where the aim is to communicate without allowing the eavesdropper to learn any single message aside from the messages it may already know as side information. We…

Information Theory · Computer Science 2018-09-12 Yuxin Liu , Badri N. Vellambi , Young-Han Kim , Parastoo Sadeghi