Data compression and secrecy by design
The unique characteristics of the IoT make it very challenging to provide adequate security primitives. The complexity of traditional cryptographic methods is an issue for IoT applications that have very stringent delay requirements. Moreover, in the context of the IoT, security requirements and the explicit applications have to be taken into account from the beginning of the protocol design. Motivated by these unique characteristics of the IoT systems, we
introduce the framework of secrecy by design as an approach to partial information-theoretic secrecy. The main idea behind secrecy by design is to begin with an operational secrecy constraint, which is modeled by a secrecy function, and then to derive fundamental limits for the performance of the resulting secrecy system. In the setting of lossless compression, we show that strong information-theoretic secrecy guarantees can be achieved using a reduced
secret key size and a modular two-part coding strategy. Moreover, the proposed two-part codes possess a universality property that has an immediate implication for secure inference. Time permitting, we will also discuss connections between secrecy by design and related
notions such as randomness extraction and common information.