Cynthia Dwork

According to our database1, Cynthia Dwork authored at least 126 papers between 1982 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2015, "For contributions to the science of database privacy, cryptography, and distributed computing.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Differential Privacy and the US Census.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Fairness Under Composition.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
Composable and versatile privacy via truncated CDP.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Decoupled Classifiers for Group-Fair and Efficient Machine Learning.
Proceedings of the Conference on Fairness, Accountability and Transparency, 2018

Privacy-preserving Prediction.
Proceedings of the Conference On Learning Theory, 2018

2017
Guilt-free data reuse.
Commun. ACM, 2017

What's Fair?
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

2016
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations.
Discrete & Computational Geometry, 2015

Preserving Statistical Validity in Adaptive Data Analysis.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Generalization in Adaptive Data Analysis and Holdout Reuse.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Robust Traceability from Trace Amounts.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Pure Differential Privacy for Rectangle Queries via Private Partitions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
The Algorithmic Foundations of Differential Privacy.
Foundations and Trends in Theoretical Computer Science, 2014

Analyze gauss: optimal bounds for privacy-preserving principal component analysis.
Proceedings of the Symposium on Theory of Computing, 2014

Using Convex Relaxations for Efficiently and Privately Releasing Marginals.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Toward practicing privacy.
JAMIA, 2013

Learning Fair Representations.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Differential Privacy and the Power of (Formalizing) Negative Thinking - (Extended Abstract).
Proceedings of the Principles of Security and Trust - First International Conference, 2012

Fairness through awareness.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

The Privacy of the Analyst and the Power of the State.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Non-Malleability.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Special Section on the Fortieth Annual ACM Symposium On Theory Of Computing (STOC 2008).
SIAM J. Comput., 2011

A firm foundation for private data analysis.
Commun. ACM, 2011

The Promise of Differential Privacy: A Tutorial on Algorithmic Techniques.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Differential privacy under continual observation.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Differential Privacy in New Settings.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Pan-Private Streaming Algorithms.
Proceedings of the Innovations in Computer Science, 2010

Boosting and Differential Privacy.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
How Efficient Can Memory Checking Be?.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

The Differential Privacy Frontier (Extended Abstract).
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

On the complexity of differentially private data release: efficient algorithms and hardness results.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Differential privacy and robust statistics.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Differential Privacy: A Survey of Results.
Proceedings of the Theory and Applications of Models of Computation, 2008

New Efficient Attacks on Statistical Disclosure Control Mechanisms.
Proceedings of the Advances in Cryptology, 2008

2007
The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence..
Electronic Colloquium on Computational Complexity (ECCC), 2007

Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography.
Proceedings of the 16th International Conference on World Wide Web, 2007

The price of privacy and the limits of LP decoding.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Privacy, accuracy, and consistency too: a holistic solution to contingency table release.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

An Ad Omnia Approach to Defining and Achieving Private Data Analysis.
Proceedings of the Privacy, 2007

Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis.
Proceedings of the Database Theory, 2007

2006
Calibrating Noise to Sensitivity in Private Data Analysis.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

An Architecture for Provably Secure Computation.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

On Clusters in Markov Chains.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Differential Privacy.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Our Data, Ourselves: Privacy Via Distributed Noise Generation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

2005
Nonmalleability.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

On Privacy-Preserving Histograms.
Proceedings of the UAI '05, 2005

Toward Privacy in Public Databases.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Practical privacy: the SuLQ framework.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Sub-linear Queries Statistical Databases: Privacy with Power.
Proceedings of the Topics in Cryptology, 2005

Pebbling and Proofs of Work.
Proceedings of the Advances in Cryptology, 2005

2004
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Fighting Spam: The Science.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Immunizing Encryption Schemes from Decryption Errors.
Proceedings of the Advances in Cryptology, 2004

Privacy-Preserving Datamining on Vertically Partitioned Databases.
Proceedings of the Advances in Cryptology, 2004

2003
Nonmalleable Cryptography.
SIAM Review, 2003

Link Evolution: Analysis and Algorithms.
Internet Mathematics, 2003

