dblp.uni-trier.dewww.uni-trier.de

Cynthia Dwork Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
102EECynthia Dwork, Jing Lei: Differential privacy and robust statistics. STOC 2009: 371-380
101EECynthia 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
100EECynthia Dwork: The Differential Privacy Frontier (Extended Abstract). TCC 2009: 496-502
99EECynthia 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
97EECynthia Dwork, Sergey Yekhanin: New Efficient Attacks on Statistical Disclosure Control Mechanisms. CRYPTO 2008: 469-480
96EECynthia Dwork: Differential Privacy: A Survey of Results. TAMC 2008: 1-19
2007
95EECynthia Dwork: Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis. ICDT 2007: 18-27
94EEBoaz 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
93EECynthia Dwork: An Ad Omnia Approach to Defining and Achieving Private Data Analysis. PinKDD 2007: 1-13
92EECynthia Dwork, Frank McSherry, Kunal Talwar: The price of privacy and the limits of LP decoding. STOC 2007: 85-94
91EELars Backstrom, Cynthia Dwork, Jon M. Kleinberg: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. WWW 2007: 181-190
90EEMikló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)
89EECynthia 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
87EECynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor: Our Data, Ourselves: Privacy Via Distributed Noise Generation. EUROCRYPT 2006: 486-503
86EECynthia Dwork: Differential Privacy. ICALP (2) 2006: 1-12
85EENir Ailon, Steve Chien, Cynthia Dwork: On Clusters in Markov Chains. LATIN 2006: 43-55
84EEMiklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer: An Architecture for Provably Secure Computation. LATIN 2006: 56-67
83EECynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith: Calibrating Noise to Sensitivity in Private Data Analysis. TCC 2006: 265-284
2005
82EECynthia Dwork, Moni Naor, Hoeteck Wee: Pebbling and Proofs of Work. CRYPTO 2005: 37-54
81EECynthia Dwork: Sub-linear Queries Statistical Databases: Privacy with Power. CT-RSA 2005: 1-6
80EEAvrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim: Practical privacy: the SuLQ framework. PODS 2005: 128-138
79EEShuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee: Toward Privacy in Public Databases. TCC 2005: 363-385
78EEShuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar: On Privacy-Preserving Histograms. UAI 2005
77EECynthia Dwork: Nonmalleability. Encyclopedia of Cryptography and Security 2005
2004
76EECynthia Dwork, Kobbi Nissim: Privacy-Preserving Datamining on Vertically Partitioned Databases. CRYPTO 2004: 528-544
75EECynthia Dwork, Moni Naor, Omer Reingold: Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT 2004: 342-360
74EECynthia Dwork: Fighting Spam: The Science. LATIN 2004: 3-4
73EECynthia 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
72EECynthia Dwork, Moni Naor, Amit Sahai: Concurrent zero-knowledge. J. ACM 51(6): 851-898 (2004)
2003
71EECynthia 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)
69EECynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer: Magic Functions. J. ACM 50(6): 852-921 (2003)
2002
68EECynthia Dwork, Larry J. Stockmeyer: 2-round zero knowledge and proof auditors. STOC 2002: 322-331
67EECynthia Dwork, Moni Naor: Zaps and Their Applications Electronic Colloquium on Computational Complexity (ECCC)(001): (2002)
2001
66EECynthia 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
64EECynthia 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
62EECynthia 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
60EECynthia Dwork, Amit Sahai: Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. CRYPTO 1998: 442-457
59EECynthia Dwork, Moni Naor, Amit Sahai: Concurrent Zero-Knowledge. STOC 1998: 409-418
58EECynthia Dwork, Moni Naor: An Efficient Existentially Unforgeable Signature Scheme and Its Applications. J. Cryptology 11(3): 187-208 (1998)
57EECynthia Dwork, Joseph Y. Halpern, Orli Waarts: Performing Work Efficiently in the Presence of Faults. SIAM J. Comput. 27(5): 1457-1491 (1998)
1997
56EERan Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky: Deniable Encryption. CRYPTO 1997: 90-104
55EECynthia Dwork: Positive Applications of Lattices to Cryptography. MFCS 1997: 44-51
54EEMiklós Ajtai, Cynthia Dwork: A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence. STOC 1997: 284-293
53EECynthia 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
50EECynthia Dwork, Jeffrey B. Lotspiech, Moni Naor: Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). STOC 1996: 489-498
49EECynthia Dwork, Ching-Tien Ho, H. Raymond Strong: Collective Consistency. WDAG 1996: 234-250
48EEMikló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
46EECynthia 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
43EEHagit 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
41EECynthia Dwork, Maurice Herlihy, Orli Waarts: Contention in shared memory algorithms. STOC 1993: 174-183
40EEDanny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung: Perfectly Secure Message Transmission. J. ACM 40(1): 17-47 (1993)
1992
39EECynthia Dwork, Moni Naor: Pricing via Processing or Combatting Junk Mail. CRYPTO 1992: 139-147
38EECynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra: Low Communication 2-Prover Zero-Knowledge Proofs for NP. CRYPTO 1992: 215-227
37EECynthia 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)
33EECynthia Dwork, Larry J. Stockmeyer: Finite State Verifiers I: The Power of Interaction. J. ACM 39(4): 800-828 (1992)
32EECynthia Dwork, Larry J. Stockmeyer: Finite State Verifiers II: Zero Knowledge. J. ACM 39(4): 829-858 (1992)
1991
31EECynthia 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
26EECynthia 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
20EECynthia Dwork, Larry J. Stockmeyer: Zero-Knowledge With Finite State Verifiers. CRYPTO 1988: 71-75
19EECynthia 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
15EEDanny Dolev, Cynthia Dwork, Larry J. Stockmeyer: On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77-97 (1987)
1986
14EECynthia 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

