| 2009 |
|---|
| 100 | EE | Cynthia Dwork:
The Differential Privacy Frontier (Extended Abstract).
TCC 2009: 496-502 |
| 99 | EE | Cynthia Dwork,
Moni Naor,
Guy N. Rothblum,
Vinod Vaikuntanathan:
How Efficient Can Memory Checking Be?.
TCC 2009: 503-520 |
| 2008 |
|---|
| 98 | | Richard E. Ladner,
Cynthia Dwork:
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008
ACM 2008 |
| 97 | EE | Cynthia Dwork,
Sergey Yekhanin:
New Efficient Attacks on Statistical Disclosure Control Mechanisms.
CRYPTO 2008: 469-480 |
| 96 | EE | Cynthia Dwork:
Differential Privacy: A Survey of Results.
TAMC 2008: 1-19 |
| 2007 |
|---|
| 95 | EE | Cynthia Dwork:
Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis.
ICDT 2007: 18-27 |
| 94 | EE | 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 |
| 93 | EE | Cynthia Dwork:
An Ad Omnia Approach to Defining and Achieving Private Data Analysis.
PinKDD 2007: 1-13 |
| 92 | EE | Cynthia Dwork,
Frank McSherry,
Kunal Talwar:
The price of privacy and the limits of LP decoding.
STOC 2007: 85-94 |
| 91 | EE | Lars Backstrom,
Cynthia Dwork,
Jon M. Kleinberg:
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography.
WWW 2007: 181-190 |
| 90 | EE | Miklós Ajtai,
Cynthia Dwork:
The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence..
Electronic Colloquium on Computational Complexity (ECCC) 14(097): (2007) |
| 89 | EE | Cynthia Dwork,
Moni Naor:
Zaps and Their Applications.
SIAM J. Comput. 36(6): 1513-1543 (2007) |
| 2006 |
|---|
| 88 | | Cynthia Dwork:
Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings
Springer 2006 |
| 87 | EE | Cynthia Dwork,
Krishnaram Kenthapadi,
Frank McSherry,
Ilya Mironov,
Moni Naor:
Our Data, Ourselves: Privacy Via Distributed Noise Generation.
EUROCRYPT 2006: 486-503 |
| 86 | EE | Cynthia Dwork:
Differential Privacy.
ICALP (2) 2006: 1-12 |
| 85 | EE | Nir Ailon,
Steve Chien,
Cynthia Dwork:
On Clusters in Markov Chains.
LATIN 2006: 43-55 |
| 84 | EE | Miklós Ajtai,
Cynthia Dwork,
Larry J. Stockmeyer:
An Architecture for Provably Secure Computation.
LATIN 2006: 56-67 |
| 83 | EE | Cynthia Dwork,
Frank McSherry,
Kobbi Nissim,
Adam Smith:
Calibrating Noise to Sensitivity in Private Data Analysis.
TCC 2006: 265-284 |
| 2005 |
|---|
| 82 | EE | Cynthia Dwork,
Moni Naor,
Hoeteck Wee:
Pebbling and Proofs of Work.
CRYPTO 2005: 37-54 |
| 81 | EE | Cynthia Dwork:
Sub-linear Queries Statistical Databases: Privacy with Power.
CT-RSA 2005: 1-6 |
| 80 | EE | Avrim Blum,
Cynthia Dwork,
Frank McSherry,
Kobbi Nissim:
Practical privacy: the SuLQ framework.
PODS 2005: 128-138 |
| 79 | EE | Shuchi Chawla,
Cynthia Dwork,
Frank McSherry,
Adam Smith,
Hoeteck Wee:
Toward Privacy in Public Databases.
TCC 2005: 363-385 |
| 78 | EE | Shuchi Chawla,
Cynthia Dwork,
Frank McSherry,
Kunal Talwar:
On Privacy-Preserving Histograms.
UAI 2005 |
| 77 | EE | Cynthia Dwork:
Nonmalleability.
Encyclopedia of Cryptography and Security 2005 |
| 2004 |
|---|
| 76 | EE | Cynthia Dwork,
Kobbi Nissim:
Privacy-Preserving Datamining on Vertically Partitioned Databases.
CRYPTO 2004: 528-544 |
| 75 | EE | Cynthia Dwork,
Moni Naor,
Omer Reingold:
Immunizing Encryption Schemes from Decryption Errors.
EUROCRYPT 2004: 342-360 |
| 74 | EE | Cynthia Dwork:
Fighting Spam: The Science.
LATIN 2004: 3-4 |
| 73 | EE | Cynthia Dwork,
Ronen Shaltiel,
Adam Smith,
Luca Trevisan:
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.
TCC 2004: 101-120 |
| 72 | EE | Cynthia Dwork,
Moni Naor,
Amit Sahai:
Concurrent zero-knowledge.
J. ACM 51(6): 851-898 (2004) |
| 2003 |
|---|
| 71 | EE | Cynthia Dwork,
Andrew Goldberg,
Moni Naor:
On Memory-Bound Functions for Fighting Spam.
CRYPTO 2003: 426-444 |
| 70 | | Steve Chien,
Cynthia Dwork,
Ravi Kumar,
Daniel R. Simon,
D. Sivakumar:
Link Evolution: Analysis and Algorithms.
Internet Mathematics 1(3): (2003) |
| 69 | EE | Cynthia Dwork,
Moni Naor,
Omer Reingold,
Larry J. Stockmeyer:
Magic Functions.
J. ACM 50(6): 852-921 (2003) |
| 2002 |
|---|
| 68 | EE | Cynthia Dwork,
Larry J. Stockmeyer:
2-round zero knowledge and proof auditors.
STOC 2002: 322-331 |
| 67 | EE | Cynthia Dwork,
Moni Naor:
Zaps and Their Applications
Electronic Colloquium on Computational Complexity (ECCC)(001): (2002) |
| 2001 |
|---|
| 66 | EE | Cynthia Dwork,
Ravi Kumar,
Moni Naor,
D. Sivakumar:
Rank aggregation methods for the Web.
WWW 2001: 613-622 |
| 2000 |
|---|
| 65 | | Cynthia Dwork,
Moni Naor:
Zaps and Their Applications.
FOCS 2000: 283-293 |
| 64 | EE | Cynthia Dwork,
Joseph Y. Halpern,
Orli Waarts:
Performing work efficiently in the presence of faults
CoRR cs.DC/0006008: (2000) |
| 63 | | Danny Dolev,
Cynthia Dwork,
Moni Naor:
Nonmalleable Cryptography.
SIAM J. Comput. 30(2): 391-437 (2000) |
| 1999 |
|---|
| 62 | EE | Cynthia Dwork,
Moni Naor,
Omer Reingold,
Larry J. Stockmeyer:
Magic Functions.
FOCS 1999: 523-534 |
| 61 | | Cynthia Dwork,
Maurice Herlihy,
Serge A. Plotkin,
Orli Waarts:
Time-Lapse Snapshots.
SIAM J. Comput. 28(5): 1848-1874 (1999) |
| 1998 |
|---|
| 60 | EE | Cynthia Dwork,
Amit Sahai:
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints.
CRYPTO 1998: 442-457 |
| 59 | EE | Cynthia Dwork,
Moni Naor,
Amit Sahai:
Concurrent Zero-Knowledge.
STOC 1998: 409-418 |
| 58 | EE | Cynthia Dwork,
Moni Naor:
An Efficient Existentially Unforgeable Signature Scheme and Its Applications.
J. Cryptology 11(3): 187-208 (1998) |
| 57 | EE | Cynthia Dwork,
Joseph Y. Halpern,
Orli Waarts:
Performing Work Efficiently in the Presence of Faults.
SIAM J. Comput. 27(5): 1457-1491 (1998) |
| 1997 |
|---|
| 56 | EE | Ran Canetti,
Cynthia Dwork,
Moni Naor,
Rafail Ostrovsky:
Deniable Encryption.
CRYPTO 1997: 90-104 |
| 55 | | Cynthia Dwork:
Positive Applications of Lattices to Cryptography.
MFCS 1997: 44-51 |
| 54 | EE | Miklós Ajtai,
Cynthia Dwork:
A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence.
STOC 1997: 284-293 |
| 53 | EE | Cynthia Dwork,
Maurice Herlihy,
Orli Waarts:
Contention in shared memory algorithms.
J. ACM 44(6): 779-805 (1997) |
| 1996 |
|---|
| 52 | | 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 |
| 51 | | Cynthia Dwork,
Ching-Tien Ho,
H. Raymond Strong:
Collective Consistency (Work in Progress, Abstract).
PODC 1996: 341 |
| 50 | EE | Cynthia Dwork,
Jeffrey B. Lotspiech,
Moni Naor:
Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version).
STOC 1996: 489-498 |
| 49 | | Cynthia Dwork,
Ching-Tien Ho,
H. Raymond Strong:
Collective Consistency.
WDAG 1996: 234-250 |
| 48 | EE | Miklós Ajtai,
Cynthia Dwork:
A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence
Electronic Colloquium on Computational Complexity (ECCC) 3(65): (1996) |
| 1995 |
|---|
| 47 | | 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 |
|---|
| 46 | EE | Cynthia Dwork,
Moni Naor:
An Efficient Existentially Unforgeable Signature Scheme and its Applications.
CRYPTO 1994: 234-246 |
| 45 | | Miklós Ajtai,
James Aspnes,
Cynthia Dwork,
Orli Waarts:
A Theory of Competitive Analysis for Distributed Algorithms
FOCS 1994: 401-411 |
| 44 | | Miklós Ajtai,
James Aspnes,
Cynthia Dwork,
Orli Waarts:
Competitiveness in Distributed Algorithms.
PODC 1994: 398 |
| 43 | EE | 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) |
| 1993 |
|---|
| 42 | | Cynthia Dwork,
Maurice Herlihy,
Orli Waarts:
Bounded Round Numbers.
PODC 1993: 53-64 |
| 41 | EE | Cynthia Dwork,
Maurice Herlihy,
Orli Waarts:
Contention in shared memory algorithms.
STOC 1993: 174-183 |
| 40 | EE | Danny Dolev,
Cynthia Dwork,
Orli Waarts,
Moti Yung:
Perfectly Secure Message Transmission.
J. ACM 40(1): 17-47 (1993) |
| 1992 |
|---|
| 39 | EE | Cynthia Dwork,
Moni Naor:
Pricing via Processing or Combatting Junk Mail.
CRYPTO 1992: 139-147 |
| 38 | EE | Cynthia Dwork,
Uriel Feige,
Joe Kilian,
Moni Naor,
Shmuel Safra:
Low Communication 2-Prover Zero-Knowledge Proofs for NP.
CRYPTO 1992: 215-227 |
| 37 | | Cynthia Dwork,
Maurice Herlihy,
Serge A. Plotkin,
Orli Waarts:
Time-Lapse Snapshots.
ISTCS 1992: 154-170 |
| 36 | | Cynthia Dwork,
Joseph Y. Halpern,
Orli Waarts:
Performing Work Efficiently in the Presence of Faults.
PODC 1992: 91-102 |
| 35 | | Cynthia Dwork,
Orli Waarts:
Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!
STOC 1992: 655-666 |
| 34 | | 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) |
| 33 | EE | Cynthia Dwork,
Larry J. Stockmeyer:
Finite State Verifiers I: The Power of Interaction.
J. ACM 39(4): 800-828 (1992) |
| 32 | EE | Cynthia Dwork,
Larry J. Stockmeyer:
Finite State Verifiers II: Zero Knowledge.
J. ACM 39(4): 829-858 (1992) |
| 1991 |
|---|
| 31 | EE | Cynthia Dwork:
On Verification in Secret Sharing.
CRYPTO 1991: 114-128 |
| 30 | | 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 |
| 29 | | Danny Dolev,
Cynthia Dwork,
Moni Naor:
Non-Malleable Cryptography (Extended Abstract)
STOC 1991: 542-552 |
| 28 | | Brian A. Coan,
Cynthia Dwork:
Simultaneity Is Harder than Agreement
Inf. Comput. 91(2): 205-231 (1991) |
| 1990 |
|---|
| 27 | | Danny Dolev,
Cynthia Dwork,
Orli Waarts,
Moti Yung:
Perfectly Secure Message Transmission
FOCS 1990: 36-45 |
| 26 | | Cynthia Dwork:
Strong Verifiable Secret Sharing (Extended Abstract).
WDAG 1990: 213-227 |
| 25 | | Cynthia Dwork,
Yoram Moses:
Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures
Inf. Comput. 88(2): 156-186 (1990) |
| 24 | | Cynthia Dwork,
David B. Shmoys,
Larry J. Stockmeyer:
Flipping Persuasively in Constant Time.
SIAM J. Comput. 19(3): 472-499 (1990) |
| 23 | | Cynthia Dwork,
Larry J. Stockmeyer:
A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata.
SIAM J. Comput. 19(6): 1011-1023 (1990) |
| 1989 |
|---|
| 22 | | Cynthia Dwork,
Larry J. Stockmeyer:
On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract)
FOCS 1989: 480-485 |
| 21 | | Brian A. Coan,
Danny Dolev,
Cynthia Dwork,
Larry J. Stockmeyer:
The Distributed Firing Squad Problem.
SIAM J. Comput. 18(5): 990-1012 (1989) |
| 1988 |
|---|
| 20 | EE | Cynthia Dwork,
Larry J. Stockmeyer:
Zero-Knowledge With Finite State Verifiers.
CRYPTO 1988: 71-75 |
| 19 | EE | Cynthia Dwork,
Nancy A. Lynch,
Larry J. Stockmeyer:
Consensus in the presence of partial synchrony.
J. ACM 35(2): 288-323 (1988) |
| 18 | | Cynthia Dwork,
Paris C. Kanellakis,
Larry J. Stockmeyer:
Parallel Algorithms for Term Matching.
SIAM J. Comput. 17(4): 711-731 (1988) |
| 17 | | Cynthia Dwork,
David Peleg,
Nicholas Pippenger,
Eli Upfal:
Fault Tolerance in Networks of Bounded Degree.
SIAM J. Comput. 17(5): 975-988 (1988) |
| 1987 |
|---|
| 16 | | 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 |
| 15 | EE | Danny Dolev,
Cynthia Dwork,
Larry J. Stockmeyer:
On the minimal synchronism needed for distributed consensus.
J. ACM 34(1): 77-97 (1987) |
| 1986 |
|---|
| 14 | | Cynthia Dwork,
Paris C. Kanellakis,
Larry J. Stockmeyer:
Parallel Algorithms for Term Matching.
CADE 1986: 416-430 |
| 13 | | Cynthia Dwork,
David B. Shmoys,
Larry J. Stockmeyer:
Flipping Persuasively in Constant Expected Time (Preliminary Version)
FOCS 1986: 222-232 |
| 12 | | Cynthia Dwork,
David Peleg,
Nicholas Pippenger,
Eli Upfal:
Fault Tolerance in Networks of Bounded Degree (Preliminary Version)
STOC 1986: 370-379 |
| 11 | | Brian A. Coan,
Cynthia Dwork:
Simultaneity is Harder than Agreement.
Symposium on Reliability in Distributed Software and Database Systems 1986: 141-150 |
| 10 | | Cynthia Dwork,
Yoram Moses:
Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures.
TARK 1986: 149-169 |
| 9 | | Stephen 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) |
| 1985 |
|---|
| 8 | | Brian A. Coan,
Danny Dolev,
Cynthia Dwork,
Larry J. Stockmeyer:
The Distributed Firing Squad Problem (Preliminary Version)
STOC 1985: 335-345 |
| 1984 |
|---|
| 7 | | Cynthia Dwork,
Nancy A. Lynch,
Larry J. Stockmeyer:
Consensus in the Presence of Partial Synchrony (Preliminary Version).
PODC 1984: 103-118 |
| 6 | | Cynthia Dwork,
Dale Skeen:
Patterns of Communication in Consensus Protocols.
PODC 1984: 143-153 |
| 5 | | Cynthia Dwork,
Paris C. Kanellakis,
John C. Mitchell:
On the Sequential Nature of Unification.
J. Log. Program. 1(1): 35-50 (1984) |
| 1983 |
|---|
| 4 | | Danny Dolev,
Cynthia Dwork,
Larry J. Stockmeyer:
On the Minimal Synchronism Needed for Distributed Consensus
FOCS 1983: 393-402 |
| 3 | | Cynthia Dwork,
Dale Skeen:
The Inherent Cost of Nonblocking Commitment.
PODC 1983: 1-11 |
| 2 | | Danny Dolev,
Cynthia Dwork,
Nicholas Pippenger,
Avi Wigderson:
Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version)
STOC 1983: 42-51 |
| 1982 |
|---|
| 1 | | Stephen Cook,
Cynthia Dwork:
Bounds on the Time for Parallel RAM's to Compute Simple Functions
STOC 1982: 231-233 |
