NDLI: Universal Secure Network Coding via Rank-Metric Codes

Content Provider	IEEE Xplore Digital Library
Author	Silva, D. Kschischang, F.R.
Copyright Year	1963
Abstract	The problem of securing a network coding communication system against an eavesdropper is considered. The network implements linear network coding to deliver n packets from source to each receiver, and the adversary can eavesdrop on μ arbitrarily chosen links. The objective is to provide reliable communication to all receivers, while guaranteeing that the source information remains information-theoretically secure from the adversary. A coding scheme is proposed that can achieve the maximum possible rate of n - μ packets. The scheme, which is based on rank-metric codes, has the distinctive property of being universal: it can be applied on top of any communication network without requiring knowledge of or any modifications on the underlying linear network code. The only requirement of the scheme is that the packet length be at least n, which is shown to be strictly necessary for universal communication at the maximum rate. A further scenario is considered where the adversary is allowed not only to eavesdrop but also to inject up to t erroneous packets into the network, and the network may suffer from a rank deficiency of at most ρ. In this case, the proposed scheme can be extended to achieve the rate of n - ρ - 2t - μ packets. This rate is shown to be optimal under the assumption of zero-error communication.
Sponsorship	IEEE Information Theory Society
Starting Page	1124
Ending Page	1135
Page Count	12
File Size	278694
File Format	PDF
ISSN	00189448
Volume Number	57
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Receivers Encoding Network coding Security Error correction Decoding Measurement wiretap channel information-theoretic security linear network coding rank-metric codes secrecy capacity
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes

Secure Network Coding for Wiretap Networks of Type II

Exact Correct-Decoding Exponent of the Wiretap Channel Decoder

Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

On Secure Network Coding With Nonuniform or Restricted Wiretap Sets

Secrecy Capacity Region of Some Classes of Wiretap Broadcast Channels

An Information Theoretic Approach to Secret Sharing

Imperfect Secrecy in Wiretap Channel II

Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels

Universal Secure Network Coding via Rank-Metric Codes

Similar Documents

Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes

Secure Network Coding for Wiretap Networks of Type II

Exact Correct-Decoding Exponent of the Wiretap Channel Decoder

Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

On Secure Network Coding With Nonuniform or Restricted Wiretap Sets

Secrecy Capacity Region of Some Classes of Wiretap Broadcast Channels

An Information Theoretic Approach to Secret Sharing

Imperfect Secrecy in Wiretap Channel II

Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels

Universal Secure Network Coding via Rank-Metric Codes