Usability of k-compromise-free statistical databases

Ljiljana Brankovic; Mirka Miller; Jozef Siran

Usability of k-compromise-free statistical databases

Ljiljana Brankovic, Mirka Miller, Jozef Siran

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A statistical database is said to be secure if no sensitive statistics are disclosed. An important problem in security of statistical databases is to maximize the number of disclosed statistics, while ensuring that the database is secure. In this paper we present a new result for the case of range queries and k-compromise in 1-dimensional statistical databases.

Original language	English
Title of host publication	Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms (AWOCA2000)
Editors	Ljiljana Brankovic, Joe Ryan
Place of Publication	Newcastle, Australia
Publisher	The University of Newcastle
Pages	159-166
ISBN (Print)	0725910984
Publication status	Published - 31 Dec 2000
Event	AWOCA2000: Eleventh Australasian Workshop on Combinatorial Algorithms - Hunter Valley, Australia Duration: 29 Jul 2000 → 1 Aug 2000

Conference

Conference	AWOCA2000: Eleventh Australasian Workshop on Combinatorial Algorithms
City	Hunter Valley, Australia
Period	29/07/00 → 1/08/00

Access to Document

https://hdl.handle.net/1959.11/63418

Handle.net

Persistent link

Cite this

@inproceedings{e0940a10486a4fdd8501c2fb4b52d091,

title = "Usability of k-compromise-free statistical databases",

abstract = "A statistical database is said to be secure if no sensitive statistics are disclosed. An important problem in security of statistical databases is to maximize the number of disclosed statistics, while ensuring that the database is secure. In this paper we present a new result for the case of range queries and k-compromise in 1-dimensional statistical databases.",

author = "Ljiljana Brankovic and Mirka Miller and Jozef Siran",

year = "2000",

month = dec,

day = "31",

language = "English",

isbn = "0725910984",

pages = "159--166",

editor = "Ljiljana Brankovic and Joe Ryan",

booktitle = "Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms (AWOCA2000)",

publisher = "The University of Newcastle",

note = "AWOCA2000: Eleventh Australasian Workshop on Combinatorial Algorithms ; Conference date: 29-07-2000 Through 01-08-2000",

}

Brankovic, L, Miller, M & Siran, J 2000, Usability of k-compromise-free statistical databases. in L Brankovic & J Ryan (eds), Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms (AWOCA2000). The University of Newcastle, Newcastle, Australia, pp. 159-166, AWOCA2000: Eleventh Australasian Workshop on Combinatorial Algorithms, Hunter Valley, Australia, 29/07/00. <https://hdl.handle.net/1959.11/63418>

Usability of k-compromise-free statistical databases. / Brankovic, Ljiljana; Miller, Mirka; Siran, Jozef.
Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms (AWOCA2000). ed. / Ljiljana Brankovic; Joe Ryan. Newcastle, Australia: The University of Newcastle, 2000. p. 159-166.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Usability of k-compromise-free statistical databases

AU - Brankovic, Ljiljana

AU - Miller, Mirka

AU - Siran, Jozef

PY - 2000/12/31

Y1 - 2000/12/31

N2 - A statistical database is said to be secure if no sensitive statistics are disclosed. An important problem in security of statistical databases is to maximize the number of disclosed statistics, while ensuring that the database is secure. In this paper we present a new result for the case of range queries and k-compromise in 1-dimensional statistical databases.

AB - A statistical database is said to be secure if no sensitive statistics are disclosed. An important problem in security of statistical databases is to maximize the number of disclosed statistics, while ensuring that the database is secure. In this paper we present a new result for the case of range queries and k-compromise in 1-dimensional statistical databases.

M3 - Conference contribution

SN - 0725910984

SP - 159

EP - 166

BT - Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms (AWOCA2000)

A2 - Brankovic, Ljiljana

A2 - Ryan, Joe

PB - The University of Newcastle

CY - Newcastle, Australia

T2 - AWOCA2000: Eleventh Australasian Workshop on Combinatorial Algorithms

Y2 - 29 July 2000 through 1 August 2000

ER -

Usability of k-compromise-free statistical databases

Abstract

Conference

Access to Document

Handle.net

Fingerprint

Cite this