|
Reconstruction Attack
A reconstruction attack is any method for partially reconstructing a private dataset from public aggregate information. Typically, the dataset contains sensitive information about individuals, whose privacy needs to be protected. The attacker has no or only partial access to the dataset, but has access to public aggregate statistics about the datasets, which could be exact or distorted, for example by adding noise. If the public statistics are not sufficiently distorted, the attacker is able to accurately reconstruct a large portion of the original private data. Reconstruction attacks are relevant to the analysis of private data, as they show that, in order to preserve even a very weak notion of individual privacy, any published statistics need to be sufficiently distorted. This phenomenon was called the Fundamental Law of Information Recovery by Dwork and Roth, and formulated as "overly accurate answers to too many questions will destroy privacy in a spectacular way." The Dinur-Nis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cynthia Dwork
Cynthia Dwork (born June 27, 1958) is an American computer scientist 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, Harvard Law School and Harvard's Department of Statistics. Dwork was elected a member of the National Academy of Engineering in 2008 for fundamental contributions to distributed algorithms and the security of cryptosystems. She is a distinguished scientist at Microsoft Research. Early life and education 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 for research supervised by John Hopcroft. Career and research Dwork is known for her research placing privacy-preserving data analysis on a mathematically rigorous foundation, including the co-invention of differenti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aaron Roth
Aaron Roth is an American computer scientist. He is the Henry Salvatori Professor of Computer and Cognitive Science at the University of Pennsylvania. Biography Roth is the son of Alvin E. Roth, a former Harvard University professor who won the Nobel Memorial Prize in Economic Sciences in 2012. He earned his bachelor's degree in computer science from Columbia University in 2006, and his PhD from Carnegie Mellon University under the supervision of Avrim Blum. Roth spent a year as a postdoc at Microsoft Research New England before joining the University of Pennsylvania faculty in 2011 as the Raj and Neera Singh Assistant Professor of Computer Science and was made Class of 1940 Bicentennial Term Associate Professor in 2017. Roth's research interests include algorithm design, algorithmic fairness, differential privacy, and algorithmic game theory. Awards Roth received an NSF Career Award in 2013, a Sloan Research Fellowship in 2015, and a Presidential Early Career Award for Sci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irit Dinur
Irit Dinur (Hebrew: אירית דינור) is an Israeli mathematician. She is professor of computer science at the Weizmann Institute of Science. Her research is in foundations of computer science and in combinatorics, and especially in probabilistically checkable proofs and hardness of approximation. Biography Irit Dinur earned her doctorate in 2002 from the school of computer science in Tel Aviv University, advised by Shmuel Safra; her thesis was entitled ''On the Hardness of Approximating the Minimum Vertex Cover and The Closest Vector in a Lattice''. She joined the Weizmann Institute after visiting the Institute for Advanced Study in Princeton, New Jersey, NEC, and the University of California, Berkeley. Dinur published in 2006 a new proof of the PCP theorem that was significantly simpler than previous proofs of the same result. Awards and recognition In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv. She was a plenary speaker at t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kobbi Nissim
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. Nissim studied at the Weizmann Institute with Professor Moni Naor. Nissim's awards include: * The 2013 ACM PODS Alberto O. Mendelzon Test-of-Time Award (joint with Irit Dinur). * The 2017 Gödel Prize and 2016 Theory of Cryptography Test of Time Award (both joint with Cynthia Dwork, Frank McSherry, and Adam D. Smith) for the paper that introduced differential privacy. * The 2018 Theory of Cryptography Test of Time Award (joint with Dan Boneh and Eu-Jin Goh). * The 2019 Caspar Bowden Award for Outstanding Research in Privacy Enhancing Technologies (joint work with Aaron Bembenek, Alexandra Wood, Mark Bun, Marco Gaboardi, Urs Gasser, David R. O’Brien, Thomas Steinke, and Salil Vadhan). * The 2021 Paris Kanellakis Award The Paris ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Differential Privacy
Differential privacy (DP) is a system for publicly sharing information about a dataset by describing the patterns of groups within the dataset while withholding information about individuals in the dataset. The idea behind differential privacy is that if the effect of making an arbitrary single substitution in the database is small enough, the query result cannot be used to infer much about any single individual, and therefore provides privacy. Another way to describe differential privacy is as a constraint on the algorithms used to publish aggregate information about a statistical database which limits the disclosure of private information of records whose information is in the database. For example, differentially private algorithms are used by some government agencies to publish demographic information or other statistical aggregates while ensuring confidentiality of survey responses, and by companies to collect information about user behavior while controlling what is visible ev ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theory Of Cryptography
A theory is a rational type of abstract thinking about a phenomenon, or the results of such thinking. The process of contemplative and rational thinking is often associated with such processes as observational study or research. Theories may be scientific, belong to a non-scientific discipline, or no discipline at all. Depending on the context, a theory's assertions might, for example, include generalized explanations of how nature works. The word has its roots in ancient Greek, but in modern use it has taken on several related meanings. In modern science, the term "theory" refers to scientific theories, a well-confirmed type of explanation of nature, made in a way consistent with the scientific method, and fulfilling the criteria required by modern science. Such theories are described in such a way that scientific tests should be able to provide empirical support for it, or empirical contradiction ("falsify") of it. Scientific theories are the most reliable, rigorous, and compre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Information Privacy
Information privacy is the relationship between the collection and dissemination of data, technology, the public expectation of privacy, contextual information norms, and the legal and political issues surrounding them. It is also known as data privacy or data protection. Data privacy is challenging since attempts to use data while protecting an individual's privacy preferences and personally identifiable information. The fields of computer security, data security, and information security all design and use software, hardware, and human resources to address this issue. Authorities Laws Authorities by country Information types Various types of personal information often come under privacy concerns. Cable television This describes the ability to control what information one reveals about oneself over cable television, and who can access that information. For example, third parties can track IP TV programs someone has watched at any given time. "The addition of any informati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |