Non-malleability against polynomial tampering
From MaRDI portal
Publication:2102059
DOI10.1007/978-3-030-56877-1_4OpenAlexW3013329636MaRDI QIDQ2102059
Li-Yang Tan, Tal Malkin, Eshan Chattopadhyay, Jyun-Jie Liao, Marshall Ball
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_4
Authentication, digital signatures and secret sharing (94A62) Theory of error-correcting codes and error-detecting codes (94Bxx)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extractors and rank extractors for polynomial sources
- On the construction of affine extractors
- Non-malleable randomness encoders and their applications
- Non-malleable secret sharing for general access structures
- Randomness is linear in space
- Extractors for varieties
- Non-malleability against polynomial tampering
- Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
- Revisiting non-malleable secret sharing
- Explicit two-source extractors and resilient functions
- Deterministic extractors for affine sources over large fields
- Non-malleable Codes from Two-Source Extractors
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Non-malleable Reductions and Applications
- Capacity of non-malleable codes
- How to share a secret
- Polynomial Codes Over Certain Finite Fields
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Extractor Codes
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Privacy Amplification by Public Discussion
- Probabilistic Algorithms in Finite Fields
- Non-Malleable Codes
- Non-Malleable Codes from Additive Combinatorics
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Non-malleable secret sharing
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Non-malleable extractors and codes, with their many tampered extensions
- Textbook non-malleable commitments
- Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
- Privacy Amplification and Nonmalleable Extractors Via Character Sums
- Maximum distance<tex>q</tex>-nary codes
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
- Extracting Randomness Using Few Independent Sources
- On Some Exponential Sums
- Four-state non-malleable codes with explicit constant rate
