#### Filter Results:

#### Publication Year

2008

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Johannes Gehrke, Edward Lui, Rafael Pass
- TCC
- 2011

We put forward a zero-knowledge based definition of privacy. Our notion is strictly stronger than the notion of differential privacy and is particularly attractive when modeling privacy in social networks. We furthermore demonstrate that it can be meaningfully achieved for tasks such as computing averages, fractions, histograms, and a variety of graph… (More)

- Johannes Gehrke, Michael Hay, Edward Lui, Rafael Pass
- IACR Cryptology ePrint Archive
- 2012

We introduce a new definition of privacy called crowd-blending privacy that strictly relaxes the notion of differential privacy. Roughly speaking, k-crowd blending private sanitization of a database requires that each individual i in the database " blends " with k other individuals j in the database, in the sense that the output of the sanitizer is "… (More)

- Kai-Min Chung, Edward Lui, Rafael Pass
- TCC
- 2013

The notion of zero-knowledge [GMR85] is formalized by requiring that for every malicious efficient verifier V * , there exists an efficient simulator S that can reconstruct the view of V * in a true interaction with the prover, in a way that is indistinguishable to every polynomial-time distinguisher. Weak zero-knowledge weakens this notions by switching… (More)

- Kai-Min Chung, Edward Lui, Mohammad Mahmoody, Rafael Pass
- IACR Cryptology ePrint Archive
- 2012

Goldreich and Oren (JoC'94) show that only trivial languages have 2-message zero-knowledge arguments. In this note we consider weaker, super-polynomial-time simulation (SPS), notions of zero-knowledge. We present barriers to using black-box reductions for demonstrating soundness of 2-message protocols with efficient prover strategies satisfying SPS… (More)

- Edward Lui, Rafael Pass
- TCC
- 2014

We introduce a generalization of differential privacy called tailored differential privacy, where an individual's privacy parameter is " tailored " for the individual based on the individual's data and the data set. In this paper, we focus on a natural instance of tailored differential privacy, which we call outlier privacy: an individual's privacy… (More)

- Kai-Min Chung, Edward Lui, Rafael Pass
- ITCS
- 2013

How do we test if a weather forecaster actually knows something about whether it will rain or not? Intuitively, a "good" forecast test should be <i>complete</i>---namely, a forecaster knowing the distribution of Nature should be able to pass the test with high probability, and <i>sound</i>---an uninformed forecaster should only be able to pass the test with… (More)

- Katy L. Huberty, François Meunier, +22 authors Markus Almerud

Morgan Stanley does and seeks to do business with companies covered in Morgan Stanley Research. As a result, investors should be aware that the firm may have a conflict of interest that could affect the objectivity of Morgan Stanley Research. Investors should consider Morgan Stanley Research as only a single factor in making their investment decision. For… (More)

- Samantha Leung, Edward Lui, Rafael Pass
- ITCS
- 2015

The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. Similar impossibility results hold even if we consider a weaker notion of strategy-proofness where voters believe that the other voters' preferences are i.i.d. (independent and identically distributed). In this… (More)

- Samantha Leung, Edward Lui
- WINE
- 2012

Recently, there has been a number of papers relating mechanism design and privacy (e.g., see [MT07, Xia11, CCK + 11, NST12, NOS12, HK12]). All of these papers consider a worst-case setting where there is no probabilistic information about the players' types. In this paper, we investigate mechanism design and privacy in the Bayesian setting, where the… (More)

- Edward Lui
- 2008

A graph G is said to be double-critical if G is connected and the chromatic number of G decreases by 2 when any two adjacent vertices of G are removed. In 1966, Lovász conjectured that the only k-chromatic double-critical graph is K k. The conjecture has been resolved for k ≤ 5 but remains open for k ≥ 6. In this paper, we prove various properties of… (More)