Visible to the public A Graph-Based Modular Coding Scheme Which Achieves Semantic Security

TitleA Graph-Based Modular Coding Scheme Which Achieves Semantic Security
Publication TypeConference Paper
Year of Publication2019
AuthorsWiese, Moritz, Boche, Holger
Conference Name2019 IEEE International Symposium on Information Theory (ISIT)
Date Publishedjul
ISBN Number978-1-5386-9291-2
Keywordsbiregular irreducible functions, BRI function, channel coding, coding theory, composability, compositionality, cryptography, discrete Gaussian wiretap channel, edge-disjoint biregular graphs, Eigenvalues and eigenfunctions, encoding, error correction codes, error-correcting code, Gaussian channels, graph theory, graph-based modular coding scheme, modular wiretap codes, pubcrawl, Random variables, Receivers, security, semantic security, Semantics, telecommunication security, theoretical cryptography, universal hash functions

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.

Citation Keywiese_graph-based_2019