Log In Sign Up

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions

by   Iftach Haitner, et al.

We put forth a new computational notion of entropy, measuring the (in)feasibility of sampling high-entropy strings that are consistent with a given generator. Specifically, the i'th output block of a generator G has accessible entropy at most k if the following holds: when conditioning on its prior coin tosses, no polynomial-time strategy G can generate valid output for G's i'th output block with entropy greater than k. A generator has inaccessible entropy if the total accessible entropy (summed over the blocks) is noticeably smaller than the real entropy of G's output. As an application of the above notion, we improve upon the result of Haitner, Nguyen, Ong, Reingold, and Vadhan [Sicomp '09], presenting a much simpler and more efficient construction of statistically hiding commitment schemes from arbitrary one-way functions.


page 1

page 2

page 3

page 4


Inaccessible Entropy II: IE Functions and Universal One-Way Hashing

This paper uses a variant of the notion of inaccessible entropy (Haitner...

Unifying computational entropies via Kullback-Leibler divergence

We introduce KL-hardness, a new notion of hardness for search problems w...

Using the Dafermos Entropy Rate Criterion in Numerical Schemes

The following work concerns the construction of an entropy dissipative f...

Entropy, neutro-entropy and anti-entropy for neutrosophic information

This approach presents a multi-valued representation of the neutrosophic...

Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications

Pseudorandom quantum states (PRS) are efficiently constructible states t...

Genericity and Rigidity for Slow Entropy Transformations

The notion of slow entropy, both upper and lower slow entropy, was defin...

On typical encodings of multivariate ergodic sources

We show that the typical coordinate-wise encoding of multivariate ergodi...