
Inaccessible Entropy II: IE Functions and Universal OneWay Hashing
This paper uses a variant of the notion of inaccessible entropy (Haitner...
read it

Unifying computational entropies via KullbackLeibler divergence
We introduce KLhardness, a new notion of hardness for search problems w...
read it

Entropy, neutroentropy and antientropy for neutrosophic information
This approach presents a multivalued representation of the neutrosophic...
read it

SpatEntropy: Spatial Entropy Measures in R
This article illustrates how to measure the heterogeneity of spatial dat...
read it

Genericity and Rigidity for Slow Entropy Transformations
The notion of slow entropy, both upper and lower slow entropy, was defin...
read it

On Oneway Functions and Kolmogorov Complexity
We prove that the equivalence of two fundamental problems in the theory ...
read it

Randen  fast backtrackingresistant random generator with AES+Feistel+Reverie
Algorithms that rely on a pseudorandom number generator often lose their...
read it
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from OneWay Functions
We put forth a new computational notion of entropy, measuring the (in)feasibility of sampling highentropy 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 polynomialtime 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 oneway functions.
READ FULL TEXT
Comments
There are no comments yet.