Cynthia Dwork | |
---|---|
Born | June 27, 1958 |
Alma mater | Princeton University (BSE) Cornell University (PhD) |
Known for | Differential privacy Non-Malleable Cryptography Proof-of-work |
Awards |
|
Scientific career | |
Fields | Computer science [1] |
Institutions | IBM Research Microsoft Research Harvard University |
Thesis | Bounds on Fundamental Problems in Parallel and Distributed Computation (1984) |
Doctoral advisor | John Hopcroft [2] [3] |
Website | dwork |
Cynthia Dwork (born June 27, 1958[ citation needed ]) is an American computer scientist renowned for her contributions to cryptography, distributed computing, and algorithmic fairness. She is one of the inventors of differential privacy and proof-of-work.
Dwork works at Harvard University, where she is Gordon McKay Professor of Computer Science, Radcliffe Alumnae Professor at the Radcliffe Institute for Advanced Study, and Affiliated Professor at Harvard Law School and Harvard's Department of Statistics.
Dwork received her B.S.E. from Princeton University in 1979, graduating Cum Laude, and receiving the Charles Ira Young Award for Excellence in Independent Research. Dwork received her Ph.D. from Cornell University in 1983 [3] for research supervised by John Hopcroft. [4] [2]
Dwork is known for her research placing privacy-preserving data analysis on a mathematically rigorous foundation, including the invention of differential privacy in the early to mid 2000s, a strong privacy guarantee frequently permitting highly accurate data analysis. [5] The definition of differential privacy relies on the notion of indistinguishability of the outputs irrespective of whether an individual has contributed their data or not. This is typically achieved by adding small amounts of noise either to the input data or to outputs of computations performed on the data. [6] She uses a systems-based approach to studying fairness in algorithms including those used for placing ads. [7] Dwork has also made contributions in cryptography and distributed computing, and is a recipient of the Edsger W. Dijkstra Prize for her early work on the foundations of fault-tolerant systems. [8]
Her contributions in cryptography include non-malleable cryptography with Danny Dolev and Moni Naor in 1991, the first lattice-based cryptosystem with Miklós Ajtai in 1997, which was also the first public-key cryptosystem for which breaking a random instance is as hard as solving the hardest instance of the underlying mathematical problem ("worst-case/average-case equivalence"). With Naor she also first presented the idea of, and a technique for, combating e-mail spam by requiring a proof of computational effort, also known as proof-of-work — a key technology underlying hashcash and bitcoin.
Her publications [1] include:
She was elected as a Fellow of the American Academy of Arts and Sciences (AAAS) in 2008, [9] [10] as a member of the National Academy of Engineering in 2008, as a member of the National Academy of Sciences in 2014, as a fellow of the Association for Computing Machinery (ACM) in 2015, [11] and as a member of the American Philosophical Society in 2016. [12]
Dwork received a number of awards for her work.
Dwork is the daughter of American mathematician Bernard Dwork, [25] and sister of historian Debórah Dwork. She has a black belt in taekwondo. [26]
Adi Shamir is an Israeli cryptographer and inventor. He is a co-inventor of the Rivest–Shamir–Adleman (RSA) algorithm, a co-inventor of the Feige–Fiat–Shamir identification scheme, one of the inventors of differential cryptanalysis and has made numerous contributions to the fields of cryptography and computer science.
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
Shafrira Goldwasser is an Israeli-American computer scientist. A winner of the Turing Award in 2012, she is the RSA Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology; a professor of mathematical sciences at the Weizmann Institute of Science; the director of the Simons Institute for the Theory of Computing at the University of California, Berkeley; and co-founder and chief scientist of Duality Technologies.
Paris Christos Kanellakis was a Greek American computer scientist.
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.
In cryptography the standard model is the model of computation in which the adversary is only limited by the amount of time and computational power available. Other names used are bare model and plain model.
The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after the American computer scientist Donald E. Knuth.
Ravindran Kannan is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.
Rafail Ostrovsky is a distinguished professor of computer science and mathematics at UCLA and a well-known researcher in algorithms and cryptography.
Moni Naor is an Israeli computer scientist, currently a professor at the Weizmann Institute of Science. Naor received his Ph.D. in 1989 at the University of California, Berkeley. His advisor was Manuel Blum.
Larry Joseph Stockmeyer was an American computer scientist. He was one of the pioneers in the field of computational complexity theory, and he also worked in the field of distributed computing. He died of pancreatic cancer.
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.
Differential privacy (DP) is a mathematically rigorous framework for releasing statistical information about datasets while protecting the privacy of individual data subjects. It enables a data holder to share aggregate patterns of the group while limiting information that is leaked about specific individuals. This is done by injecting carefully calibrated noise into statistical computations such that the utility of the statistic is preserved while provably limiting what can be inferred about any individual in the dataset.
Toniann Pitassi is a Canadian-American mathematician and computer scientist specializing in computational complexity theory. She is currently Jeffrey L. and Brenda Bleustein Professor of Engineering at Columbia University and was Bell Research Chair at the University of Toronto.
Daniel (Danny) Dolev is an Israeli computer scientist known for his research in cryptography and distributed computing. He holds the Berthold Badler Chair in Computer Science at the Hebrew University of Jerusalem and is a member of the scientific council of the European Research Council.
Amos Fiat is an Israeli computer scientist, a professor of computer science at Tel Aviv University. He is known for his work in cryptography, online algorithms, and algorithmic game theory.
Mordechai M. "Moti" Yung is a cryptographer and computer scientist known for his work on cryptovirology and kleptography.
Dahlia Malkhi is an Israeli-American computer scientist, who works on distributed systems and cryptocurrency.
Yael Tauman Kalai is a cryptographer and theoretical computer scientist and is the Ellen Swallow Richards Professor at MIT in the Computer Science and Artificial Intelligence Lab. Prior to that, she worked as a Senior Principal Researcher at Microsoft Research New England.
Kobbi Nissim is a computer scientist at Georgetown University, where he is the McDevitt Chair of Computer Science. His areas of research include cryptography and data privacy. He is known for the introduction of differential privacy.