OAK

Security Analysis of Compressed Encryption With Sparse Matrices Against Chosen Plaintext Attacks

Metadata Downloads
Author(s)
Cho, Wonwoo; Yu, Nam Yul
Type
Conference Paper
Citation
2019 IEEE International Symposium on Information Theory, ISIT 2019, pp.2858 - 2862
Issued Date
2019-07-12
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.
Publisher
Institute of Electrical and Electronics Engineers Inc.
Conference Place
FR
Paris, France
URI
https://scholar.gist.ac.kr/handle/local/22974
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.