Inaccessible entropy

Haitner, Iftach; Reingold, Omer; Vadhan, Salil; Wee, Hoeteck

doi:10.1145/1536414.1536497

Cited by 34 publications

(73 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This holds even if both parties are guaranteed to follow the protocol except for making additional queries to tokens in order to learn information about the other party's input. The proof of this negative result employs a variant of the recent notion of accessible entropy from [38] and has the following high level intuition: In the standard model without tokens, one way to explain why statistical OT is not possible is to consider the randomness r R of the receiver conditioned on the transcript τ of the protocol. If this conditional distribution reveals information about the receiver's choice b, then an unbounded sender can cheat by sampling from this distribution.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography

Goyal

Ishai

Mahmoody

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs for NP. We show that such protocols exist in the interactive PCP model of Kalai and Raz (ICALP '08), where one of the provers is replaced by a PCP oracle. This strengthens the feasibility result of Ben-Or, Goldwasser, Kilian, and Wigderson (STOC '88) which requires two stateful provers. In contrast to previous zero-knowledge PCPs of Kilian, Petrank, and Tardos (STOC '97), in our protocol both the prover and the PCP oracle are efficient given an NP witness.Our main technical tool is a new primitive that we call interactive locking, an efficient realization of an unconditionally secure commitment scheme in the interactive PCP model. We implement interactive locking by adapting previous constructions of interactive hashing protocols to our setting, and also provide a direct construction which uses a minimal amount of interaction and improves over our interactive hashing based constructions.Finally, we apply the above results towards showing the feasibility of basing unconditional cryptography on stateless tamper-proof hardware tokens, and obtain the following results. (1) We show that if tokens can be used to encapsulate other tokens, then there exist unconditional and statistically secure (in fact, UC secure) protocols for general secure

show abstract

Section: Introductionmentioning

confidence: 99%

“…If an OT protocol did have accessible entropy, then essentially the above impossibility argument would apply. (In contrast, the original definition of accessible entropy of [38] required that the parties could efficiently sample, since the focus in that work was on analyzing protocols secure against computationally bounded parties. )…”

Section: Introductionmentioning

confidence: 99%

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography

Goyal

Ishai

Mahmoody

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The notion of next-block pseudoentropy generators was inspired by the notion of inaccessible entropy generators in [13]. These are generators G that also produce m blocks (x 1 , .…”

Section: Relation To Inaccessible Entropymentioning

confidence: 99%

“…The key to our construction is a new notion of next-block pseudoentropy, which is inspired by the recently introduced notion of "inaccessible entropy" [13].…”

Section: Introductionmentioning

confidence: 99%

“…Entropy Equalization: Here we use a technique from [13] to convert our knowledge about the total entropy (summed over all blocks) into knowledge about the entropy in the individual take a totally different route (based on the"randomized iterate" of a function introduced by Goldreich et al [7]) and obtain constructions based on exponentially hard OWFs, as well as on (unknown-)regular OWFs.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Efficiency improvements in constructing pseudorandom generators from one-way functions

Haitner

Reingold

Vadhan

2010

Proceedings of the Forty-Second ACM Symposium on Theory of Computing

Self Cite

View full text Add to dashboard Cite

Distributional Collision Resistance Beyond One-Way Functions

Bitansky

Haitner

Komargodski

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Distributional collision resistance is a relaxation of collision resistance that only requires that it is hard to sample a collision (x, y) where x is uniformly random and y is uniformly random conditioned on colliding with x. The notion lies between one-wayness and collision resistance, but its exact power is still not well-understood. On one hand, distributional collision resistant hash functions cannot be built from one-way functions in a black-box way, which may suggest that they are stronger. On the other hand, so far, they have not yielded any applications beyond one-way functions.Assuming distributional collision resistant hash functions, we construct constant-round statistically hiding commitment scheme. Such commitments are not known based on one-way functions and are impossible to obtain from one-way functions in a black-box way. Our construction relies on the reduction from inaccessible entropy generators to statistically hiding commitments by Haitner et al. (STOC '09). In the converse direction, we show that two-message statistically hiding commitments imply distributional collision resistance, thereby establishing a loose equivalence between the two notions.A corollary of the first result is that constant-round statistically hiding commitments are implied by average-case hardness in the class SZK (which is known to imply distributional collision resistance). This implication seems to be folklore, but to the best of our knowledge has not been proven explicitly. We provide yet another proof of this implication, which is arguably more direct than the one going through distributional collision resistance.

show abstract

Inaccessible entropy

Cited by 34 publications

References 24 publications

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography

Efficiency improvements in constructing pseudorandom generators from one-way functions

Distributional Collision Resistance Beyond One-Way Functions

Contact Info

Product

Resources

About