On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream

Abstract The principle of compressed sensing (CS) can be applied in a cryptosystem by providing the notion of security. In this paper, we study the computational security of a CS-based cryptosystem that encrypts a plaintext with a partial unitary sensing matrix embedding a secret keystream. The keys...

Full description

Bibliographic Details
Main Author: Nam Yul Yu
Format: Article
Language:English
Published: SpringerOpen 2017-10-01
Series:EURASIP Journal on Advances in Signal Processing
Subjects:
Online Access:http://link.springer.com/article/10.1186/s13634-017-0508-6
id doaj-81a188eb36224204815a29fce828e019
record_format Article
spelling doaj-81a188eb36224204815a29fce828e0192020-11-24T21:45:45ZengSpringerOpenEURASIP Journal on Advances in Signal Processing1687-61802017-10-012017111810.1186/s13634-017-0508-6On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystreamNam Yul Yu0School of Electrical Engineering and Computer Science, Gwangju Institute of Science and Technology (GIST)Abstract The principle of compressed sensing (CS) can be applied in a cryptosystem by providing the notion of security. In this paper, we study the computational security of a CS-based cryptosystem that encrypts a plaintext with a partial unitary sensing matrix embedding a secret keystream. The keystream is obtained by a keystream generator of stream ciphers, where the initial seed becomes the secret key of the CS-based cryptosystem. For security analysis, the total variation distance, bounded by the relative entropy and the Hellinger distance, is examined as a security measure for the indistinguishability. By developing upper bounds on the distance measures, we show that the CS-based cryptosystem can be computationally secure in terms of the indistinguishability, as long as the keystream length for each encryption is sufficiently large with low compression and sparsity ratios. In addition, we consider a potential chosen plaintext attack (CPA) from an adversary, which attempts to recover the key of the CS-based cryptosystem. Associated with the key recovery attack, we show that the computational security of our CS-based cryptosystem is brought by the mathematical intractability of a constrained integer least-squares (ILS) problem. For a sub-optimal, but feasible key recovery attack, we consider a successive approximate maximum-likelihood detection (SAMD) and investigate the performance by developing an upper bound on the success probability. Through theoretical and numerical analyses, we demonstrate that our CS-based cryptosystem can be secure against the key recovery attack through the SAMD.http://link.springer.com/article/10.1186/s13634-017-0508-6Compressed encryptionHellinger distanceIndistinguishabilityInteger least-squares (ILS) problemRelative entropyTotal variation distance
collection DOAJ
language English
format Article
sources DOAJ
author Nam Yul Yu
spellingShingle Nam Yul Yu
On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream
EURASIP Journal on Advances in Signal Processing
Compressed encryption
Hellinger distance
Indistinguishability
Integer least-squares (ILS) problem
Relative entropy
Total variation distance
author_facet Nam Yul Yu
author_sort Nam Yul Yu
title On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream
title_short On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream
title_full On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream
title_fullStr On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream
title_full_unstemmed On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream
title_sort on the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream
publisher SpringerOpen
series EURASIP Journal on Advances in Signal Processing
issn 1687-6180
publishDate 2017-10-01
description Abstract The principle of compressed sensing (CS) can be applied in a cryptosystem by providing the notion of security. In this paper, we study the computational security of a CS-based cryptosystem that encrypts a plaintext with a partial unitary sensing matrix embedding a secret keystream. The keystream is obtained by a keystream generator of stream ciphers, where the initial seed becomes the secret key of the CS-based cryptosystem. For security analysis, the total variation distance, bounded by the relative entropy and the Hellinger distance, is examined as a security measure for the indistinguishability. By developing upper bounds on the distance measures, we show that the CS-based cryptosystem can be computationally secure in terms of the indistinguishability, as long as the keystream length for each encryption is sufficiently large with low compression and sparsity ratios. In addition, we consider a potential chosen plaintext attack (CPA) from an adversary, which attempts to recover the key of the CS-based cryptosystem. Associated with the key recovery attack, we show that the computational security of our CS-based cryptosystem is brought by the mathematical intractability of a constrained integer least-squares (ILS) problem. For a sub-optimal, but feasible key recovery attack, we consider a successive approximate maximum-likelihood detection (SAMD) and investigate the performance by developing an upper bound on the success probability. Through theoretical and numerical analyses, we demonstrate that our CS-based cryptosystem can be secure against the key recovery attack through the SAMD.
topic Compressed encryption
Hellinger distance
Indistinguishability
Integer least-squares (ILS) problem
Relative entropy
Total variation distance
url http://link.springer.com/article/10.1186/s13634-017-0508-6
work_keys_str_mv AT namyulyu onthesecurityofcompressedencryptionwithpartialunitarysensingmatricesembeddingasecretkeystream
_version_ 1725904519618887680