Universal secure network coding by non-linear secret key agreement

Chung Chan*

*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

2 Citations (Scopus)

Abstract

A non-linear secure network coding scheme is proposed where the secret is hidden by a non-linear function against any linear wiretappers. It is shown to achieve stronger notions of universality and security than linear secure network coding.
Original languageEnglish
Title of host publication2012 International Symposium on Network Coding (NetCod)
PublisherIEEE
Pages97-102
ISBN (Electronic)978-1-4673-1892-1
ISBN (Print)978-1-4673-1890-7
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 International Symposium on Network Coding, NetCod 2012 - Cambridge, MA, United States
Duration: 29 Jun 201230 Jun 2012

Conference

Conference2012 International Symposium on Network Coding, NetCod 2012
PlaceUnited States
CityCambridge, MA
Period29/06/1230/06/12

Fingerprint

Dive into the research topics of 'Universal secure network coding by non-linear secret key agreement'. Together they form a unique fingerprint.

Cite this