Non-malleability against polynomial tampering
From MaRDI portal
Publication:2102059
Recommendations
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Non-malleable codes for bounded parallel-time tampering
- Non-malleable codes
Cites work
- scientific article; zbMATH DE number 4069000 (Why is no real title available?)
- scientific article; zbMATH DE number 1186969 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3664349 (Why is no real title available?)
- scientific article; zbMATH DE number 1942425 (Why is no real title available?)
- scientific article; zbMATH DE number 2124957 (Why is no real title available?)
- A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
- Almost-uniform sampling of points on high-dimensional algebraic varieties
- Capacity of non-malleable codes
- Deterministic extractors for affine sources over large fields
- Explicit two-source extractors and resilient functions
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Extracting Randomness Using Few Independent Sources
- Extractor Codes
- Extractors and rank extractors for polynomial sources
- Extractors for varieties
- Four-state non-malleable codes with explicit constant rate
- From single-bit to multi-bit public-key encryption via non-malleable codes
- How to share a secret
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Linear degree extractors and the inapproximability of max clique and chromatic number
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Maximum distance<tex>q</tex>-nary codes
- Non-Malleable Codes from Additive Combinatorics
- Non-malleability against polynomial tampering
- Non-malleable codes
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Non-malleable codes for bounded depth, bounded fan-in circuits
- Non-malleable codes from two-source extractors
- Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
- Non-malleable extractors and codes, with their many tampered extensions
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Non-malleable randomness encoders and their applications
- Non-malleable reductions and applications
- Non-malleable secret sharing
- Non-malleable secret sharing for general access structures
- On Some Exponential Sums
- On the construction of affine extractors
- Polynomial Codes Over Certain Finite Fields
- Privacy Amplification by Public Discussion
- Probabilistic Algorithms in Finite Fields
- Randomness is linear in space
- Revisiting non-malleable secret sharing
- Textbook non-malleable commitments
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Cited in
(8)- Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Non-malleable codes against bounded polynomial time tampering
- (Nondeterministic) hardness vs. non-malleability
- Non-malleable codes with optimal rate for poly-size circuits
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Non-malleability against polynomial tampering
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
This page was built for publication: Non-malleability against polynomial tampering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102059)
