FAQ

Cynthia Dwork

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

Topic mentions per year

Topic mentions per year

1987-2016
024619872016

Related topics

Related topics

25 relations
BitcoinCommunications of the ACMComputer scientistComputer security
(More)

Related mentions per year

Related mentions per year

1955-2018
1960198020002020
Cynthia Dwork
Distributed computing
Cryptography
Computer security
Information security
Information privacy

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Cynthia Dwork on Differential Privacy
Distinguished Scientist at Microsoft Research, Dr. Cynthia Dwork, provides a first-hand look at the basics of differential… (More)
Is this relevant?
2012
2012
IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
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
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
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
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
We construct public-key cryptosystems that are secure assuming the<i>worst-case</i> hardness of approximating the minimum… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The Theory of Timed I/O Automata
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 7
  • figure 10
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Non-interactive Zaps and New Techniques for NIZK
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
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument
Dwork and Stockmeyer showed 2-round zero-knowledge proof systems secure against provers which are resource-bounded during the… (More)
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
New lattice based cryptographic constructions
We introduce the use of Fourier analysis on lattices as an integral part of a lattice-based construction. The tools we develop… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Zaps and Their Applications
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
Cryptanalysis of the Ajtai-Dwork Cryptosystem
Recently, Ajtai discovered a fascinating connection between the worst-case complexity and the average-case complexity of some… (More)
Is this relevant?