| 2025 | COLT | From Fairness to Infinity: Outcome-Indistinguishable (Omni)Prediction in Evolving Graphs. | Cynthia Dwork, Chris Hays, Nicole Immorlica, Juan C. Perdomo, Pranay Tankala |
| 2025 | TCC | Differentially Private Learning Beyond the Classical Dimensionality Regime. | Cynthia Dwork, Pranay Tankala, Linjun Zhang |
| 2024 | WWW | Content Moderation and the Formation of Online Communities: A Theoretical Framework. | Cynthia Dwork, Chris Hays, Jon M. Kleinberg, Manish Raghavan |
| 2024 | STOC | Complexity-Theoretic Implications of Multicalibration. | Slvia Casacuberta, Cynthia Dwork, Salil P. Vadhan |
| 2023 | COLT | From Pseudorandomness to Multi-Group Fairness and Back. | Cynthia Dwork, Daniel Lee, Huijia Lin, Pranay Tankala |
| 2022 | ALT | Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature. | Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona |
| 2021 | CCS | Pseudo-Randomness and the Crystal Ball. | Cynthia Dwork |
| 2021 | ICLR | Private Post-GAN Boosting. | Marcel Neunhoeffer, Steven Wu, Cynthia Dwork |
| 2021 | PODC | Differential Privacy in Distributed Environments: An Overview and Open Questions. | Cynthia Dwork |
| 2021 | STOC | Outcome indistinguishability. | Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona |
| 2020 | ICML | Interpreting Robust Optimization via Adversarial Influence Functions. | Zhun Deng, Cynthia Dwork, Jialiang Wang, Linjun Zhang |
| 2019 | FOCS | Learning from Outcomes: Evidence-Based Rankings. | Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona |
| 2019 | PODS | Differential Privacy and the US Census. | Cynthia Dwork |
| 2018 | COLT | Privacy-preserving Prediction. | Cynthia Dwork, Vitaly Feldman |
| 2018 | STOC | Composable and versatile privacy via truncated CDP. | Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke |
| 2017 | KDD | What's Fair? | Cynthia Dwork |
| 2016 | CRYPTO | Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. | Cynthia Dwork, Moni Naor, Guy N. Rothblum |
| 2015 | ASIACRYPT | Pure Differential Privacy for Rectangle Queries via Private Partitions. | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum |
| 2015 | FOCS | Robust Traceability from Trace Amounts. | Cynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan R. Ullman, Salil P. Vadhan |
| 2015 | STOC | Preserving Statistical Validity in Adaptive Data Analysis. | Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth |
| 2014 | STOC | Analyze gauss: optimal bounds for privacy-preserving principal component analysis. | Cynthia Dwork, Kunal Talwar, Abhradeep Thakurta, Li Zhang |
| 2013 | ICML | Learning Fair Representations. | Richard S. Zemel, Yu Wu, Kevin Swersky, Toniann Pitassi, Cynthia Dwork |
| 2012 | FOCS | The Privacy of the Analyst and the Power of the State. | Cynthia Dwork, Moni Naor, Salil P. Vadhan |
| 2011 | FOCS | The Promise of Differential Privacy: A Tutorial on Algorithmic Techniques. | Cynthia Dwork |
| 2010 | FOCS | Boosting and Differential Privacy. | Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan |
| 2010 | SODA | Differential Privacy in New Settings. | Cynthia Dwork |
| 2010 | STOC | Differential privacy under continual observation. | Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum |
| 2009 | STOC | Differential privacy and robust statistics. | Cynthia Dwork, Jing Lei |
| 2009 | STOC | On the complexity of differentially private data release: efficient algorithms and hardness results. | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan |
| 2009 | TCC | The Differential Privacy Frontier (Extended Abstract). | Cynthia Dwork |
| 2009 | TCC | How Efficient Can Memory Checking Be?. | Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan |
| 2008 | CRYPTO | New Efficient Attacks on Statistical Disclosure Control Mechanisms. | Cynthia Dwork, Sergey Yekhanin |
| 2008 | TAMC | Differential Privacy: A Survey of Results. | Cynthia Dwork |
| 2007 | ICDT | Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis. | Cynthia Dwork |
| 2007 | KDD | An Ad Omnia Approach to Defining and Achieving Private Data Analysis. | Cynthia Dwork |
| 2007 | PODS | Privacy, accuracy, and consistency too: a holistic solution to contingency table release. | Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar |
| 2007 | WWW | Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. | Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg |
| 2007 | STOC | The price of privacy and the limits of LP decoding. | Cynthia Dwork, Frank McSherry, Kunal Talwar |
| 2006 | EuroCrypt | Our Data, Ourselves: Privacy Via Distributed Noise Generation. | Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor |
| 2006 | ICALP | Differential Privacy. | Cynthia Dwork |
| 2006 | LATIN | On Clusters in Markov Chains. | Nir Ailon, Steve Chien, Cynthia Dwork |
| 2006 | LATIN | An Architecture for Provably Secure Computation. | Mikls Ajtai, Cynthia Dwork, Larry J. Stockmeyer |
| 2006 | TCC | Calibrating Noise to Sensitivity in Private Data Analysis. | Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith |
| 2005 | CRYPTO | Pebbling and Proofs of Work. | Cynthia Dwork, Moni Naor, Hoeteck Wee |
| 2005 | PODS | Practical privacy: the SuLQ framework. | Avrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim |
| 2005 | UAI | On Privacy-Preserving Histograms. | Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar |
| 2005 | TCC | Toward Privacy in Public Databases. | Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam D. Smith, Hoeteck Wee |
| 2004 | CRYPTO | Privacy-Preserving Datamining on Vertically Partitioned Databases. | Cynthia Dwork, Kobbi Nissim |
| 2004 | EuroCrypt | Immunizing Encryption Schemes from Decryption Errors. | Cynthia Dwork, Moni Naor, Omer Reingold |
| 2004 | LATIN | Fighting Spam: The Science. | Cynthia Dwork |
| 2004 | TCC | List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. | Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan |
| 2003 | CRYPTO | On Memory-Bound Functions for Fighting Spam. | Cynthia Dwork, Andrew V. Goldberg, Moni Naor |
| 2002 | STOC | 2-round zero knowledge and proof auditors. | Cynthia Dwork, Larry J. Stockmeyer |
| 2001 | WWW | Rank aggregation methods for the Web. | Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar |
| 2000 | FOCS | Zaps and Their Applications. | Cynthia Dwork, Moni Naor |
| 1999 | FOCS | Magic Functions. | Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer |
| 1998 | CRYPTO | Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. | Cynthia Dwork, Amit Sahai |
| 1998 | STOC | Concurrent Zero-Knowledge. | Cynthia Dwork, Moni Naor, Amit Sahai |
| 1997 | CRYPTO | Deniable Encryption. | Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky |
| 1997 | MFCS | Positive Applications of Lattices to Cryptography. | Cynthia Dwork |
| 1997 | STOC | A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence. | Mikls Ajtai, Cynthia Dwork |
| 1996 | PODC | Collective Consistency (Work in Progress, Abstract). | Cynthia Dwork, Ching-Tien Ho, H. Raymond Strong |
| 1996 | STOC | Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). | Cynthia Dwork, Jeffrey B. Lotspiech, Moni Naor |
| 1994 | CRYPTO | An Efficient Existentially Unforgeable Signature Scheme and its Applications. | Cynthia Dwork, Moni Naor |
| 1994 | FOCS | A Theory of Competitive Analysis for Distributed Algorithms | Mikls Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts |
| 1994 | PODC | Competitiveness in Distributed Algorithms. | Mikls Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts |
| 1993 | PODC | Bounded Round Numbers. | Cynthia Dwork, Maurice Herlihy, Orli Waarts |
| 1993 | STOC | Contention in shared memory algorithms. | Cynthia Dwork, Maurice Herlihy, Orli Waarts |
| 1992 | CRYPTO | Low Communication 2-Prover Zero-Knowledge Proofs for NP. | Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra |
| 1992 | CRYPTO | Pricing via Processing or Combatting Junk Mail. | Cynthia Dwork, Moni Naor |
| 1992 | PODC | Performing Work Efficiently in the Presence of Faults. | Cynthia Dwork, Joseph Y. Halpern, Orli Waarts |
| 1992 | STOC | Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! | Cynthia Dwork, Orli Waarts |
| 1991 | CRYPTO | On Verification in Secret Sharing. | Cynthia Dwork |
| 1991 | STOC | Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty | Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer |
| 1991 | STOC | Non-Malleable Cryptography (Extended Abstract) | Danny Dolev, Cynthia Dwork, Moni Naor |
| 1990 | FOCS | Perfectly Secure Message Transmission | Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung |
| 1989 | FOCS | On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract) | Cynthia Dwork, Larry J. Stockmeyer |
| 1988 | CRYPTO | Zero-Knowledge With Finite State Verifiers. | Cynthia Dwork, Larry J. Stockmeyer |
| 1987 | PODC | Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement. | Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong |
| 1986 | CADE | Parallel Algorithms for Term Matching. | Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer |
| 1986 | FOCS | Flipping Persuasively in Constant Expected Time (Preliminary Version) | Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer |
| 1986 | STOC | Fault Tolerance in Networks of Bounded Degree (Preliminary Version) | Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal |
| 1986 | SRDS | Simultaneity is Harder than Agreement. | Brian A. Coan, Cynthia Dwork |
| 1986 | TARK | Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures. | Cynthia Dwork, Yoram Moses |
| 1985 | STOC | The Distributed Firing Squad Problem (Preliminary Version) | Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer |
| 1984 | PODC | Consensus in the Presence of Partial Synchrony (Preliminary Version). | Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer |
| 1984 | PODC | Patterns of Communication in Consensus Protocols. | Cynthia Dwork, Dale Skeen |
| 1983 | FOCS | On the Minimal Synchronism Needed for Distributed Consensus | Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer |
| 1983 | PODC | The Inherent Cost of Nonblocking Commitment. | Cynthia Dwork, Dale Skeen |
| 1983 | STOC | Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) | Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson |
| 1982 | STOC | Bounds on the Time for Parallel RAM's to Compute Simple Functions | Stephen A. Cook, Cynthia Dwork |