A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds
[article]
2021
arXiv
pre-print
A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm. We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis. We give a general reduction transforming a dynamic algorithm
arXiv:2111.03980v1
fatcat:ovd2fifhjvdurjqtpgosnc3nb4