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

@article{Oohama2018InformationTS, title={Information Theoretic Security for Side-Channel Attacks to the Shannon Cipher System}, author={Yasutada Oohama and Bagus Santoso}, journal={ArXiv}, year={2018}, volume={abs/1801.02563} }

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\"orner(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…

## 6 Citations

### Information Theoretical Analysis of Side-Channel Attacks to the Shannon Cipher System

- Computer Science, Mathematics2018 IEEE International Symposium on Information Theory (ISIT)
- 2018

The one helper source coding problem posed and investigated by Ahlswede, Korner, and Wyner is investigated to derive new secrecy bounds and a coupling of the result Watanabe and Oohama(2012) obtained on bounded storage eavesdropper with the exponential strong converse theorem OOHama(2015) established for the one helper sources coding problem is derived.

### Information Theoretic Security for Broadcasting of Two Encrypted Sources under Side-Channel Attacks †

- Computer Science, MathematicsEntropy
- 2019

A countermeasure against an adversary which launches side-channel attacks in the presence of an adversary by using the post-encryption-compression (PEC) paradigm, in the case of one-time-pad encryption is proposed.

### Secure Broadcasting of Two Encrypted Sources under Side-Channel Attacks

- Computer Science, Mathematics2019 IEEE International Symposium on Information Theory (ISIT)
- 2019

A theoretical framework to solve the secure communication problem of broadcasting of two encrypted sources against an adversary which launches side-channel attacks is proposed and a countermeasure based on the post-encryption-compression paradigm is proposed.

### Improving security of 5G networks with multiplicative masking method for LDPC codes

- Computer ScienceComput. Electr. Eng.
- 2021

### Exponential Strong Converse for One Helper Source Coding Problem †

- Computer ScienceEntropy
- 2019

It is proved that the error probability of decoding tends to one exponentially and an explicit lower bound of this exponent function is derived.

### Information Theoretic Security for Shannon Cipher System under Side-Channel Attacks †

- Computer Science, MathematicsEntropy
- 2019

In this paper, we propose a new theoretical security model for Shannon cipher systems under side-channel attacks, where the adversary is not only allowed to collect ciphertexts by eavesdropping the…

## References

SHOWING 1-9 OF 9 REFERENCES

### Privacy amplification theorem for bounded storage eavesdropper

- Computer Science, Mathematics2012 IEEE Information Theory Workshop
- 2012

A privacy amplification theorem is shown for a situation such that legitimate parties share an identical source to generate a secret key, and an eavesdropper can access a correlated data that is stored in a storage with bounded size.

### Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification

- Computer ScienceIEEE Transactions on Information Theory
- 2011

An exponential upper bound is derived for Eve's information in secret key generation from a common random number without communication based on the Rényi entropy of order 2 and is applied to secret key agreement by public discussion.

### Linear codes for sources and source networks: Error exponents, universal coding

- Computer ScienceIEEE Trans. Inf. Theory
- 1982

For Slepian-Wolf source networks, the error exponents obtained by Korner,Marton, and the author are shown to be universally attainable by linear codes also. Improved exponents are derived for linear…

### Universal coding for the Slepian-Wolf data compression system and the strong converse theorem

- Computer ScienceIEEE Trans. Inf. Theory
- 1994

It is demonstrated based on a simple observation that the error exponent given by Csiszar and Korner (1980) for the universal coding system can strictly be sharpened in general for a region of relatively higher rates.

### Exponent function for one helper source coding problem at rates outside the rate region

- Computer Science, Mathematics2015 IEEE International Symposium on Information Theory (ISIT)
- 2015

A much stronger version of the strong converse theorem for the one helper source coding problem is provided, proving that the error probability of decoding tends to one exponentially and derive an explicit lower bound of this exponent function.

### Source coding with side information and a converse for degraded broadcast channels

- Computer ScienceIEEE Trans. Inf. Theory
- 1975

In Section H of the paper, a characterization of the capacity region for degraded broadcast channels (DBC's) is given, which was conjectured by Bergmans and is somewhat sharper than the one obtained by Gallager.

### On source coding with side information at the decoder

- Computer ScienceIEEE Trans. Inf. Theory
- 1975

The characterization of the family of rate triples (R_0,R_1, R_2) for which this system can deliver essentially perfect reproductions of X and Y and the principal result is a characterization of this family via an information-theoretic minimization.

### Information Theory

- Political ScienceNature
- 1962

Information TheoryPapers read at a Symposium on Information Theory held at the Royal Institution, London, August 29th to September 2nd, 1960. Edited by Colin Cherry. Pp. xi + 476. (London:…

### Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition

- Computer Science
- 2011

This new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics.