Skip to main content

Data Mining of Privacy Preserving Based on Secret Sharing Technology

  • Conference paper
  • First Online:
Data Processing Techniques and Applications for Cyber-Physical Systems (DPTA 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1088))

  • 64 Accesses

Abstract

Based on Shamir secret sharing technology, this paper designs a vertical distributed association rule data mining algorithm with privacy-preserving level, and analyses the correctness, complexity and security of the algorithm. At the same time, it points out that under the hypothesis of quasi-honesty attack, the algorithm is not only safe, but also can effectively prevent collusion between participants. This algorithm is suitable for privacy-preserving data mining in relatively small distributed databases.

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

Access this chapter

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

References

  1. Lei, Hongyan, and Hanbin Zou. 2010. Privacy-preserving classification algorithm based on Shamir secret sharing. Computer Engineering and Design 31 (6): 1271–1273.

    Google Scholar 

  2. F. Emekci*, O.D. Sahin, D. Agrawal, and A. El Abbadi. 2007. Privacy preserving decision tree learning over multiple parties. Data & Knowledge Engineering 63: 348–361.

    Article  Google Scholar 

  3. Schneier, B. 2000. Applied cryptography. Machinery Industry Press.

    Google Scholar 

  4. Shamir, A. 1979. How to share a secret. Communications of the ACM 22: 612–613.

    Article  MathSciNet  Google Scholar 

  5. SIGKDD, KDD CUP 1999 Datasets. http://www.sigkddorg/kddcup/index.php?section=1999&method=data,1999.

  6. Levin, I. 2000. KDD_99 classifier learning contest LLSoft’s results overview. ACM SIGKDD Explorations Newsletter 1: 67–75.

    Article  Google Scholar 

  7. Hung-Min, Sun, and Shieh Shiuh-Pyng. 1999. Recursive constructions for perfect secret sharing schemes. Computers & Mathematics with Applications 37 (3): 87–96.

    Article  MathSciNet  Google Scholar 

  8. Z. Yang, and R. Wright. 2005. Improved privacy-preserving bayesian network parameter learning on vertical partitioned data. Proceedings of the ICDE Inernational Workshop on Privacy Data Management: 43–52.

    Google Scholar 

  9. Justin, Zhan. 2006. Privacy-preserving collaborative data mining (PhD), University of Ottawa, Canada.

    Google Scholar 

  10. Zhang, P., Y. Tong, S. Tang, and D. Yang. 2005. Privacy-preserving Naive Bayes classifier. Lecture Notes in Computer Science 3584: 744–752.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jianguo Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, J., Liu, X., Chen, Z., Hu, Z. (2020). Data Mining of Privacy Preserving Based on Secret Sharing Technology. In: Huang, C., Chan, YW., Yen, N. (eds) Data Processing Techniques and Applications for Cyber-Physical Systems (DPTA 2019). Advances in Intelligent Systems and Computing, vol 1088. Springer, Singapore. https://doi.org/10.1007/978-981-15-1468-5_17

Download citation

Publish with us

Policies and ethics