Publications
21 results
21 results
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. “Differential Privacy”. International Colloquium on Automata, Languages, and Programming. ICALP, 2006.
Dwork, C. “Differential Privacy”. International Colloquium on Automata, Languages, and Programming. ICALP, 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 .
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.