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

Nirali R. Nanavati; Devesh C. Jinwala

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

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

Topics: Database Security and Privacy; Privacy

In Proceedings of the 10th International Conference on Security and Cryptography - Volume 0ICETE, 512-517, 2013 , Reykjavík, Iceland

Authors: Nirali R. Nanavati and Devesh C. Jinwala

Affiliation: Sardar Vallabhbhai National Institute of Technology, India

Keyword(s): Privacy, Game Theory, Secure Multiparty Computation, Rational Secret Sharing, Distributed Data Mining.

Related Ontology Subjects/Areas/Topics: Data and Application Security and Privacy ; Database Security and Privacy ; Information and Systems Security ; Privacy ; Security in Information Systems

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 advantag e 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. (More)

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.145.105.105

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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 (ICETE 2013) - SECRYPT; ISBN 978-989-8565-73-0; ISSN 2184-3236, SciTePress, pages 512-517. DOI: 10.5220/0004525205120517

@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 (ICETE 2013) - SECRYPT},
year={2013},
pages={512-517},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004525205120517},
isbn={978-989-8565-73-0},
issn={2184-3236},
}

TY - CONF

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