Biblio
Filters: Keyword is universal hash functions [Clear All Filters]
.
2019. A Graph-Based Modular Coding Scheme Which Achieves Semantic Security. 2019 IEEE International Symposium on Information Theory (ISIT). :822–826.
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.