scientific article; zbMATH DE number 7250163
From MaRDI portal
Publication:5121911
DOI10.4230/LIPIcs.CCC.2018.23zbMath1441.68069MaRDI QIDQ5121911
Jiapeng Zhang, Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan
Publication date: 22 September 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- On the impossibility of entropy reversal, and its application to zero-knowledge proofs
- On relationships between statistical zero-knowledge proofs
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- Universal One-Way Hash Functions via Inaccessible Entropy
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- A Pseudorandom Generator from any One-way Function
- Inaccessible entropy
- On the Randomness of Independent Experiments
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- An Equivalence Between Zero Knowledge and Commitments
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Theory of Cryptography
This page was built for publication:
