Inferring Secret Information in Relational Databases

Stefan Böttcher

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Inferring Secret Information in Relational Databases

Topics: Database Security and Transaction Support

In Proceedings of the 5th International Workshop on Security in Information Systems - WOSIS, 179-187, 2007 , Funchal, Madeira, Portugal

Author: Stefan Böttcher

Affiliation: University of Paderborn, EIM, Germany

Related Ontology Subjects/Areas/Topics: Data and Application Security and Privacy ; Database Security ; Information and Systems Security

Abstract: We formalize the problem of finding information leaks in multi-user database systems, and we reduce this problem to the problem of inferring secret answers to database queries from other answers to database queries and a set of given Boolean integrity constraints. Furthermore, we investigate some sufficient conditions under which the answer to a query can be inferred from a previously answered set of database queries and a set of Boolean integrity constraints. Finally, show that the problem of finding information leaks is NP-hard, and we suggest a reformulation of the problem as a query composition and simplification problem.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.238.132.225

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Böttcher, S. (2007). Inferring Secret Information in Relational Databases. In Proceedings of the 5th International Workshop on Security in Information Systems - WOSIS, (ICEIS 2007) ISBN 978-972-8865-96-2, pages 179-187. DOI: 10.5220/0002437501790187

@conference{wosis07,
author={Stefan Böttcher.},
title={Inferring Secret Information in Relational Databases},
booktitle={Proceedings of the 5th International Workshop on Security in Information Systems - WOSIS, (ICEIS 2007)},
year={2007},
pages={179-187},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002437501790187},
isbn={978-972-8865-96-2},
}

TY - CONF

JO - Proceedings of the 5th International Workshop on Security in Information Systems - WOSIS, (ICEIS 2007)
TI - Inferring Secret Information in Relational Databases
SN - 978-972-8865-96-2
AU - Böttcher, S.
PY - 2007
SP - 179
EP - 187
DO - 10.5220/0002437501790187