Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISNETCOD.2011.5979076
DC FieldValue
dc.titleSecure multiplex network coding
dc.contributor.authorMatsumoto, R.
dc.contributor.authorHayashi, M.
dc.date.accessioned2016-09-01T07:17:53Z
dc.date.available2016-09-01T07:17:53Z
dc.date.issued2011
dc.identifier.isbn9781612841403
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/126351
dc.description.abstractIn 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 messages to be kept secret from an eavesdropper. The proposed scheme is an adaptation of Yamamoto et al.'s secure multiplex coding to the secure network coding. © 2011 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISNETCOD.2011.5979076
dc.sourceScopus
dc.subjectinformation theoretic security
dc.subjectnetwork coding
dc.subjectsecure multiplex coding
dc.subjectsecure network coding
dc.typeConference Paper
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.description.doi10.1109/ISNETCOD.2011.5979076
dc.description.sourcetitle2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings
dc.description.page-
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.