Secure convertible codes protect data against partial eavesdropping
Constructions of Secure Convertible Codes
Information Theory
Summary
Sometimes, when sending secret information, an eavesdropper can sneak a peek at small parts of two related secret codes. This paper looks at special codes called secure convertible codes that keep information safe even if some pieces are seen. The authors build two types of these codes: one that works for all situations but needs big mathematical spaces, and another that is easier to use but works only in certain scenarios. These codes help keep data secure when it is changed or combined in specific ways.
What this means in practice
- •For data storage engineers: Implement systems that change encoded data formats securely without leaking partial information to eavesdroppers.
- •For network security teams: Design communication protocols that remain secure even if attackers access limited parts of data during format conversions.
Authors
Manasa Suresh B P, Vinayak Ramkumar, Myna Vajha
Abstract
Secure convertible codes, introduced by Zhang and Rashmi, achieve secrecy capacity under a passive eavesdropper model in which an eavesdropper is allowed to access any $\ell$ symbols from the initial and final codewords. In this paper, we construct two families of access-optimal secure convertible codes. The first family of codes based on Maximum Rank Distance (MRD) codes is constructed for all parameters in the merge and split regimes and requires a large field size. The second family of codes, constructed using Generalized Reed-Solomon codes, uses smaller fields but is applicable only for certain parameters in the merge and split regimes.