Inaccessible entropy
From MaRDI portal
Publication:5172756
DOI10.1145/1536414.1536497zbMath1304.94014OpenAlexW2914021656MaRDI QIDQ5172756
Omer Reingold, Hoeteck Wee, Iftach Haitner, Salil P. Vadhan
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536497
computational complexitycryptographyzero knowledgeone-way functionscommitment schemesinteractive hashing
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Measures of information, entropy (94A17)
Related Items (8)
Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Simple constructions from (almost) regular one-way functions ⋮ A new interactive hashing theorem ⋮ Computational fuzzy extractors ⋮ How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge ⋮ Unnamed Item ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ The Many Entropies in One-Way Functions
This page was built for publication: Inaccessible entropy
