A Game Theory based Repeated Rational Secret Sharing Scheme for Privacy Preserving Distributed Data Mining

Nirali R. Nanavati, Devesh C. Jinwala

Abstract

Collaborative data mining has become very useful today with the immense increase in the amount of data collected and the increase in competition. This in turn increases the need to preserve the participants’ privacy. There have been a number of approaches proposed that use Secret Sharing for privacy preservation for Secure Multiparty Computation (SMC) in different setups and applications. The different multiparty scenarios may have parties that are semi-honest, rational or malicious. A number of approaches have been proposed for semi honest parties in this setup. The problem however is that in reality we have to deal with parties that act in their self-interest and are rational. These rational parties may try and attain maximum gain without disrupting the protocol. Also these parties if cautioned would correct themselves to have maximum individual gain in the future. Thus we propose a new practical game theoretic approach with three novel punishment policies with the primary advantage that it avoids the use of expensive techniques like homomorphic encryption. Our proposed approach is applicable to the secret sharing scheme among rational parties in distributed data mining. We have analysed theoretically the proposed novel punishment policies for this approach. We have also empirically evaluated and implemented our scheme using Java. We compare the punishment policies proposed in terms of the number of rounds required to attain the Nash equilibrium with eventually no bad rational nodes with different percentage of initial bad nodes.

References

  1. Abraham, I., Dolev, D., Gonen, R., and Halpern, J. (2006). Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, PODC 7806, pages 53-62, NY, USA. ACM.
  2. Ge, X., Yan, L., Zhu, J., and Shi, W. (2010). Privacypreserving distributed association rule mining based on the secret sharing technique. In Software Engineering and Data Mining (SEDM), 2010 2nd International Conference on, pages 345 -350.
  3. Kargupta, H., Das, K., and Liu, K. (2007). A game theoretic approach toward multi-party privacypreserving distributed data mining. In Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, 2007, pages 523-531, Springer.
  4. Maleka, S., Shareef, A., and Rangan, C. P. (2008). Rational secret sharing with repeated games. In Proceedings of the 4th international conference on Information security practice and experience, ISPEC'08, pages 334-346, Berlin, Springer-Verlag.
  5. Miyaji, A. and Rahman, M. S. (2011). Privacy-preserving data mining: a game-theoretic approach. In Proceedings of the 25th IFIP WG 11.3 conference on Data and applications security and privacy, DBSec'11, pages 186-200, Berlin. Springer-Verlag.
  6. Nanavati, N. R. and Jinwala, D. C. (2012). Privacy preserving approaches for global cycle detections for cyclic association rules in distributed databases. In SECRYPT, pages 368-371.
  7. Nanavati, N. R. and Jinwala, D. C. (2013). A Novel Privacy preserving game theoretic repeated rational secret sharing scheme for distributed data mining. In Security and Privacy Symposium, Kanpur.
  8. Patel, S., Garasia, S., and Jinwala, D. C. (2012). An efficient approach for privacy preserving distributed kmeans clustering based on shamir's secret sharing scheme. In IFIPTM, pages 129-141.
  9. Pedersen, T. B., Saygin, Y., and Savas, E. (2007). Secret Sharing vs. Encryption-based Techniques For Privacy Preserving Data Mining. Sciences-New York, 17-19.
  10. Shamir, A. (1979). How to share a secret. Commun. ACM, 22:612-613.
Download


Paper Citation


in Harvard Style

R. Nanavati N. and C. Jinwala D. (2013). A Game Theory based Repeated Rational Secret Sharing Scheme for Privacy Preserving Distributed Data Mining . In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 512-517. DOI: 10.5220/0004525205120517


in Bibtex Style

@conference{secrypt13,
author={Nirali R. Nanavati and Devesh C. Jinwala},
title={A Game Theory based Repeated Rational Secret Sharing Scheme for Privacy Preserving Distributed Data Mining},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={512-517},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004525205120517},
isbn={978-989-8565-73-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - A Game Theory based Repeated Rational Secret Sharing Scheme for Privacy Preserving Distributed Data Mining
SN - 978-989-8565-73-0
AU - R. Nanavati N.
AU - C. Jinwala D.
PY - 2013
SP - 512
EP - 517
DO - 10.5220/0004525205120517