Every randomized Boolean function admits a supersimulator that fools polynomially larger distinguishers, yielding a tighter characterization of when product distributions are computationally indistinguishable.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Supersimulators
Every randomized Boolean function admits a supersimulator that fools polynomially larger distinguishers, yielding a tighter characterization of when product distributions are computationally indistinguishable.