default search action
Cynthia Dwork
- > Home > Persons > Cynthia Dwork
Publications
- 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 - [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
- [c85]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum:
Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) 2015: 735-751 - 2012
- [c78]Cynthia Dwork, Moni Naor, Salil P. Vadhan:
The Privacy of the Analyst and the Power of the State. FOCS 2012: 400-409 - 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) - [c73]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin:
Pan-Private Streaming Algorithms. ICS 2010: 66-80 - [c71]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum:
Differential privacy under continual observation. STOC 2010: 715-724 - 2009
- [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 - [c67]Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan:
How Efficient Can Memory Checking Be?. TCC 2009: 503-520 - 2007
- [j31]Cynthia Dwork, Moni Naor:
Zaps and Their Applications. SIAM J. Comput. 36(6): 1513-1543 (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 - 2005
- [c54]Cynthia Dwork, Moni Naor, Hoeteck Wee:
Pebbling and Proofs of Work. CRYPTO 2005: 37-54 - 2004
- [j30]Cynthia Dwork, Moni Naor, Amit Sahai:
Concurrent zero-knowledge. J. ACM 51(6): 851-898 (2004) - [c48]Cynthia Dwork, Moni Naor, Omer Reingold:
Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT 2004: 342-360 - 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
- [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 - 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) - [c39]Cynthia Dwork, Moni Naor, Amit Sahai:
Concurrent Zero-Knowledge. STOC 1998: 409-418 - 1997
- [c38]Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
Deniable Encryption. CRYPTO 1997: 90-104 - 1996
- [c33]Cynthia Dwork, Jeffrey B. Lotspiech, Moni Naor:
Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). STOC 1996: 489-498 - [i1]Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
Deniable Encryption. IACR Cryptol. ePrint Arch. 1996: 2 (1996) - 1994
- [c30]Cynthia Dwork, Moni Naor:
An Efficient Existentially Unforgeable Signature Scheme and its Applications. CRYPTO 1994: 234-246 - 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 - 1991
- [c18]Danny Dolev, Cynthia Dwork, Moni Naor:
Non-Malleable Cryptography (Extended Abstract). STOC 1991: 542-552
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 2024-08-21 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint