Information Theoretic Security for Shannon Cipher System under Side-Channel Attacks †
| Autor: | Yasutada Oohama, Bagus Santoso |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
strong converse theorem
one helper source coding problem Theoretical computer science Computer science General Physics and Astronomy Shannon cipher system lcsh:Astrophysics 02 engineering and technology Data_CODINGANDINFORMATIONTHEORY Encryption 01 natural sciences Article 010305 fluids & plasmas Physical information 0103 physical sciences Secrecy Ciphertext lcsh:QB460-466 0202 electrical engineering electronic engineering information engineering information theoretic security Side channel attack lcsh:Science business.industry side-channel attacks 020206 networking & telecommunications Computer security model Information-theoretic security lcsh:QC1-999 Cipher lcsh:Q business lcsh:Physics |
| Zdroj: | Entropy, Vol 21, Iss 5, p 469 (2019) Entropy Volume 21 Issue 5 |
| ISSN: | 1099-4300 |
| Popis: | 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 public communication channel but is also allowed to collect the physical information leaked by the devices where the cipher system is implemented on, such as running time, power consumption, electromagnetic radiation, etc. Our model is very robust as it does not depend on the kind of physical information leaked by the devices. We also prove that in the case of one-time pad encryption, we can strengthen the secrecy/security of the cipher system by using an appropriate affine encoder. More precisely, we prove that for any distribution of the secret keys and any measurement device used for collecting the physical information, we can derive an achievable rate region for reliability and security such that if we compress the ciphertext using an affine encoder with a rate within the achievable rate region, then: (1) anyone with a secret key will be able to decrypt and decode the ciphertext correctly, but (2) any adversary who obtains the ciphertext and also the side physical information will not be able to obtain any information about the hidden source as long as the leaked physical information is encoded with a rate within the rate region. We derive our result by adapting the framework of the one helper source coding problem posed and investigated by Ahlswede and Kö rner (1975) and Wyner (1975). For reliability and security, we obtain our result by combining the result of Csizá r (1982) on universal coding for a single source using linear codes and the exponential strong converse theorem of Oohama (2015) for the one helper source coding problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |