#### Filter Results:

- Full text PDF available (112)

#### Publication Year

1982

2017

- This year (7)
- Last 5 years (27)
- Last 10 years (53)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith
- TCC
- 2006

We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query function f mapping databases to reals, the so-called true answer is the result of applying f to the database. To protect privacy, the true answer is perturbed by the addition… (More)

- Cynthia Dwork
- ICALP
- 2006

In 1977 Dalenius articulated a desideratum for statistical databases: nothing about an individual should be learnable from the database that cannot be learned without access to the database. We give a general impossibility result showing that a formalization of Dalenius’ goal along the lines of semantic security cannot be achieved. Contrary to intuition, a… (More)

- Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar
- WWW
- 2001

We consider the problem of combining ranking results from various sources. In the context of the Web, the main applications include building meta-search engines, combining ranking functions, selecting documents based on multiple criteria, and improving search precision through word associations. We develop a set of techniques for the rank aggregation… (More)

- Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
- J. ACM
- 1988

The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper bound Δ on the time required for a message to be sent from one processor to another and a known fixed upper bound &PHgr; on the… (More)

- Cynthia Dwork
- TAMC
- 2008

Over the past five years a new approach to privacy-preserving data analysis has born fruit [13, 18, 7, 19, 5, 37, 35, 8, 32]. This approach differs from much (but not all!) of the related literature in the statistics, databases, theory, and cryptography communities, in that a formal and ad omnia privacy guarantee is defined, and the data analysis techniques… (More)

- Cynthia Dwork, Aaron Roth
- Foundations and Trends in Theoretical Computer…
- 2014

The problem of privacy-preserving data analysis has a long history spanning multiple disciplines. As electronic data about individuals becomes increasingly detailed, and as technology enables ever more powerful collection and curation of these data, the need increases for a robust, meaningful, and mathematically rigorous definition of privacy, together with… (More)

- Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg
- WWW
- 2007

In a social network, nodes correspond topeople or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anonymization replaces names with meaningless unique identifiers. We describe a family of attacks such that even from a single anonymized copy of a social network, it is possible for an… (More)

- Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor
- EUROCRYPT
- 2006

In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to create a distributed implementation of the privacy-preserving statistical databases described in recent papers [14, 4, 13]. In these databases, privacy is obtained by perturbing the… (More)

- Danny Dolev, Cynthia Dwork, Moni Naor
- STOC
- 1991

The notion of non-malleable cryptography, an extension of semantically secure cryptography, is defined. Informally, the additional requirement is that given the ciphertext it is impossible to generate a diflerent ciphertext so that the respective plaintexts are related. The same concept makes sense in the contexts of string commitment and zero-knowledge… (More)

- Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
- FOCS
- 1990

This paper studies the problem of perfectly secure communication in general network in which processors and communication lines may be faulty. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms are obtained that operate with this connectivity and rely on no complexity-theoretic assumptions. These… (More)