default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCynthia Dwork
Person information
- affiliation: Microsoft Research
- award (2025): National Medal of Science
- award (2021): Paris Kanellakis Award
- award (2020): Knuth Prize
- award (2017): Gödel Prize
- award (2007): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i44]Maria Ballesteros, Cynthia Dwork, Gary King, Conlan Olson, Manish Raghavan:
Evaluating the Impacts of Swapping on the US Decennial Census. CoRR abs/2502.01320 (2025)- [i43]Flávio P. Calmon, Elbert Du, Cynthia Dwork, Brian Finley, Grigory Franguridi:
Debiasing Functions of Private Statistics in Postprocessing. CoRR abs/2502.13314 (2025) - [i42]Cynthia Dwork, Chris Hays, Lunjia Hu, Nicole Immorlica, Juan C. Perdomo:
Inducing Efficient and Equitable Professional Networks through Link Recommendations. CoRR abs/2503.04542 (2025) - 2024
- [j48]John M. Abowd, Cynthia Dwork, Alan F. Karr
, Kobbi Nissim, Jerome P. Reiter, Aleksandra B. Slavkovic, Lars Vilhuber:
Launching the Society for Privacy and Confidentiality Research to Own the Journal of Privacy and Confidentiality. J. Priv. Confidentiality 14(3) (2024) - [c109]Reid McIlroy-Young, Katrina Brown, Conlan Olson, Linjun Zhang, Cynthia Dwork:
Order-Independence Without Fine Tuning. NeurIPS 2024 - [c108]Cynthia Dwork, Chris Hays, Jon M. Kleinberg, Manish Raghavan:
Equilibria, Efficiency, and Inequality in Network Formation for Hiring and Opportunity. EC 2024: 347-371 - [c107]Sílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan:
Complexity-Theoretic Implications of Multicalibration. STOC 2024: 1071-1082 - [c106]Cynthia Dwork, Chris Hays, Jon M. Kleinberg, Manish Raghavan:
Content Moderation and the Formation of Online Communities: A Theoretical Framework. WWW 2024: 1307-1317 - [i41]Cynthia Dwork, Chris Hays, Jon M. Kleinberg, Manish Raghavan:
Equilibria, Efficiency, and Inequality in Network Formation for Hiring and Opportunity. CoRR abs/2402.13841 (2024) - [i40]Cynthia Dwork, Kristjan H. Greenewald, Manish Raghavan:
Synthetic Census Data Generation via Multidimensional Multiset Sum. CoRR abs/2404.10095 (2024) - [i39]Reid McIlroy-Young, Katrina Brown, Conlan Olson, Linjun Zhang, Cynthia Dwork:
Set-Based Prompting: Provably Solving the Language Model Order Dependency Problem. CoRR abs/2406.06581 (2024) - [i38]Cynthia Dwork, Pranay Tankala, Linjun Zhang:
Differentially Private Learning Beyond the Classical Dimensionality Regime. CoRR abs/2411.13682 (2024) - [i37]Cynthia Dwork, Chris Hays, Nicole Immorlica, Juan C. Perdomo, Pranay Tankala:
From Fairness to Infinity: Outcome-Indistinguishable (Omni)Prediction in Evolving Graphs. CoRR abs/2411.17582 (2024) - 2023
- [c105]Cynthia Dwork, Daniel Lee, Huijia Lin, Pranay Tankala:
From Pseudorandomness to Multi-Group Fairness and Back. COLT 2023: 3566-3614 - [c104]Cynthia Dwork, Omer Reingold, Guy N. Rothblum:
From the Real Towards the Ideal: Risk Prediction in a Better World. FORC 2023: 1:1-1:17 - [c103]Zhun Deng, Cynthia Dwork, Linjun Zhang:
HappyMap : A Generalized Multicalibration Method. ITCS 2023: 41:1-41:23 - [i36]Cynthia Dwork, Daniel Lee, Huijia Lin, Pranay Tankala:
New Insights into Multi-Calibration. CoRR abs/2301.08837 (2023) - [i35]Zhun Deng, Cynthia Dwork, Linjun Zhang:
HappyMap: A Generalized Multi-calibration Method. CoRR abs/2303.04379 (2023) - [i34]Cynthia Dwork, Chris Hays, Jon M. Kleinberg, Manish Raghavan:
Content Moderation and the Formation of Online Communities: A Theoretical Framework. CoRR abs/2310.10573 (2023) - [i33]Sílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan:
Complexity-Theoretic Implications of Multicalibration. CoRR abs/2312.17223 (2023) - 2022
- [c102]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature. ALT 2022: 342-380 - [c101]Elbert Du, Cynthia Dwork:
Improved Generalization Guarantees in Restricted Data Models. FORC 2022: 6:1-6:12 - [i32]Elbert Du, Cynthia Dwork:
Improved Generalization Guarantees in Restricted Data Models. CoRR abs/2207.10668 (2022) - [i31]Travis Dick, Cynthia Dwork, Michael Kearns, Terrance Liu, Aaron Roth, Giuseppe Vietri, Zhiwei Steven Wu:
Confidence-Ranked Reconstruction of Census Microdata from Published Statistics. CoRR abs/2211.03128 (2022) - 2021
- [j47]Cynthia Dwork, Weijie J. Su, Li Zhang:
Differentially private false discovery rate control. J. Priv. Confidentiality 11(2) (2021) - [c100]Cynthia Dwork:
Pseudo-Randomness and the Crystal Ball. CCS 2021: 1-2 - [c99]Marcel Neunhoeffer, Steven Wu, Cynthia Dwork:
Private Post-GAN Boosting. ICLR 2021 - [c98]Cynthia Dwork:
Differential Privacy in Distributed Environments: An Overview and Open Questions. PODC 2021: 5 - [c97]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome indistinguishability. STOC 2021: 1095-1108 - [i30]Maya Burhanpurkar, Zhun Deng, Cynthia Dwork, Linjun Zhang:
Scaffolding Sets. CoRR abs/2111.03135 (2021) - 2020
- [j46]Cynthia Dwork, Alan F. Karr, Kobbi Nissim, Lars Vilhuber:
On Privacy in the Age of COVID-19. J. Priv. Confidentiality 10(2) (2020) - [c96]Cynthia Dwork, Christina Ilvento, Meena Jagadeesan:
Individual Fairness in Pipelines. FORC 2020: 7:1-7:22 - [c95]Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, Pragya Sur:
Abstracting Fairness: Oracles, Metrics, and Interpretability. FORC 2020: 8:1-8:16 - [c94]Zhun Deng, Cynthia Dwork, Jialiang Wang, Linjun Zhang:
Interpreting Robust Optimization via Adversarial Influence Functions. ICML 2020: 2464-2473 - [i29]Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, Pragya Sur:
Abstracting Fairness: Oracles, Metrics, and Interpretability. CoRR abs/2004.01840 (2020) - [i28]Cynthia Dwork, Christina Ilvento, Meena Jagadeesan:
Individual Fairness in Pipelines. CoRR abs/2004.05167 (2020) - [i27]Zhun Deng, Frances Ding, Cynthia Dwork, Rachel Hong, Giovanni Parmigiani, Prasad Patil, Pragya Sur:
Representation via Representations: Domain Generalization via Adversarially Learned Invariant Representations. CoRR abs/2006.11478 (2020) - [i26]Marcel Neunhoeffer, Zhiwei Steven Wu, Cynthia Dwork:
Private Post-GAN Boosting. CoRR abs/2007.11934 (2020) - [i25]Zhun Deng, Cynthia Dwork, Jialiang Wang, Linjun Zhang:
Interpreting Robust Optimization via Adversarial Influence Functions. CoRR abs/2010.01247 (2020) - [i24]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome Indistinguishability. CoRR abs/2011.13426 (2020) - [i23]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome Indistinguishability. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j45]Cynthia Dwork, Nitin Kohli, Deirdre K. Mulligan:
Differential Privacy in Practice: Expose your Epsilons! J. Priv. Confidentiality 9(2) (2019) - [c93]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Learning from Outcomes: Evidence-Based Rankings. FOCS 2019: 106-125 - [c92]Cynthia Dwork, Christina Ilvento:
Fairness Under Composition. ITCS 2019: 33:1-33:20 - [c91]Cynthia Dwork:
Differential Privacy and the US Census. PODS 2019: 1 - [i22]Zhun Deng, Cynthia Dwork, Jialiang Wang, Yao Zhao:
Architecture Selection via the Trade-off Between Accuracy and Robustness. CoRR abs/1906.01354 (2019) - 2018
- [j44]Cynthia Dwork:
The Future of the Journal of Privacy and Confidentiality. J. Priv. Confidentiality 8(1) (2018) - [j43]Cynthia Dwork:
Reminiscences. J. Priv. Confidentiality 8(1) (2018) - [j42]Cynthia Dwork, Jonathan R. Ullman:
The Fienberg Problem: How to Allow Human Interactive Data Analysis in the Age of Differential Privacy. J. Priv. Confidentiality 8(1) (2018) - [c90]Cynthia Dwork, Vitaly Feldman:
Privacy-preserving Prediction. COLT 2018: 1693-1702 - [c89]Cynthia Dwork, Nicole Immorlica, Adam Tauman Kalai, Mark D. M. Leiserson:
Decoupled Classifiers for Group-Fair and Efficient Machine Learning. FAT 2018: 119-133 - [c88]Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke:
Composable and versatile privacy via truncated CDP. STOC 2018: 74-86 - [i21]Cynthia Dwork, Vitaly Feldman:
Privacy-preserving Prediction. CoRR abs/1803.10266 (2018) - [i20]Cynthia Dwork, Christina Ilvento:
Fairness Under Composition. CoRR abs/1806.06122 (2018) - [i19]Cynthia Dwork, Weijie Su, Li Zhang:
Differentially Private False Discovery Rate Control. CoRR abs/1807.04209 (2018) - 2017
- [j41]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Guilt-free data reuse. Commun. ACM 60(4): 86-93 (2017) - [c87]Cynthia Dwork:
What's Fair? KDD 2017: 1 - [i18]John M. Abowd, Lorenzo Alvisi, Cynthia Dwork, Sampath Kannan, Ashwin Machanavajjhala, Jerome P. Reiter:
Privacy-Preserving Data Analysis for the Federal Statistical Agencies. CoRR abs/1701.00752 (2017) - [i17]Cynthia Dwork, George J. Pappas:
Privacy in Information-Rich Intelligent Infrastructure. CoRR abs/1706.01985 (2017) - [i16]Cynthia Dwork, Nicole Immorlica, Adam Tauman Kalai, Max D. M. Leiserson:
Decoupled classifiers for fair and efficient machine learning. CoRR abs/1707.06613 (2017) - 2016
- [j40]Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith:
Calibrating Noise to Sensitivity in Private Data Analysis. J. Priv. Confidentiality 7(3): 17-51 (2016) - [c86]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. CRYPTO (3) 2016: 123-145 - [i15]Cynthia Dwork, Guy N. Rothblum:
Concentrated Differential Privacy. CoRR abs/1603.01887 (2016) - [i14]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. Electron. Colloquium Comput. Complex. TR16 (2016) - [i13]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. IACR Cryptol. ePrint Arch. 2016: 291 (2016) - 2015
- [j39]Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar:
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations. Discret. Comput. Geom. 53(3): 650-673 (2015) - [c85]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum:
Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) 2015: 735-751 - [c84]Cynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan R. Ullman, Salil P. Vadhan:
Robust Traceability from Trace Amounts. FOCS 2015: 650-669 - [c83]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. NIPS 2015: 2350-2358 - [c82]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth:
Preserving Statistical Validity in Adaptive Data Analysis. STOC 2015: 117-126 - [i12]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. CoRR abs/1506.02629 (2015) - [i11]Cynthia Dwork, Weijie Su, Li Zhang:
Private False Discovery Rate Control. CoRR abs/1511.03803 (2015) - 2014
- [j38]Cynthia Dwork, Aaron Roth:
The Algorithmic Foundations of Differential Privacy. Found. Trends Theor. Comput. Sci. 9(3-4): 211-407 (2014) - [c81]Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar:
Using Convex Relaxations for Efficiently and Privately Releasing Marginals. SoCG 2014: 261 - [c80]Cynthia Dwork, Kunal Talwar, Abhradeep Thakurta, Li Zhang:
Analyze gauss: optimal bounds for privacy-preserving principal component analysis. STOC 2014: 11-20 - [i10]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Preserving Statistical Validity in Adaptive Data Analysis. CoRR abs/1411.2664 (2014) - 2013
- [j37]Cynthia Dwork, Rebecca Pottenger:
Toward practicing privacy. J. Am. Medical Informatics Assoc. 20(1): 102-108 (2013) - [c79]Richard S. Zemel, Yu Wu, Kevin Swersky, Toniann Pitassi, Cynthia Dwork:
Learning Fair Representations. ICML (3) 2013: 325-333 - [i9]Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar:
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations. CoRR abs/1308.1385 (2013) - 2012
- [c78]Cynthia Dwork, Moni Naor, Salil P. Vadhan:
The Privacy of the Analyst and the Power of the State. FOCS 2012: 400-409 - [c77]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness through awareness. ITCS 2012: 214-226 - [c76]Cynthia Dwork:
Differential Privacy and the Power of (Formalizing) Negative Thinking - (Extended Abstract). POST 2012: 1-2 - [i8]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar:
On Privacy-Preserving Histograms. CoRR abs/1207.1371 (2012) - 2011
- [j36]Cynthia Dwork:
A firm foundation for private data analysis. Commun. ACM 54(1): 86-95 (2011) - [j35]Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg:
Wherefore art thou R3579X?: anonymized social networks, hidden patterns, and structural steganography. Commun. ACM 54(12): 133-141 (2011) - [j34]Shuchi Chawla, Cynthia Dwork, Venkatesan Guruswami:
Special Section on the Fortieth Annual ACM Symposium On Theory Of Computing (STOC 2008). SIAM J. Comput. 40(6): 1738 (2011) - [c75]Cynthia Dwork:
The Promise of Differential Privacy: A Tutorial on Algorithmic Techniques. FOCS 2011: 1-2 - [r3]Cynthia Dwork:
Differential Privacy. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 338-340 - [r2]Cynthia Dwork:
Non-Malleability. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 849-852 - [i7]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness Through Awareness. CoRR abs/1104.3913 (2011) - 2010
- [j33]Cynthia Dwork, Adam D. Smith:
Differential Privacy for Statistics: What we Know and What we Want to Learn. J. Priv. Confidentiality 1(2) (2010) - [j32]Cynthia Dwork, Moni Naor:
On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy. J. Priv. Confidentiality 2(1) (2010) - [c74]Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan:
Boosting and Differential Privacy. FOCS 2010: 51-60 - [c73]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin:
Pan-Private Streaming Algorithms. ICS 2010: 66-80 - [c72]Cynthia Dwork:
Differential Privacy in New Settings. SODA 2010: 174-183 - [c71]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum:
Differential privacy under continual observation. STOC 2010: 715-724
2000 – 2009
- 2009
- [c70]Cynthia Dwork, Jing Lei:
Differential privacy and robust statistics. STOC 2009: 371-380 - [c69]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan:
On the complexity of differentially private data release: efficient algorithms and hardness results. STOC 2009: 381-390 - [c68]Cynthia Dwork:
The Differential Privacy Frontier (Extended Abstract). TCC 2009: 496-502 - [c67]Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan:
How Efficient Can Memory Checking Be?. TCC 2009: 503-520 - 2008
- [c66]Cynthia Dwork, Sergey Yekhanin:
New Efficient Attacks on Statistical Disclosure Control Mechanisms. CRYPTO 2008: 469-480 - [c65]Cynthia Dwork:
Differential Privacy: A Survey of Results. TAMC 2008: 1-19 - [e3]Cynthia Dwork:
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008. ACM 2008, ISBN 978-1-60558-047-0 [contents] - 2007
- [j31]Cynthia Dwork, Moni Naor:
Zaps and Their Applications. SIAM J. Comput. 36(6): 1513-1543 (2007) - [c64]Cynthia Dwork:
Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis. ICDT 2007: 18-27 - [c63]Cynthia Dwork:
An Ad Omnia Approach to Defining and Achieving Private Data Analysis. PinKDD 2007: 1-13 - [c62]Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar:
Privacy, accuracy, and consistency too: a holistic solution to contingency table release. PODS 2007: 273-282 - [c61]Cynthia Dwork, Frank McSherry, Kunal Talwar:
The price of privacy and the limits of LP decoding. STOC 2007: 85-94 - [c60]Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg:
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. WWW 2007: 181-190 - [i6]Miklós Ajtai, Cynthia Dwork:
The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence.. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c59]Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor:
Our Data, Ourselves: Privacy Via Distributed Noise Generation. EUROCRYPT 2006: 486-503 - [c58]Cynthia Dwork:
Differential Privacy. ICALP (2) 2006: 1-12 - [c57]Nir Ailon, Steve Chien, Cynthia Dwork:
On Clusters in Markov Chains. LATIN 2006: 43-55 - [c56]Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer:
An Architecture for Provably Secure Computation. LATIN 2006: 56-67 - [c55]Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith:
Calibrating Noise to Sensitivity in Private Data Analysis. TCC 2006: 265-284 - [e2]Cynthia Dwork:
Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings. Lecture Notes in Computer Science 4117, Springer 2006, ISBN 3-540-37432-9 [contents] - 2005
- [c54]Cynthia Dwork, Moni Naor, Hoeteck Wee:
Pebbling and Proofs of Work. CRYPTO 2005: 37-54 - [c53]Cynthia Dwork:
Sub-linear Queries Statistical Databases: Privacy with Power. CT-RSA 2005: 1-6 - [c52]Avrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim:
Practical privacy: the SuLQ framework. PODS 2005: 128-138 - [c51]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam D. Smith, Hoeteck Wee:
Toward Privacy in Public Databases. TCC 2005: 363-385 - [c50]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar:
On Privacy-Preserving Histograms. UAI 2005 - [r1]Cynthia Dwork:
Nonmalleability. Encyclopedia of Cryptography and Security 2005 - 2004
- [j30]Cynthia Dwork, Moni Naor, Amit Sahai:
Concurrent zero-knowledge. J. ACM 51(6): 851-898 (2004) - [c49]Cynthia Dwork, Kobbi Nissim:
Privacy-Preserving Datamining on Vertically Partitioned Databases. CRYPTO 2004: 528-544 - [c48]Cynthia Dwork, Moni Naor, Omer Reingold:
Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT 2004: 342-360 - [c47]Cynthia Dwork:
Fighting Spam: The Science. LATIN 2004: 3-4 - [c46]Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan:
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. TCC 2004: 101-120 - 2003
- [j29]Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, D. Sivakumar:
Link Evolution: Analysis and Algorithms. Internet Math. 1(3): 277-304 (2003) - [j28]Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. J. ACM 50(6): 852-921 (2003) - [j27]Danny Dolev, Cynthia Dwork, Moni Naor:
Nonmalleable Cryptography. SIAM Rev. 45(4): 727-784 (2003) - [c45]Cynthia Dwork, Andrew V. Goldberg, Moni Naor:
On Memory-Bound Functions for Fighting Spam. CRYPTO 2003: 426-444 - 2002
- [c44]Cynthia Dwork, Larry J. Stockmeyer:
2-round zero knowledge and proof auditors. STOC 2002: 322-331 - [i5]Cynthia Dwork, Moni Naor:
Zaps and Their Applications. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c43]Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar:
Rank aggregation methods for the Web. WWW 2001: 613-622 - 2000
- [j26]Danny Dolev, Cynthia Dwork, Moni Naor:
Nonmalleable Cryptography. SIAM J. Comput. 30(2): 391-437 (2000) - [c42]Cynthia Dwork, Moni Naor:
Zaps and Their Applications. FOCS 2000: 283-293 - [i4]Cynthia Dwork, Joseph Y. Halpern, Orli Waarts:
Performing work efficiently in the presence of faults. CoRR cs.DC/0006008 (2000)
1990 – 1999
- 1999
- [j25]Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
Time-Lapse Snapshots. SIAM J. Comput. 28(5): 1848-1874 (1999) - [c41]Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. FOCS 1999: 523-534 - [i3]Cynthia Dwork, Moni Naor, Amit Sahai:
Concurrent Zero-Knowledge. IACR Cryptol. ePrint Arch. 1999: 23 (1999) - 1998
- [j24]Cynthia Dwork, Moni Naor:
An Efficient Existentially Unforgeable Signature Scheme and Its Applications. J. Cryptol. 11(3): 187-208 (1998) - [j23]Cynthia Dwork, Joseph Y. Halpern, Orli Waarts:
Performing Work Efficiently in the Presence of Faults. SIAM J. Comput. 27(5): 1457-1491 (1998) - [c40]Cynthia Dwork, Amit Sahai:
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. CRYPTO 1998: 442-457 - [c39]Cynthia Dwork, Moni Naor, Amit Sahai:
Concurrent Zero-Knowledge. STOC 1998: 409-418 - 1997
- [j22]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Contention in shared memory algorithms. J. ACM 44(6): 779-805 (1997) - [c38]Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
Deniable Encryption. CRYPTO 1997: 90-104 - [c37]Cynthia Dwork:
Positive Applications of Lattices to Cryptography. MFCS 1997: 44-51 - [c36]Miklós Ajtai, Cynthia Dwork:
A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence. STOC 1997: 284-293 - 1996
- [j21]Cynthia Dwork:
Distributed computing column. SIGACT News 27(3): 50-54 (1996) - [c35]David M. Choy, Cynthia Dwork, Jeffrey B. Lotspiech, Laura C. Anderson, Stephen K. Boyer, Richard Dievendorff, Thomas D. Griffin, Bruce A. Hoenig, M. J. Jackson, W. Kaka, James M. McCrossin, Alex M. Miller, Robert J. T. Morris, Norman J. Pass:
A Digital Library System for Periodicals Distribution. ADL 1996: 95-103 - [c34]Cynthia Dwork, Ching-Tien Ho, H. Raymond Strong:
Collective Consistency (Work in Progress, Abstract). PODC 1996: 341 - [c33]Cynthia Dwork, Jeffrey B. Lotspiech, Moni Naor:
Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). STOC 1996: 489-498 - [c32]Cynthia Dwork, Ching-Tien Ho, H. Raymond Strong:
Collective Consistency. WDAG 1996: 234-250 - [i2]Miklós Ajtai, Cynthia Dwork:
A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
Deniable Encryption. IACR Cryptol. ePrint Arch. 1996: 2 (1996) - 1995
- [j20]Cynthia Dwork:
Distributed computing. SIGACT News 26(1): 17-19 (1995) - [c31]David M. Choy, Richard Dievendorff, Cynthia Dwork, Jeffrey B. Lotspiech, Robert J. T. Morris, Norman J. Pass, Laura C. Anderson, Alan E. Bell, Stephen K. Boyer, Thomas D. Griffin, Bruce A. Hoenig, James M. McCrossin, Alex M. Miller, Florian Pestoni, Deidra S. Picciano:
The Almaden Distributed Digital Library System. ADL 1995: 203-220 - 1994
- [j19]Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. J. ACM 41(1): 122-152 (1994) - [c30]Cynthia Dwork, Moni Naor:
An Efficient Existentially Unforgeable Signature Scheme and its Applications. CRYPTO 1994: 234-246 - [c29]Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts:
A Theory of Competitive Analysis for Distributed Algorithms. FOCS 1994: 401-411 - [c28]Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts:
Competitiveness in Distributed Algorithms. PODC 1994: 398 - 1993
- [j18]Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung:
Perfectly Secure Message Transmission. J. ACM 40(1): 17-47 (1993) - [c27]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Bounded Round Numbers. PODC 1993: 53-64 - [c26]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Contention in shared memory algorithms. STOC 1993: 174-183 - 1992
- [j17]Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong:
Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement. Inf. Comput. 97(2): 205-233 (1992) - [j16]Cynthia Dwork, Larry J. Stockmeyer:
Finite State Verifiers I: The Power of Interaction. J. ACM 39(4): 800-828 (1992) - [j15]Cynthia Dwork, Larry J. Stockmeyer:
Finite State Verifiers II: Zero Knowledge. J. ACM 39(4): 829-858 (1992) - [c25]Cynthia Dwork, Moni Naor:
Pricing via Processing or Combatting Junk Mail. CRYPTO 1992: 139-147 - [c24]Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra:
Low Communication 2-Prover Zero-Knowledge Proofs for NP. CRYPTO 1992: 215-227 - [c23]Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
Time-Lapse Snapshots. ISTCS 1992: 154-170 - [c22]Cynthia Dwork, Joseph Y. Halpern, Orli Waarts:
Performing Work Efficiently in the Presence of Faults. PODC 1992: 91-102 - [c21]Cynthia Dwork, Orli Waarts:
Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! STOC 1992: 655-666 - 1991
- [j14]Brian A. Coan, Cynthia Dwork:
Simultaneity Is Harder than Agreement. Inf. Comput. 91(2): 205-231 (1991) - [c20]Cynthia Dwork:
On Verification in Secret Sharing. CRYPTO 1991: 114-128 - [c19]Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. STOC 1991: 359-369 - [c18]Danny Dolev, Cynthia Dwork, Moni Naor:
Non-Malleable Cryptography (Extended Abstract). STOC 1991: 542-552 - 1990
- [j13]Cynthia Dwork, Yoram Moses:
Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures. Inf. Comput. 88(2): 156-186 (1990) - [j12]Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer:
Flipping Persuasively in Constant Time. SIAM J. Comput. 19(3): 472-499 (1990) - [j11]Cynthia Dwork, Larry J. Stockmeyer:
A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata. SIAM J. Comput. 19(6): 1011-1023 (1990) - [j10]Cynthia Dwork:
Distributed computing column. SIGACT News 21(2): 12 (1990) - [c17]Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung:
Perfectly Secure Message Transmission. FOCS 1990: 36-45 - [c16]Cynthia Dwork:
Strong Verifiable Secret Sharing (Extended Abstract). WDAG 1990: 213-227 - [e1]Cynthia Dwork:
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, August 22-24, 1990. ACM 1990, ISBN 0-89791-404-X [contents]
1980 – 1989
- 1989
- [j9]Benny Chor, Cynthia Dwork:
Randomization in Byzantine Agreement. Adv. Comput. Res. 5: 443-497 (1989) - [j8]Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
The Distributed Firing Squad Problem. SIAM J. Comput. 18(5): 990-1012 (1989) - [j7]Cynthia Dwork:
Distributed computing column. SIGACT News 20(4): 14-16 (1989) - [c15]Cynthia Dwork, Larry J. Stockmeyer:
On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract). FOCS 1989: 480-485 - 1988
- [j6]Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Consensus in the presence of partial synchrony. J. ACM 35(2): 288-323 (1988) - [j5]Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer:
Parallel Algorithms for Term Matching. SIAM J. Comput. 17(4): 711-731 (1988) - [j4]Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal:
Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. 17(5): 975-988 (1988) - [c14]Cynthia Dwork, Larry J. Stockmeyer:
Zero-Knowledge With Finite State Verifiers. CRYPTO 1988: 71-75 - 1987
- [j3]Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77-97 (1987) - [c13]Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong:
Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement. PODC 1987: 42-51 - 1986
- [j2]Stephen A. Cook, Cynthia Dwork, Rüdiger Reischuk:
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes. SIAM J. Comput. 15(1): 87-97 (1986) - [c12]Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer:
Parallel Algorithms for Term Matching. CADE 1986: 416-430 - [c11]Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer:
Flipping Persuasively in Constant Expected Time (Preliminary Version). FOCS 1986: 222-232 - [c10]Brian A. Coan, Cynthia Dwork:
Simultaneity is Harder than Agreement. Symposium on Reliability in Distributed Software and Database Systems 1986: 141-150 - [c9]Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal:
Fault Tolerance in Networks of Bounded Degree (Preliminary Version). STOC 1986: 370-379 - [c8]Cynthia Dwork, Yoram Moses:
Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures. TARK 1986: 149-169 - 1985
- [c7]Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
The Distributed Firing Squad Problem (Preliminary Version). STOC 1985: 335-345 - 1984
- [j1]Cynthia Dwork, Paris C. Kanellakis, John C. Mitchell:
On the Sequential Nature of Unification. J. Log. Program. 1(1): 35-50 (1984) - [c6]Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Consensus in the Presence of Partial Synchrony (Preliminary Version). PODC 1984: 103-118 - [c5]Cynthia Dwork, Dale Skeen:
Patterns of Communication in Consensus Protocols. PODC 1984: 143-153 - 1983
- [b1]Cynthia Dwork:
Bounds on Fundamental Problems in Parallel and Distributed Computation. Cornell University, USA, 1983 - [c4]Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
On the Minimal Synchronism Needed for Distributed Consensus. FOCS 1983: 393-402 - [c3]Cynthia Dwork, Dale Skeen:
The Inherent Cost of Nonblocking Commitment. PODC 1983: 1-11 - [c2]Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson:
Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version). STOC 1983: 42-51 - 1982
- [c1]Stephen A. Cook, Cynthia Dwork:
Bounds on the Time for Parallel RAM's to Compute Simple Functions. STOC 1982: 231-233
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-14 01:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
