Skip to main content
SpringerLink
Log in

2-Compromise Usability in 1-Dimensional Statistical Databases

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2387))

Included in the following conference series:

Abstract

Many believe that data mining poses the biggest privacy challenge in the next decade. In this paper we concentrate on threats to privacy arising from the possibility of combining aggregate data to deduce the confidential individual values. We determine the maximum number of sum totals that can be disclosed without leading to a 2-compromise in a 1-dimensional database for range queries.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Branković, P. Horak and M. Miller. An optimization problem in statistical database security. SIAM Journal on Discrete Mathematics, Volume 13, Number 3, pages 346–353, 2000.

    Article  MathSciNet  Google Scholar 

  2. L. Branković, M. Miller and J. Širáň. Range query usability of statistical databases. To appear in International Journal of Computer Mathematics.

    Google Scholar 

  3. J. R. Griggs. Database security and the distribution of subset sums in Rm. Graph Theory and Combinatorial Biology, (Balatonlelle, 1996).

    Google Scholar 

  4. J. R. Griggs. Concentrating subset sums at k points. Bulletin of the ICA, Volume 20, pages 65–74, 1997.

    MATH  MathSciNet  Google Scholar 

  5. P. Horak, L. Branković and M. Miller. A combinatorial problem in database security. Discrete Applied Mathematics, Volume 91, Number 1–3, pages 119–126, 1999.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, The University of Newcastle, NSW, 2308, Australia

    Ljiljana Branković

  2. Department of Mathematics, SvF, Slovak University of Technology, Radlinského 11, 813 68, Bratislava, Slovakia

    Jozef Širáň

Authors
  1. Ljiljana Branković
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jozef Širáň
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Branković, L., Širáň, J. (2002). 2-Compromise Usability in 1-Dimensional Statistical Databases. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation