Selected Publications

Selected Publications

Below are a selection of recent and featured publications. For a complete list of publications, view Prof. Dwork's Curriculum Vitae.

Some Recent Publications

2023

Dwork, C., O. Reingold, and G. N. Rothblum. “From the Real towards the Ideal: Risk Prediction in a Better World”. In 4th Symposium on Foundations of Responsible Computing (FORC 2023). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023.
Dwork, C., O. Reingold, and G. N. Rothblum. “From the Real towards the Ideal: Risk Prediction in a Better World”. In 4th Symposium on Foundations of Responsible Computing (FORC 2023). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023.
Dick, T., C. Dwork, M. Kearns, T. Liu, A. Roth, G. Vietri, and S.Wu. “Confidence-Ranked Reconstruction of Census Microdata from Published Statistics.”. Proceedings of the National Academy of Sciences.
Dick, T., C. Dwork, M. Kearns, T. Liu, A. Roth, G. Vietri, and S.Wu. “Confidence-Ranked Reconstruction of Census Microdata from Published Statistics.”. Proceedings of the National Academy of Sciences.
Dwork, C., D. Lee, H. Lin, and P. Tankala. “From Psuedorandomness to Multi-Group Fairness and Back”. Thirty-Sixth Annual Conference on Learning Theory (PMLR).
Dwork, C., D. Lee, H. Lin, and P. Tankala. “From Psuedorandomness to Multi-Group Fairness and Back”. Thirty-Sixth Annual Conference on Learning Theory (PMLR).

2021

Dwork, C., M. P. Kim, O. Reingold, G. N. Rothblum, and G. Yona. “Outcome Indistinguishability”. Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. ACM, 2021.
Dwork, C., M. P. Kim, O. Reingold, G. N. Rothblum, and G. Yona. “Outcome Indistinguishability”. Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. ACM, 2021.

Selected Additional Publications

2015

Dwork, C., F. Feldman, M. Hardt, T. Pitassi, O. Reingold, and A. L. Roth. “Preserving Statistical Validity in Adaptive Data Analysis”. Proceedings of the 47th Annual ACM Symposium on Theory of Computing. STOC , 2015.
Dwork, C., F. Feldman, M. Hardt, T. Pitassi, O. Reingold, and A. L. Roth. “Preserving Statistical Validity in Adaptive Data Analysis”. Proceedings of the 47th Annual ACM Symposium on Theory of Computing. STOC , 2015.

2013

Zemel, R., Y. Wu, K. Swersky, T. Pitassi, and C. Dwork. “Learning Fair Representations”. Proceedings of the 30th International Conference on Machine Learning (PMLR).
Zemel, R., Y. Wu, K. Swersky, T. Pitassi, and C. Dwork. “Learning Fair Representations”. Proceedings of the 30th International Conference on Machine Learning (PMLR).

2012

Dwork, C., M. Hardt, T. Pitassi, O. Reingold, and R. Zemel. “Fairness through Awareness”. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS 12).
Dwork, C., M. Hardt, T. Pitassi, O. Reingold, and R. Zemel. “Fairness through Awareness”. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS 12).

2006

Dwork, C., F. McSherry, K. Nissim, and A. Smith. “Calibrating Noise to Sensitivity in Private Data Analysis”. Theory of Cryptography Conference .
Dwork, C., F. McSherry, K. Nissim, and A. Smith. “Calibrating Noise to Sensitivity in Private Data Analysis”. Theory of Cryptography Conference .
Dwork, C. “Differential Privacy”. International Colloquium on Automata, Languages, and Programming. ICALP, 2006.
Dwork, C. “Differential Privacy”. International Colloquium on Automata, Languages, and Programming. ICALP, 2006.

2000

Dolev, D., C. Dwork, and M. Naor. “Non-Malleable Cryptography”. SIAM Journal on Computing 30, no. 2 (2000).
Dolev, D., C. Dwork, and M. Naor. “Non-Malleable Cryptography”. SIAM Journal on Computing 30, no. 2 (2000).

1997

Ajtai, M., and C. Dwork. “A Public-Key Cryptosystem With Worst-Case Average-Case Equivalence”. Proceedings of the 29th Annual ACM Symposium on Theory of Computing.
Ajtai, M., and C. Dwork. “A Public-Key Cryptosystem With Worst-Case Average-Case Equivalence”. Proceedings of the 29th Annual ACM Symposium on Theory of Computing.

1992

Dwork, C., and M. Naor. “Pricing via Processing or Combatting Junk Mail”. Advances in Cryptology: CRYPTO 1992. Annual International Cryptography Conference, 1992.
Dwork, C., and M. Naor. “Pricing via Processing or Combatting Junk Mail”. Advances in Cryptology: CRYPTO 1992. Annual International Cryptography Conference, 1992.

1991

Dolev, D., C. Dwork, and M. Naor. “Non-Malleable Cryptography”. Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC ’91), 1991, 542-52.
Dolev, D., C. Dwork, and M. Naor. “Non-Malleable Cryptography”. Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC ’91), 1991, 542-52.

1988

Dwork, C., N. Lynch, and L. Stockmeyer. “Consensus in the Presence of Partial Synchrony”. Journal of the ACM (JACM) 35, no. 2 (1988): 288-323.
Dwork, C., N. Lynch, and L. Stockmeyer. “Consensus in the Presence of Partial Synchrony”. Journal of the ACM (JACM) 35, no. 2 (1988): 288-323.