Incompressiblity and Next-Block Pseudoentropy

Iftach Haitner; Noam Mazor; Jad Silbak

doi:10.4230/LIPIcs.ITCS.2023.66

Incompressiblity and Next-Block Pseudoentropy

Iftach Haitner, Noam Mazor, Jad Silbak

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A distribution is k-incompressible, Yao [FOCS'82], if no efficient compression scheme compresses it to less than k bits. While being a natural measure, its relation to other computational analogs of entropy such as pseudoentropy, Hastad, Impagliazzo, Levin, and Luby [SICOMP'99], and to other cryptographic hardness assumptions, was unclear. We advance towards a better understating of this notion, showing that a k-incompressible distribution has (k − 2) bits of next-block pseudoentropy, a refinement of pseudoentropy introduced by Haitner, Reingold, and Vadhan [SICOMP'13]. We deduce that a samplable distribution X that is (H(X) + 2)-incompressible, implies the existence of one-way functions.

Original language	English
Title of host publication	14th Innovations in Theoretical Computer Science Conference, ITCS 2023
Editors	Yael Tauman Kalai
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959772631
DOIs	https://doi.org/10.4230/LIPIcs.ITCS.2023.66
State	Published - 1 Jan 2023
Externally published	Yes
Event	14th Innovations in Theoretical Computer Science Conference, ITCS 2023 - Cambridge, United States Duration: 10 Jan 2023 → 13 Jan 2023

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	251
ISSN (Print)	1868-8969

Conference

Conference	14th Innovations in Theoretical Computer Science Conference, ITCS 2023
Country/Territory	United States
City	Cambridge
Period	10/01/23 → 13/01/23

Bibliographical note

Publisher Copyright:
© Iftach Haitner, Noam Mazor, and Jad Silbak; licensed under Creative Commons License CC-BY 4.0.

Keywords

incompressibility
next-block pseudoentropy
sparse languages

ASJC Scopus subject areas

Software

Access to Document

10.4230/LIPIcs.ITCS.2023.66

Cite this

Haitner, I., Mazor, N., & Silbak, J. (2023). Incompressiblity and Next-Block Pseudoentropy. In Y. T. Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference, ITCS 2023 Article 66 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 251). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2023.66

@inproceedings{2c641ed112b34fe88eaf557a39890ab5,

title = "Incompressiblity and Next-Block Pseudoentropy",

abstract = "A distribution is k-incompressible, Yao [FOCS'82], if no efficient compression scheme compresses it to less than k bits. While being a natural measure, its relation to other computational analogs of entropy such as pseudoentropy, Hastad, Impagliazzo, Levin, and Luby [SICOMP'99], and to other cryptographic hardness assumptions, was unclear. We advance towards a better understating of this notion, showing that a k-incompressible distribution has (k − 2) bits of next-block pseudoentropy, a refinement of pseudoentropy introduced by Haitner, Reingold, and Vadhan [SICOMP'13]. We deduce that a samplable distribution X that is (H(X) + 2)-incompressible, implies the existence of one-way functions.",

keywords = "incompressibility, next-block pseudoentropy, sparse languages",

author = "Iftach Haitner and Noam Mazor and Jad Silbak",

note = "Publisher Copyright: {\textcopyright} Iftach Haitner, Noam Mazor, and Jad Silbak; licensed under Creative Commons License CC-BY 4.0.; 14th Innovations in Theoretical Computer Science Conference, ITCS 2023 ; Conference date: 10-01-2023 Through 13-01-2023",

year = "2023",

month = jan,

day = "1",

doi = "10.4230/LIPIcs.ITCS.2023.66",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Kalai, \{Yael Tauman\}",

booktitle = "14th Innovations in Theoretical Computer Science Conference, ITCS 2023",

address = "Germany",

}

Haitner, I, Mazor, N & Silbak, J 2023, Incompressiblity and Next-Block Pseudoentropy. in YT Kalai (ed.), 14th Innovations in Theoretical Computer Science Conference, ITCS 2023., 66, Leibniz International Proceedings in Informatics, LIPIcs, vol. 251, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, Cambridge, United States, 10/01/23. https://doi.org/10.4230/LIPIcs.ITCS.2023.66

Incompressiblity and Next-Block Pseudoentropy. / Haitner, Iftach; Mazor, Noam; Silbak, Jad.
14th Innovations in Theoretical Computer Science Conference, ITCS 2023. ed. / Yael Tauman Kalai. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2023. 66 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 251).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Incompressiblity and Next-Block Pseudoentropy

AU - Haitner, Iftach

AU - Mazor, Noam

AU - Silbak, Jad

N1 - Publisher Copyright: © Iftach Haitner, Noam Mazor, and Jad Silbak; licensed under Creative Commons License CC-BY 4.0.

PY - 2023/1/1

Y1 - 2023/1/1

N2 - A distribution is k-incompressible, Yao [FOCS'82], if no efficient compression scheme compresses it to less than k bits. While being a natural measure, its relation to other computational analogs of entropy such as pseudoentropy, Hastad, Impagliazzo, Levin, and Luby [SICOMP'99], and to other cryptographic hardness assumptions, was unclear. We advance towards a better understating of this notion, showing that a k-incompressible distribution has (k − 2) bits of next-block pseudoentropy, a refinement of pseudoentropy introduced by Haitner, Reingold, and Vadhan [SICOMP'13]. We deduce that a samplable distribution X that is (H(X) + 2)-incompressible, implies the existence of one-way functions.

AB - A distribution is k-incompressible, Yao [FOCS'82], if no efficient compression scheme compresses it to less than k bits. While being a natural measure, its relation to other computational analogs of entropy such as pseudoentropy, Hastad, Impagliazzo, Levin, and Luby [SICOMP'99], and to other cryptographic hardness assumptions, was unclear. We advance towards a better understating of this notion, showing that a k-incompressible distribution has (k − 2) bits of next-block pseudoentropy, a refinement of pseudoentropy introduced by Haitner, Reingold, and Vadhan [SICOMP'13]. We deduce that a samplable distribution X that is (H(X) + 2)-incompressible, implies the existence of one-way functions.

KW - incompressibility

KW - next-block pseudoentropy

KW - sparse languages

UR - https://www.scopus.com/pages/publications/85147547284

U2 - 10.4230/LIPIcs.ITCS.2023.66

DO - 10.4230/LIPIcs.ITCS.2023.66

M3 - Conference contribution

AN - SCOPUS:85147547284

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 14th Innovations in Theoretical Computer Science Conference, ITCS 2023

A2 - Kalai, Yael Tauman

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 14th Innovations in Theoretical Computer Science Conference, ITCS 2023

Y2 - 10 January 2023 through 13 January 2023

ER -

Incompressiblity and Next-Block Pseudoentropy

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this