Coauthor Index

1Nir Ailon [85]
2Miklós Ajtai [44] [45] [48] [54] [84] [90]
3Laura C. Anderson [47] [52]
4James Aspnes [44] [45]
5Hagit Attiya (Chagit Attiya) [30] [43]
6Lars Backstrom [91]
7Amotz Bar-Noy [16] [34]
8Boaz Barak [94]
9Alan E. Bell [47]
10Avrim Blum [80]
11Stephen K. Boyer [47] [52]
12Ran Canetti [56]
13Kamalika Chaudhuri [94]
14Shuchi Chawla [78] [79]
15Steve Chien [70] [85]
16David M. Choy [47] [52]
17Brian A. Coan [8] [11] [21] [28]
18Stephen Cook [1] [9]
19Richard Dievendorff [47] [52]
20Danny Dolev [2] [4] [8] [15] [16] [21] [27] [29] [34] [40] [63]
21Uriel Feige [38]
22Andrew Goldberg [71]
23Thomas D. Griffin [47] [52]
24Joseph Y. Halpern [36] [57] [64]
25Maurice Herlihy [37] [41] [42] [53] [61]
26C. T. Howard Ho (Howard Ho, Ching-Tien Ho) [49] [51]
27Bruce A. Hoenig [47] [52]
28M. J. Jackson [52]
29W. Kaka [52]
30Satyen Kale [94]
31Paris C. Kanellakis [5] [14] [18]
32Krishnaram Kenthapadi [87]
33Joe Kilian [38]
34Jon M. Kleinberg [91]
35Ravi Kumar (S. Ravi Kumar) [66] [70]
36Richard E. Ladner [98]
37Jing Lei [102]
38Jeffrey B. Lotspiech (Jeffery Lotspiech) [47] [50] [52]
39Nancy A. Lynch [7] [19] [30] [43]
40James M. McCrossin [47] [52]
41Frank McSherry [78] [79] [80] [83] [87] [92] [94]
42Alex M. Miller [47] [52]
43Ilya Mironov [87]
44John C. Mitchell [5]
45Robert J. T. Morris [47] [52]
46Yoram Moses [10] [25]
47Moni Naor [29] [38] [39] [46] [50] [56] [58] [59] [62] [63] [65] [66] [67] [69] [71] [72] [75] [82] [87] [89] [99] [101]
48Kobbi Nissim [76] [80] [83]
49Rafail Ostrovsky [56]
50Norman J. Pass [47] [52]
51David Peleg [12] [17]
52Florian Pestoni [47]
53Deidra S. Picciano [47]
54Nicholas Pippenger [2] [12] [17]
55Serge A. Plotkin [37] [61]
56Omer Reingold [62] [69] [75] [101]
57Rüdiger Reischuk [9]
58Guy N. Rothblum [99] [101]
59Shmuel Safra [38]
60Amit Sahai [59] [60] [72]
61Ronen Shaltiel [73]
62David B. Shmoys [13] [24]
63Daniel R. Simon [70]
64D. Sivakumar [66] [70]
65Dale Skeen [3] [6]
66Adam Smith [73] [79] [83]
67Larry J. Stockmeyer [4] [7] [8] [13] [14] [15] [18] [19] [20] [21] [22] [23] [24] [30] [32] [33] [43] [62] [68] [69] [84]
68H. Raymond Strong [16] [34] [49] [51]
69Kunal Talwar [78] [92] [94]
70Luca Trevisan [73]
71Eli Upfal [12] [17]
72Salil P. Vadhan [101]
73Vinod Vaikuntanathan (V. Vinod) [99]
74Orli Waarts [27] [35] [36] [37] [40] [41] [42] [44] [45] [53] [57] [61] [64]
75Hoeteck Wee [79] [82]
76Avi Wigderson [2]
77Sergey Yekhanin [97]
78Moti Yung (Mordechai M. Yung) [27] [40]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)