skip to content

Department of Computer Science and Technology

Date: 
Tuesday, 21 May, 2024 - 11:00 to 12:00
Speaker: 
Noam Mazor (Tel-Aviv University)
Venue: 
Computer Laboratory, William Gates Building, Room FS07

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.

Joint work with Iftach Haitner and Jad Silbak.

Seminar series: 
Algorithms and Complexity Seminar

Upcoming seminars