#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2012

2017

- This year (0)
- Last 5 years (13)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Zahra Jafargholi, Daniel Wichs
- TCC
- 2014

We consider a public and keyless code (Enc,Dec) which is used to encode a message m and derive a codeword c = Enc(m). The codeword can be adversarially tampered via a function f âˆˆ F from someâ€¦ (More)

- Zahra Jafargholi, Emanuele Viola
- Electronic Colloquium on Computational Complexity
- 2013

PÇŽtraÅŸcu (STOC â€™10) reduces the 3SUM problem to listing triangles in a graph. In the other direction, we show that if one can solve 3SUM on a set of size n in time n1+ then one can list t trianglesâ€¦ (More)

- Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin
- CRYPTO
- 2013

We study the classical problem of privacy amplification, where two parties Alice and Bob share a weak secret X of min-entropy k, and wish to agree on secret key R of length m over a publicâ€¦ (More)

A garbling scheme is used to garble a circuit C and an input x in a way that reveals the output C(x) but hides everything else. In many settings, the circuit can be garbled off-line without strictâ€¦ (More)

- Zahra Jafargholi, Daniel Wichs
- TCC
- 2016

A garbling scheme is used to garble a circuit C and an input x in a way that reveals the output C(x) but hides everything else. Yaoâ€™s construction from the 80â€™s is known to achieve selectiveâ€¦ (More)

For many cryptographic primitives, it is relatively easy to achieve selective security (where the adversary commits a-priori to some of the choices to be made later in the attack) but appearsâ€¦ (More)

- Georg Fuchsbauer, Zahra Jafargholi, Krzysztof Pietrzak
- CRYPTO
- 2015

Generalized Selective Decryption (GSD), introduced by Panjwani [TCCâ€™07], is a game for a symmetric encryption scheme Enc that captures the difficulty of proving adaptive security of certainâ€¦ (More)

- Zahra Jafargholi
- 2013

In previous lectures we defined a randomness extractor as follow, Definition 1 Function Ext : {0, 1}n Ã— {0, 1}d â†’ {0, 1}m is (k, Îµ)extractor if for any distribution W âˆˆ {0, 1}n, with Hâˆž(W ) â‰¥ kâ€¦ (More)

We study the classical problem of privacy amplification, where two parties Alice and Bob share a weak secret X of min-entropy k, and wish to agree on secret key R of length m over a publicâ€¦ (More)

- Zahra Jafargholi, Hamidreza Jahanjou, Eric Miles, Jaideep Ramachandran, Emanuele Viola
- Electronic Colloquium on Computational Complexity
- 2012

Common presentations of the NP-completeness of SAT suffer from two drawbacks which hinder the scope of this flagship result. First, they do not apply to machines equipped with random-access memory,â€¦ (More)