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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
