Cynthia Dwork | Academic Influence

Cynthia Dwork's AcademicInfluence.com Rankings

Cynthia Dwork

Computer Science

#370

World Rank

#386

Historical Rank

#207

USA Rank

Algorithms

#19

World Rank

#19

Historical Rank

#8

USA Rank

Database

#27

World Rank

#28

Historical Rank

#15

USA Rank

computer-science Degrees

Download Badge

Computer Science

Cynthia Dwork's Degrees

PhD Computer Science Cornell University
Masters Computer Science Cornell University
Bachelors Mathematics Princeton University

Similar Degrees You Can Earn

Why Is Cynthia Dwork Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Cynthia Dwork is an American computer scientist best known for her contributions to cryptography, distributed computing, and algorithmic fairness. She is one of the inventors of differential privacy and proof-of-work.

(See a Problem?)

Cynthia Dwork's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

Calibrating Noise to Sensitivity in Private Data Analysis (2006) (6218)
The Algorithmic Foundations of Differential Privacy (2014) (5068)
Differential Privacy (2006) (4911)
Differential Privacy: A Survey of Results (2008) (3111)
Fairness through awareness (2011) (2521)
Rank aggregation methods for the Web (2001) (1930)
Consensus in the presence of partial synchrony (1988) (1759)
Our Data, Ourselves: Privacy Via Distributed Noise Generation (2006) (1734)
Pricing via Processing or Combatting Junk Mail (1992) (1371)
Learning Fair Representations (2013) (1342)
Non-malleable cryptography (1991) (1029)
Practical privacy: the SuLQ framework (2005) (880)
Boosting and Differential Privacy (2010) (821)
A firm foundation for private data analysis (2011) (812)
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography (2007) (807)
On the minimal synchronism needed for distributed consensus (1983) (703)
Nonmalleable Cryptography (2000) (696)
A public-key cryptosystem with worst-case/average-case equivalence (1997) (684)
Differential privacy and robust statistics (2009) (624)
Differential privacy under continual observation (2010) (609)
Privacy, accuracy, and consistency too: a holistic solution to contingency table release (2007) (503)
Perfectly secure message transmission (1990) (440)
Concurrent zero-knowledge (1998) (412)
Privacy-Preserving Datamining on Vertically Partitioned Databases (2004) (403)
On the complexity of differentially private data release: efficient algorithms and hardness results (2009) (403)
Deniable Encryption (1997) (366)
Wherefore art thou R3579X? (2011) (363)
Preserving Statistical Validity in Adaptive Data Analysis (2014) (333)
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes (1986) (330)
Toward Privacy in Public Databases (2005) (319)
Concentrated Differential Privacy (2016) (311)
The reusable holdout: Preserving validity in adaptive data analysis (2015) (300)
Differential Privacy for Statistics: What we Know and What we Want to Learn (2010) (289)
On Memory-Bound Functions for Fighting Spam (2003) (287)
Zaps and their applications (2000) (269)
Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures (1990) (261)
The price of privacy and the limits of LP decoding (2007) (229)
On the Sequential Nature of Unification (1984) (228)
Non-Malleable Cryptography (Extended Abstract) (1991) (224)
Analyze gauss: optimal bounds for privacy-preserving principal component analysis (2014) (222)
Decoupled Classifiers for Group-Fair and Efficient Machine Learning (2017) (203)
Generalization in Adaptive Data Analysis and Holdout Reuse (2015) (198)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement (1987) (176)
Exposed! A Survey of Attacks on Private Data (2017) (175)
Fault tolerance in networks of bounded degree (1986) (169)
Magic functions (1999) (169)
Concurrent zero-knowledge (2004) (166)
Pan-Private Streaming Algorithms (2010) (158)
Differential privacy in new settings (2010) (148)
Randomization in Byzantine Agreement (1989) (138)
On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy (2010) (136)
Robust Traceability from Trace Amounts (2015) (135)
The Differential Privacy Frontier (Extended Abstract) (2009) (127)
Composable and versatile privacy via truncated CDP (2018) (123)
New Efficient Attacks on Statistical Disclosure Control Mechanisms (2008) (122)
An Efficient Existentially Unforgeable Signature Scheme and Its Applications (1994) (108)
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints (1998) (107)
A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata (1990) (106)
Digital signets: self-enforcing protection of digital information (preliminary version) (1996) (106)
Finite state verifiers I: the power of interaction (1992) (105)
Pebbling and Proofs of Work (2005) (101)
It's Not Privacy, and It's Not Fair (2013) (97)
Bounds on the time to reach agreement in the presence of timing uncertainty (1991) (95)
Link Evolution: Analysis and Algorithms (2004) (90)
Fairness Under Composition (2018) (90)
Contention in shared memory algorithms (1993) (89)
Immunizing Encryption Schemes from Decryption Errors (2004) (86)
Performing work efficiently in the presence of faults (1992) (85)
Superconcentrators, generalizers and generalized connectors with limited depth (1983) (80)
Rank Aggregation Revisited (2002) (79)
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998 (2003) (77)
A theory of competitive analysis for distributed algorithms (1994) (75)
Bounds on the time for parallel RAM's to compute simple functions (1982) (75)
An Ad Omnia Approach to Defining and Achieving Private Data Analysis (2007) (72)
Time-Lapse Snapshots (1992) (67)
Differential Privacy in Practice: Expose your Epsilons! (2019) (63)
The inherent cost of nonblocking commitment (1983) (58)
Privacy-preserving Prediction (2018) (57)
The distributed firing squad problem (1985) (56)
Knowledge and common knowledge in a Byzantine environment I: crash failures (1986) (56)
Parallel Algorithms for Term Matching (1986) (52)
How Efficient Can Memory Checking Be? (2009) (50)
The Promise of Differential Privacy: A Tutorial on Algorithmic Techniques (2011) (49)
Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible! (1992) (49)
Low Communication 2-Prover Zero-Knowledge Proofs for NP (1992) (47)
Protecting Individual Privacy in the Struggle Against Terrorists: A Framework for Program Assessment (2008) (47)
Contention in shared memory algorithms (1993) (46)
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations (2013) (46)
Toward practicing privacy (2013) (43)
Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis (2007) (43)
Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III (2020) (41)
Decoupled classifiers for fair and efficient machine learning (2017) (40)
Pure Differential Privacy for Rectangle Queries via Private Partitions (2015) (37)
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 (2008) (35)
Succinct Proofs for NP and Spooky Interactions (2004) (34)
Outcome indistinguishability (2020) (34)
Individual Fairness in Pipelines (2020) (34)
Group Fairness Under Composition (2018) (32)
The Privacy of the Analyst and the Power of the State (2012) (30)
On Privacy-Preserving Histograms (2005) (29)
Bounds on the time to reach agreement in the presence of timing uncertainty (1994) (29)
On the Utility of Privacy-Preserving Histograms (2004) (29)
On the power of 2-way probabilistic finite state automata (1989) (28)
What’s Fair (2017) (28)
Differential Privacy and the US Census (2019) (27)
Private False Discovery Rate Control (2015) (25)
Differential Privacy – A Primer for the Perplexed (2011) (24)
The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence (2007) (23)
Simple and efficient bounded concurrent timestamping and the traceable use abstraction (1999) (23)
Simultaneity Is Harder than Agreement (1991) (23)
2-round zero knowledge and proof auditors (2002) (22)
Guilt-free data reuse (2017) (22)
Proceedings of the fortieth annual ACM symposium on Theory of computing (2008) (21)
Private Post-GAN Boosting (2020) (21)
An Eecient Existentially Unforgeable Signature Scheme and Its Applications (1994) (20)
Flipping persuasively in constant expected time (1986) (20)
Using Convex Relaxations for Efficiently and Privately Releasing Marginals (2014) (18)
Representation via Representations: Domain Generalization via Adversarially Learned Invariant Representations (2020) (18)
Consensus in the presence of partial synchrony (Preliminary Version) (1984) (18)
Bounded round number (1993) (18)
Learning from Outcomes: Evidence-Based Rankings (2019) (17)
Diffie-Hellman Key Exchange (2011) (17)
Flipping Persuasively in Constant Time (1990) (16)
Individual Fairness Under Composition (2018) (15)
Patterns of communication in consensus protocols (1984) (14)
Differentially Private False Discovery Rate Control (2018) (13)
Finite state verifiers II: zero knowledge (1992) (13)
Positive Applications of Lattices to Cryptography (1997) (11)
Privacy, Big Data, and the Public Good: Differential Privacy: A Cryptographic Approach to Private Data Analysis (2014) (11)
Privacy-Preserving Data Analysis for the Federal Statistical Agencies (2017) (11)
Privacy in Information-Rich Intelligent Infrastructure (2017) (10)
On Verification in Secret Sharing (1991) (10)
Interpreting Robust Optimization via Adversarial Influence Functions (2020) (10)
The Fienberg Problem: How to Allow Human Interactive Data Analysis in the Age of Differential Privacy (2018) (10)
Fault Tolerance in Networks of Bounded Degree (Preliminary Version) (1986) (9)
A digital library system for periodicals distribution (1996) (9)
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (2016) (9)
Strong Verifiable Secret Sharing (Extended Abstract) (1991) (9)
Zero-Knowledge With Finite State Verifiers (1988) (8)
On Privacy in the Age of COVID-19 (2020) (8)
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument (2004) (7)
Analyze Gauss: optimal bounds for privacy-preserving PCA (2014) (6)
Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings (Lecture Notes in Computer Science) (2006) (6)
Bounds on Fundamental Problems in Parallel and Distributed Computation (1983) (6)
Collective Consistency (1996) (5)
Distributed computing column (1989) (5)
HappyMap : A Generalized Multicalibration Method (2023) (5)
Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature (2022) (5)
The Almaden Distributed Digital Library System (1995) (4)
Architecture Selection via the Trade-off Between Accuracy and Robustness (2019) (4)
On Clusters in Markov Chains (2006) (4)
Scaffolding Sets (2021) (4)
The Future of the Journal of Privacy and Confidentiality (2018) (3)
Abstracting Fairness: Oracles, Metrics, and Interpretability (2020) (3)
The Distributed Firing Squad Problem (Preliminary Version) (1985) (2)
Zero-Knowledge With Finite State Verifiers (Extended Abstract) (1990) (2)
Decentralized Trust Management (2011) (2)
Con urrent Zero-Knowledge (1999) (2)
Tabular data protection DIFFERENTIALLY PRIVATE MARGINALS RELEASE WITH MUTUAL CONSISTENCY AND ERROR INDEPENDENT OF SAMPLE SIZE (2007) (2)
Competitiveness in distributed algorithms (1994) (1)
Proceedings of the 26th annual international conference on Advances in Cryptology (2006) (1)
Sub-linear Queries Statistical Databases: Privacy with Power (2005) (1)
Privacy in public databases: A foundational approach (2005) (1)
Privacy Against Many Arbitrary Low-sensitivity Queries (2011) (1)
New Insights into Multi-Calibration (2023) (1)
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, August 22-24, 1990 (1990) (1)
Special Section on the Fortieth Annual ACM Symposium On Theory Of Computing (STOC 2008) (2011) (1)
Fighting Spam: The Science (2004) (1)
Differential Privacy and the Power of (Formalizing) Negative Thinking - (Extended Abstract) (2012) (1)
Confidence-ranked reconstruction of census microdata from published statistics (2022) (1)
When and How Can Data be Efficiently Released with Privacy ? (2008) (1)
C Y ] 1 2 A pr 2 02 0 INDIVIDUAL FAIRNESS IN PIPELINES (2021) (0)
Lecture 2: Eigenvalues and Expanders 2.1 Lecture Outline (2005) (0)
A Theoretical View of Adversarial Domain Generalization in the Hierarchical Model Setting (2021) (0)
Pseudo-Randomness and the Crystal Ball (2021) (0)
Zero-knowledge with finite state verifiers (invited talk) (1990) (0)
Acknowledgement to Referees (2005) (0)
LCS / TM-270 0 In I CONSENSUS IN THE PRESENCE Cl OF PARTIAL SYNCHRONY-( PRELIMINARY VERSION ) (0)
Session details: Session 11A (2005) (0)
An Architecture for Provably Secure Computation (2006) (0)
What does it mean to preserve privacy ? (2010) (0)
An Open Letter to the Members of the Massachusetts Legislature Regarding the Adoption of Actuarial Risk Assessment Tools in the Criminal Justice System (2017) (0)
Combatting Junk Mail (1993) (0)
Reply to Sanchéz et al.: Multiplicity does not protect privacy (2023) (0)
A method and computer program for reducing unwanted and unsolicited electronic reports (2004) (0)
HappyMap: A Generalized Multi-calibration Method (2023) (0)
M ay 2 01 8 Privacy-preserving Prediction (0)
Great expectations. (1983) (0)
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations (2015) (0)
Distributed computing (1995) (0)
Magic Functions In Memoriam (2014) (0)
2 Preliminary Definitions and Assumptions 2 . 1 Shared Terminology (2018) (0)
Session details: Session 15A (2005) (0)
Lecture 7: Expander Constructions (zig-zag Expanders) 7.1 Lecture Outline (2005) (0)
From Pseudorandomness to Multi-Group Fairness and Back (2023) (0)
Lecture 1: Expanders - an Introduction (2005) (0)
Distributed computing column (1990) (0)
Reminiscences (2018) (0)
Collective Consistency (Work in Progress, Abstract). (1996) (0)
Coalition Petition to the U.S. Department of Education to Amend 34 CFR Part 99 to Establish a Data Security Rule (2016) (0)
Collective consistency work in progress (1996) (0)
Differential Privacy in Distributed Environments: An Overview and Open Questions (2021) (0)
Session details: 5A (2008) (0)
PUpping Persuasively in CODstant Expeeted Time (Preliminary version) (1986) (0)
Session details: Invited talk (2008) (0)
Improved Generalization Guarantees in Restricted Data Models (2022) (0)
Distrust of Artificial Intelligence: Sources & Responses from Computer Science & Law (2022) (0)
CS 369 E : Expanders in Computer Science (2005) (0)
Bounds on Oblivious, Conservative Matrix Transposition Networks (1983) (0)
Non-Malleability : An Introduction and Survey of Recent Developments (2006) (0)
Workshop Proposal: Statistical and Learning-Theoretic Challenges in Data Privacy (2010) (0)
Distributed computing column (1996) (0)
Flipping Persuasively in Constant Expected Time (Preliminary Version) (1986) (0)

This paper list is powered by the following services:

Other Resources About Cynthia Dwork

en.wikipedia.org

What Schools Are Affiliated With Cynthia Dwork?

Cynthia Dwork is affiliated with the following schools:

Image Attributions

Image Source for Cynthia Dwork