Theory of Cryptography
From MaRDI portal
Publication:5898368
DOI10.1007/11681878zbMath1112.94012OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898368
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11681878
Related Items (19)
A New Pseudorandom Generator from Collision-Resistant Hash Functions ⋮ Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Simple constructions from (almost) regular one-way functions ⋮ Unnamed Item ⋮ Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Pseudorandom generators from regular one-way functions: new constructions with improved parameters ⋮ On the complexity of constructing pseudorandom functions (especially when they don't exist) ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ Unnamed Item ⋮ Cryptography with constant input locality ⋮ A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch ⋮ The Many Entropies in One-Way Functions
This page was built for publication: Theory of Cryptography
