Welcome to the resource topic for 2025/1060
Title:
Uniform Black-Box Separations via Non-Malleable Extractors
Authors: Marshall Ball, Dana Dachman-Soled
Abstract:We construct t-non-malleable extractors—which allow an attacker to tamper with a source t times—for high min-entropy sources samplable by poly-time hierarchy circuits and for tampering classes corresponding to poly-time hierarchy functions from derandomization-type assumptions.
We then show an application of this new object to ruling out constructions of succinct, non-interactive, arguments (SNARGs) secure against \emph{uniform} adversaries from \emph{uniform} falsifiable assumptions via a class of black-box reductions that has not been previously considered in the literature. This class of black-box reductions allows the reduction to arbitrarily set the \emph{coins}, as well as the input, of the uniform adversary it interacts with.
The class of reductions we consider is restricted in allowing only non-adaptive queries to the adversary.
ePrint: https://eprint.iacr.org/2025/1060
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .