O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC 1987, pages 218-229, 1987.
I. Haitner, M. Nguyen, S. J. Ong, O. Reingold, and S. Vadhan. Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM Journal on Computing, 39(3):1153-1218, 2009.
M. Hardt and G. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In Proc. 51st Foundations of Computer Science (FOCS), pages 61-70. IEEE, 2010.
M. Hardt and J. Ullman. Preventing false discovery in interactive data analysis is hard. In *FOCS*, pages 454-463, 2014.
J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364-1396, 1999.
R. Impagliazzo. A personal view of average-case complexity. In Proceedings of the Tenth Annual Structure in Complexity Theory Conference, pages 134-147. IEEE Computer Society, 1995.
R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, FOCS 1989, pages 230-235, 1989.
R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In Annual ACM Symposium on Theory of Computing (STOC), pages 44-61, 1989.
C. Jung, K. Ligett, S. Neel, A. Roth, S. Sharifi-Malvajerdi, and M. Shenfeld. A new analysis of differential privacy's generalization guarantees. In ITCS, volume 151 of LIPics, pages 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
H. Kaplan, Y. Mansour, K. Nissim, and U. Stemmer. Separating adaptive streaming from oblivious streaming using the bounded storage model. In CRYPTO (3), volume 12827 of Lecture Notes in Computer Science, pages 94-121. Springer, 2021.
A. Kontorovich, M. Sadigurschi, and U. Stemmer. Adaptive data analysis with correlated observations. In ICML, volume 162 of Proceedings of Machine Learning Research, pages 11483-11498. PMLR, 2022.
M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373-386, 1988.
M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
K. Nissim, A. D. Smith, T. Steinke, U. Stemmer, and J. R. Ullman. The limits of post-selection generalization. In NeurIPS, pages 6402-6411, 2018.
R. M. Rogers, A. Roth, A. D. Smith, and O. Thakkar. Max-information, differential privacy, and post-selection hypothesis testing. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, pages 487-494, 2016.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Annual ACM Symposium on Theory of Computing (STOC), pages 387-394, 1990.
D. Russo and J. Zou. Controlling bias in adaptive data analysis using information theory. In Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, AISTATS 2016, volume 51, pages 1232-1240. JMLR.org, 2016.
A. Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology, Proceedings of CRYPTO 1984, volume 196, pages 47-53, 1984.
M. Shenfeld and K. Ligett. A necessary and sufficient stability notion for adaptive generalization. In NeurIPS, pages 11481-11490, 2019.