On the Security of Key-Based Interval Splitting Arithmetic Coding With Respect to Message Indistinguishability
| Autor: | R.S. Katti, Aida Vosoughi |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Theoretical computer science
Computer Networks and Communications Computer science business.industry Semantics (computer science) Cryptography Interval (mathematics) Encryption Arithmetic coding law.invention law Arithmetic Safety Risk Reliability and Quality business Cryptanalysis Semantic security |
| Zdroj: | IEEE Transactions on Information Forensics and Security. 7:895-903 |
| ISSN: | 1556-6021 1556-6013 |
| DOI: | 10.1109/tifs.2012.2187514 |
| Popis: | Key-based interval splitting arithmetic coding (KSAC) has been proposed to improve the security of traditional arithmetic coding (AC). Chosen-plaintext attacks have been proposed for KSAC when the same key is used to encrypt different messages. In this paper, we consider a stronger version of KSAC, where different keys are used to encrypt different messages. We then use message indistinguishability to prove that this version of KSAC is insecure under ciphertext-only attacks, a weaker form of attack than chosen-plaintext attacks. Indistinguishability in the presence of an eavesdropper is a security definition equivalent to semantic security. We prove the insecurity over the alphabet {A,B} with pB=(1/2(1+2s)) and pA=1-pB where pA and pB are the probabilities of the source generating A and B, respectively, and s is the number of bits in each splitting key. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|