scientific article; zbMATH DE number 7564428
From MaRDI portal
Publication:5091780
DOI10.4230/LIPIcs.CCC.2019.28MaRDI QIDQ5091780
Publication date: 27 July 2022
Full work available at URL: https://arxiv.org/abs/1804.04005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Unnamed Item ⋮ Privacy amplification from non-malleable codes ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Unnamed Item ⋮ Lower bounds for matrix factorization ⋮ Explicit two-source extractors and resilient functions ⋮ Non-malleability against polynomial tampering
Cites Work
- Unnamed Item
- Non-malleable coding against bit-wise and split-state tampering
- Pseudorandom generators for space-bounded computation
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Randomness is linear in space
- Non-malleable Codes from Two-Source Extractors
- Privacy amplification with asymptotically optimal entropy loss
- Extractors for a constant number of polynomially small min-entropy independent sources
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- Non-malleable Reductions and Applications
- Capacity of non-malleable codes
- Kakeya Sets, New Mergers, and Old Extractors
- Local Correlation Breakers and Applications to Three-Source Extractors and Mergers
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Extractors
- Extractors with weak random seeds
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Key Agreement from Close Secrets over Unsecured Channels
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Privacy Amplification by Public Discussion
- Non-Malleable Codes
- Explicit Resilient Functions Matching Ajtai-Linial
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
- An Entropy Lower Bound for Non-Malleable Extractors
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Pseudorandom generators for width-3 branching programs
- Non-malleable codes from additive combinatorics
- Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Non-malleable extractors and codes, with their many tampered extensions
- Extractors for sumset sources
- Explicit two-source extractors and resilient functions
- Non-malleable extractors: new tools and improved constructions
- Design extractors, non-malleable condensers and privacy amplification
- Advances in Cryptology - CRYPTO 2003
- Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification
- Privacy Amplification and Nonmalleable Extractors Via Character Sums
- New independent source extractors with exponential improvement
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Some remarks on the theory of graphs
- Simulating independence
- Four-state non-malleable codes with explicit constant rate
This page was built for publication:
