Cynthia Dwork (born 1958) is an American computer scientist and a Distinguished Scientist at Microsoft Research. Beginning in January 2017 she will… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Michael Zuba
- ACM Crossroads
- 2013

Distinguished Scientist at Microsoft Research, Dr. Cynthia Dwork, provides a first-hand look at the basics of differential… (More)

Is this relevant?

2012

2012

- Nico Döttling, Jörn Müller-Quade, Anderson C. A. Nascimento
- ASIACRYPT
- 2012

In 2003 Michael Alekhnovich (FOCS 2003) introduced a novel variant of the learning parity with noise problem and showed that it… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Chris Peikert
- 2008

We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the length of a shortest… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Chris Peikert
- STOC
- 2008

We construct public-key cryptosystems that are secure assuming the<i>worst-case</i> hardness of approximating the minimum… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager
- The Theory of Timed I/O Automata
- 2006

This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Jens Groth, Rafail Ostrovsky, Amit Sahai
- CRYPTO
- 2006

In 2000, Dwork and Naor proved a very surprising result: that there exist “Zaps”, tworound witness-indistinguishable proofs in… (More)

Is this relevant?

2004

2004

Dwork and Stockmeyer showed 2-round zero-knowledge proof systems secure against provers which are resource-bounded during the… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Oded Regev
- STOC
- 2003

We introduce the use of Fourier analysis on lattices as an integral part of a lattice-based construction. The tools we develop… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Cynthia Dwork, Moni Naor
- FOCS
- 2000

A zap is a two-round, witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to… (More)

Is this relevant?

1998

1998

- Phong Q. Nguyen, Jacques Stern
- CRYPTO
- 1998

Recently, Ajtai discovered a fascinating connection between the worst-case complexity and the average-case complexity of some… (More)

Is this relevant?