Technical Program

Paper Detail

Paper Title A Graph-Based Modular Coding Scheme Which Achieves Semantic Security
Paper IdentifierTU1.R8.2
Authors Moritz Wiese, Holger Boche, Technical University of Munich, Germany
Session Codes for Privacy and Wiretap Channels
Location Conseil, Level 5
Session Time Tuesday, 09 July, 09:50 - 11:10
Presentation Time Tuesday, 09 July, 10:10 - 10:30
Manuscript  Click here to download the manuscript
Abstract It is investigated how to achieve semantic security for the wiretap channel. A new type of functions called biregular irreducible (BRI) functions, similar to universal hash functions, is introduced. BRI functions provide a universal method of establishing secrecy. It is proved that the known secrecy rates of any discrete and Gaussian wiretap channel are achievable with semantic security by modular wiretap codes constructed from a BRI function and an error-correcting code. A characterization of BRI functions in terms of edge-disjoint biregular graphs on a common vertex set is derived. This is used to study examples of BRI functions and to construct new ones.