Improved non-malleable extractors, non-malleable codes and independent source extractors
From MaRDI portal
Publication:4978054
DOI10.1145/3055399.3055486zbMath1370.94527arXiv1608.00127OpenAlexW2964292782MaRDI QIDQ4978054
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.00127
privacycodingrandomness extractionnon-malleable codesnon-malleable extractorsindependent source extractors
Related Items
Non-malleable codes for bounded parallel-time tampering ⋮ Improved computational extractors and their applications ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Practical continuously non-malleable randomness encoders in the random oracle model ⋮ An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Interactive non-malleable codes ⋮ Privacy amplification from non-malleable codes ⋮ Distinct degrees and homogeneous sets ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Unnamed Item ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Unnamed Item ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Unnamed Item ⋮ Distinct degrees in induced subgraphs ⋮ Continuously non-malleable codes with split-state refresh ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Four-state non-malleable codes with explicit constant rate ⋮ Low error efficient computational extractors in the CRS model ⋮ Unnamed Item ⋮ Multi-source non-malleable extractors and applications ⋮ Explicit two-source extractors and resilient functions ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs ⋮ Non-malleability against polynomial tampering ⋮ Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
