Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption

Amiremad Ghassami, Daniel Cullina, Negar Kiyavash

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1371-1375
Number of pages5
ISBN (Electronic)9781509018062
DOIs
StatePublished - Aug 10 2016
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: Jul 10 2016Jul 15 2016

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2016-August
ISSN (Print)2157-8095

Other

Other2016 IEEE International Symposium on Information Theory, ISIT 2016
CountrySpain
CityBarcelona
Period7/10/167/15/16

Fingerprint

Randomness
Encryption
Cryptography
Partitioning
Encoder
Alternatives
Information-theoretic Security
Non-uniformity
Large Set
Security of data
Lower bound
Computer systems

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Ghassami, A., Cullina, D., & Kiyavash, N. (2016). Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 1371-1375). [7541523] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541523
Ghassami, Amiremad ; Cullina, Daniel ; Kiyavash, Negar. / Message partitioning and limited auxiliary randomness : Alternatives to Honey Encryption. Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 1371-1375 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{73bc12fefb714701ad0238682ef98def,
title = "Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption",
abstract = "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.",
author = "Amiremad Ghassami and Daniel Cullina and Negar Kiyavash",
year = "2016",
month = "8",
day = "10",
doi = "10.1109/ISIT.2016.7541523",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1371--1375",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
address = "United States",

}

Ghassami, A, Cullina, D & Kiyavash, N 2016, Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541523, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 1371-1375, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 7/10/16. https://doi.org/10.1109/ISIT.2016.7541523

Message partitioning and limited auxiliary randomness : Alternatives to Honey Encryption. / Ghassami, Amiremad; Cullina, Daniel; Kiyavash, Negar.

Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1371-1375 7541523 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Message partitioning and limited auxiliary randomness

T2 - Alternatives to Honey Encryption

AU - Ghassami, Amiremad

AU - Cullina, Daniel

AU - Kiyavash, Negar

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.

ER -

Ghassami A, Cullina D, Kiyavash N. Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc. 2016. p. 1371-1375. 7541523. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2016.7541523