TY - GEN
T1 - Message partitioning and limited auxiliary randomness
T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016
AU - Ghassami, Amiremad
AU - Cullina, Daniel
AU - Kiyavash, Negar
N1 - Funding Information:
This work was in part supported by MURI grant ARMY W911NF-15-1-0479 and NSF grant CCF 10-54937-CAREER
Publisher Copyright:
© 2016 IEEE.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2016/8/10
Y1 - 2016/8/10
N2 - In a symmetric-key cryptography system, it is often required to transmit a nonuniform message from a very large set. In this case, a computationally unbounded adversary can take advantage of the non-uniformity of the posterior to recover the message. Recently an encryption scheme called Honey Encryption has been proposed to increase the information-theoretic security of the system, i.e., guaranteed level of security regardless of the computational power of the adversary. In this paper, we present a technique called message partitioning which can be used to accomplish the same goal. We analyze the overall security of the combination of this technique with Honey Encryption, which uses a Distribution Transforming Encoder (DTE) block. We propose a new DTE which has an acceptable performance under limited amount of available auxiliary randomness. Achievable bounds are presented for both cases, which under certain conditions, are close to the lower bounds on the level of the success of the adversary.
AB - In a symmetric-key cryptography system, it is often required to transmit a nonuniform message from a very large set. In this case, a computationally unbounded adversary can take advantage of the non-uniformity of the posterior to recover the message. Recently an encryption scheme called Honey Encryption has been proposed to increase the information-theoretic security of the system, i.e., guaranteed level of security regardless of the computational power of the adversary. In this paper, we present a technique called message partitioning which can be used to accomplish the same goal. We analyze the overall security of the combination of this technique with Honey Encryption, which uses a Distribution Transforming Encoder (DTE) block. We propose a new DTE which has an acceptable performance under limited amount of available auxiliary randomness. Achievable bounds are presented for both cases, which under certain conditions, are close to the lower bounds on the level of the success of the adversary.
UR - http://www.scopus.com/inward/record.url?scp=84985993717&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84985993717&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2016.7541523
DO - 10.1109/ISIT.2016.7541523
M3 - Conference contribution
AN - SCOPUS:84985993717
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1371
EP - 1375
BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 10 July 2016 through 15 July 2016
ER -