Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs
Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs
A novel type of functions called biregular irreducible functions is introduced and applied as security components (instead of, e.g., universal hash functions) in seeded modular wiretap coding schemes, whose second component is an error-correcting code. These schemes are called modular BRI schemes. An upper bound on the semantic security information …