Technical Program

Paper Detail

Paper Title Security Analysis of Compressed Encryption With Sparse Matrices Against Chosen Plaintext Attacks
Paper IdentifierFR3.R4.4
Authors Wonwoo Cho, Nam Yul Yu, Gwangju Institute of Science and Technology, Korea (South)
Session Compressed Sensing II
Location Odéon, Level 3
Session Time Friday, 12 July, 14:30 - 16:10
Presentation Time Friday, 12 July, 15:30 - 15:50
Manuscript  Click here to download the manuscript
Abstract In this paper, we study the security of a compressed sensing (CS) based cryptosystem that encrypts a plaintext with a sparse measurement matrix. The secret matrix is constructed by a bipolar keystream and a random permutation, and renewed at each encryption. The CS-based cryptosystem performs efficient encryption with a small number of nonzero entries in the matrix, and guarantees reliable decryption for a legitimate recipient. Through a quantitative analysis, we demonstrate that the CS-based cryptosystem achieves the security against a chosen plaintext attack (CPA) with overwhelmingly high probability, by showing that an adversary needs to distinguish a prohibitively large number of candidate keystreams.