On Memory-Bound Functions for Fighting Spam.
Proceedings of the Advances in Cryptology, 2003

2002
Zaps and Their Applications
Electronic Colloquium on Computational Complexity (ECCC), 2002

2-round zero knowledge and proof auditors.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001
Rank aggregation methods for the Web.
Proceedings of the Tenth International World Wide Web Conference, 2001

2000
Nonmalleable Cryptography.
SIAM J. Comput., 2000

Zaps and Their Applications.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Magic Functions.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
Concurrent Zero-Knowledge.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints.
Proceedings of the Advances in Cryptology, 1998

1997
A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Positive Applications of Lattices to Cryptography.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Deniable Encryption.
Proceedings of the Advances in Cryptology, 1997

1996
Distributed computing column.
SIGACT News, 1996

A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence
Electronic Colloquium on Computational Complexity (ECCC), 1996

Collective Consistency.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Collective Consistency (Work in Progress, Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

A Digital Library System for Periodicals Distribution.
Proceedings of the Third Forum on Research and Technology Advances in Digital Library, 1996

1995
Distributed computing.
SIGACT News, 1995


1994
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty.
J. ACM, 1994

Competitiveness in Distributed Algorithms.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

A Theory of Competitive Analysis for Distributed Algorithms
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

An Efficient Existentially Unforgeable Signature Scheme and its Applications.
Proceedings of the Advances in Cryptology, 1994

1993
Perfectly Secure Message Transmission.
J. ACM, 1993

Contention in shared memory algorithms.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Bounded Round Numbers.
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992
Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement
Inf. Comput., April, 1992

Finite State Verifiers II: Zero Knowledge.
J. ACM, 1992

Finite State Verifiers I: The Power of Interaction.
J. ACM, 1992

Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Performing Work Efficiently in the Presence of Faults.
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

Time-Lapse Snapshots.
Proceedings of the Theory of Computing and Systems, 1992

Pricing via Processing or Combatting Junk Mail.
Proceedings of the Advances in Cryptology, 1992

Low Communication 2-Prover Zero-Knowledge Proofs for NP.
Proceedings of the Advances in Cryptology, 1992

1991
Simultaneity Is Harder than Agreement
Inf. Comput., April, 1991

Non-Malleable Cryptography (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

On Verification in Secret Sharing.
Proceedings of the Advances in Cryptology, 1991

1990
Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures
Inf. Comput., October, 1990

Distributed computing column.
SIGACT News, 1990

Flipping Persuasively in Constant Time.
SIAM J. Comput., 1990

A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata.
SIAM J. Comput., 1990

Strong Verifiable Secret Sharing (Extended Abstract).
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Perfectly Secure Message Transmission
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Distributed computing column.
SIGACT News, 1989

The Distributed Firing Squad Problem.
SIAM J. Comput., 1989

Randomization in Byzantine Agreement.
Advances in Computing Research, 1989

On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Fault Tolerance in Networks of Bounded Degree.
SIAM J. Comput., 1988

Consensus in the presence of partial synchrony.
J. ACM, 1988

Zero-Knowledge With Finite State Verifiers.
Proceedings of the Advances in Cryptology, 1988

1987
On the minimal synchronism needed for distributed consensus.
J. ACM, 1987

Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1986
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes.
SIAM J. Comput., 1986

Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures.
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

Fault Tolerance in Networks of Bounded Degree (Preliminary Version)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Simultaneity is Harder than Agreement.
Proceedings of the Fifth Symposium on Reliability in Distributed Software and Database Systems, 1986

Flipping Persuasively in Constant Expected Time (Preliminary Version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Parallel Algorithms for Term Matching.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985
The Distributed Firing Squad Problem (Preliminary Version)
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984
On the Sequential Nature of Unification.
J. Log. Program., 1984

Patterns of Communication in Consensus Protocols.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

Consensus in the Presence of Partial Synchrony (Preliminary Version).
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1983
Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

The Inherent Cost of Nonblocking Commitment.
Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983

On the Minimal Synchronism Needed for Distributed Consensus
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
Bounds on the Time for Parallel RAM's to Compute Simple Functions
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982


  Loading...