NDLI: Epistemic privacy

Content Provider	ACM Digital Library
Author	Evfimievski, Alexandre Fagin, Ronald Woodruff, David
Copyright Year	2010
Abstract	We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, and assumptions about users' prior knowledge, our goal is to determine if answering a past user's query could have led to a privacy breach. According to our definition, an audited property $\textit{A}$ is private, given the disclosure of property $\textit{B},$ if no user can gain confidence in $\textit{A}$ by learning $\textit{B},$ subject to prior knowledge constraints. Privacy is not violated if the disclosure of $\textit{B}$ causes a loss of confidence in $\textit{A}.$ The new notion of privacy is formalized using the well-known semantics for reasoning about knowledge, where logical properties correspond to sets of possible worlds (databases) that satisfy these properties. Database users are modeled as either possibilistic agents whose knowledge is a set of possible worlds, or as probabilistic agents whose knowledge is a probability distribution on possible worlds. We analyze the new privacy notion, show its relationship with the conventional approach, and derive criteria that allow the auditor to test privacy efficiently in some important cases. In particular, we prove characterization theorems for the possibilistic case, and study in depth the probabilistic case under the assumption that all database records are considered a-priori independent by the user, as well as under more relaxed (or absent) prior-knowledge assumptions. In the probabilistic case we show that for certain families of distributions there is no efficient algorithm to test whether an audited property $\textit{A}$ is private given the disclosure of a property $\textit{B},$ assuming $\textit{P}$ ≠ $\textit{NP}.$ Nevertheless, for many interesting families, such as the family of product distributions, we obtain algorithms that are efficient both in theory and in practice.
Starting Page	1
Ending Page	45
Page Count	45
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/1870103.1870105
Journal	Journal of the ACM (JACM)
Volume Number	58
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-12-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Auditing Positivstellensatz Disclosure Privacy Query logs Reasoning about knowledge Supermodularity
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Epistemic privacy

Corrigendum: “Reasoning about knowledge and probability”

Reasoning about systems with many processes

Reasoning About Recursively Defined Data Structures

Reasoning about knowledge and probability

Knowledge compilation and theory approximation

A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols

Formally Reasoning About Quality

A model-theoretic analysis of knowledge

Epistemic privacy

Similar Documents

Epistemic privacy

Corrigendum: “Reasoning about knowledge and probability”

Reasoning about systems with many processes

Reasoning About Recursively Defined Data Structures

Reasoning about knowledge and probability

Knowledge compilation and theory approximation

A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols

Formally Reasoning About Quality

A model-theoretic analysis of knowledge

Epistemic privacy