Skip to main content

Privacy-Preserving Data Set Union

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4302))

Abstract

This paper describes a cryptographic protocol for merging two or more data sets without divulging those identifying records; technically, the protocol computes a blind set-theoretic union. Applications for this protocol arise, for example, in data analysis for biomedical application areas, where identifying fields (e.g., patient names) are protected by governmental privacy regulations or by institutional research board policies.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adam, N., Wortman, J.: Security-control methods for statistical databases: A comparative study. Association for Computing Machinery Computing Surveys 21(4), 515–556 (1989)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proc. of the ACM SIGMOD Conf. on Management of Data, May 2000, pp. 439–450. ACM Press, New York (2000)

    Chapter  Google Scholar 

  3. Annas, G.J.: HIPAA regulations – a new era of medical-record privacy? The New England Journal of Medicine 348(13), 1486–1490 (2003)

    Article  Google Scholar 

  4. Elston, R.C., Stewart, J.: General model for the genetic analysis of pedigree data. Human Heredity 21, 523–542 (1971)

    Article  Google Scholar 

  5. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game: A completeness theorem for protocols with honest majority. In: Annual ACM Symposium on Theory of Computing (1987)

    Google Scholar 

  6. Hundepool, A., van De Wetering, A., Ramaswamy, R., de Wolf, P.P., Giessing, S., Fischietti, M., Salazar, J.J., Castro, J., Lowthian, P.: The τ-argus user’s manual, version 3.1 (November 2004), http://neon.vb.cbs.nl/CENEX/Software/TauManualV31.pdf

  7. Hundepool, A., van De Wetering, A., Ramaswamy, R., Franconi, L., Polettini, S., Capobianchi, A., de Wolf, P.P., Domingo, J., Torra, V., Brand, R., Giessing, S.: The μ-argus user’s manual, version 4.0. (November 2004), http://neon.vb.cbs.nl/CASC/deliv/MUmanual4.0.pdf

  8. Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering 16(9), 1026–1037 (2004)

    Article  Google Scholar 

  9. Lander, E., Green, P.: Construction of multilocus genetic linkage maps in humans. Proceedings of the National Academy of Sciences 84, 2363–2367 (1987)

    Article  Google Scholar 

  10. Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology 15(3), 177–206 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ott, J.: Analysis of Human Genetic Linkage. Johns Hopkins University Press (1999)

    Google Scholar 

  12. Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithm of GF(p) and its cryptographic significance. IEEE Transactions on Information Theory IT24, 106–110 (1978)

    Article  MathSciNet  Google Scholar 

  13. Quinlan, J.R.: Induction of decision trees. Machine Learning 1(1), 81–106 (1986)

    Google Scholar 

  14. Yao, A.C.: Protocols for secure computations. In: Carberry, M.S. (ed.) Annual Symposium on Foundations of Computer Science, pp. 160–164 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Segre, A.M., Wildenberg, A., Vieland, V., Zhang, Y. (2006). Privacy-Preserving Data Set Union. In: Domingo-Ferrer, J., Franconi, L. (eds) Privacy in Statistical Databases. PSD 2006. Lecture Notes in Computer Science, vol 4302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11930242_23

Download citation

  • DOI: https://doi.org/10.1007/11930242_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49330-3

  • Online ISBN: 978-3-540-49332-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics