Non-malleability against polynomial tampering

DOI10.1007/978-3-030-56877-1_4OpenAlexW3013329636MaRDI QIDQ2102059FDOQ2102059

Authors: Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_4

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

Authentication, digital signatures and secret sharing (94A62) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

How to share a secret
Polynomial Codes Over Certain Finite Fields
Title not available (Why is that?)
Title not available (Why is that?)
On Some Exponential Sums
Linear degree extractors and the inapproximability of max clique and chromatic number
Privacy Amplification by Public Discussion
Non-malleable codes
Maximum distance<tex>q</tex>-nary codes
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Extractor Codes
Probabilistic Algorithms in Finite Fields
Randomness is linear in space
MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
On the construction of affine extractors
Extractors for varieties
Deterministic extractors for affine sources over large fields
Extractors and rank extractors for polynomial sources
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
Title not available (Why is that?)
Non-malleable codes from two-source extractors
Capacity of non-malleable codes
Non-malleable reductions and applications
Non-malleable extractors and symmetric key cryptography from weak secrets
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
Non-malleable extractors and codes, with their many tampered extensions
Extracting Randomness Using Few Independent Sources
Non-malleable codes for bounded depth, bounded fan-in circuits
Title not available (Why is that?)
Non-malleable secret sharing for general access structures
Revisiting non-malleable secret sharing
Non-malleable secret sharing
Title not available (Why is that?)
Improved non-malleable extractors, non-malleable codes and independent source extractors
Textbook non-malleable commitments
Non-malleable randomness encoders and their applications
Explicit two-source extractors and resilient functions
Non-malleable extractors and non-malleable codes: partially optimal constructions
Non-malleability against polynomial tampering
Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
Title not available (Why is that?)
Non-Malleable Codes from Additive Combinatorics
Non-malleable codes and extractors for small-depth circuits, and affine functions
Almost-uniform sampling of points on high-dimensional algebraic varieties
Four-state non-malleable codes with explicit constant rate

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
(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
Non-malleability against polynomial tampering

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)