Information Theoretic Security for Side-Channel Attacks to the Shannon Cipher System

01/08/2018
by   Yasutada Oohama, et al.
0

We study side-channel attacks for the Shannon cipher system. To pose side channel-attacks to the Shannon cipher system, we regard them as a signal estimation via encoded data from two distributed sensors. This can be formulated as the one helper source coding problem posed and investigated by Ahlswede, Körner(1975), and Wyner(1975). We further investigate the posed problem to derive new secrecy bounds. Our results are derived by a coupling of the result Watanabe and Oohama(2012) obtained on bounded storage evasdropper with the exponential strong converse theorem Oohama(2015) established for the one helper source coding problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/02/2023

Universal Coding for Shannon Ciphers under Side-Channel Attacks

We study the universal coding under side-channel attacks posed and inves...
research
11/01/2022

Survey on Source-coding technique

Shannon separation theorem lays the foundation for traditional image com...
research
02/15/2010

Geometric approach to sampling and communication

Relationships that exist between the classical, Shannon-type, and geomet...
research
01/27/2022

Strong Converse Theorem for Source Encryption under Side-Channel Attacks

We are interested in investigating the security of source encryption wit...
research
09/11/2022

Towards Weak Source Coding

In this paper, the authors provide a weak decoding version of the tradit...
research
11/18/2018

Shannon meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer

We study the setting of channel coding over a family of channels whose s...
research
06/30/2023

On numerical realizations of Shannon's sampling theorem

In this paper, we discuss some numerical realizations of Shannon's sampl...

Please sign up or login with your details

Forgot password? Click here to reset