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

With digital data being abundant in today's world, competing organizations desire to gain insights about the market, without putting the privacy of their confidential data at risk. This paper provides a new dimension to the problem of Privacy Preserving Distributed Association Rule Mining (PPDARM) by extending it to a distributed temporal setup. It proposes extensions of public key based and non-public key based additively homomorphic techniques, based on efficient private matching and Shamir's secret sharing, to privately decipher these global cycles in cyclic association rules. Along with the theoretical analysis, it presents experimental results to substantiate it. This paper observes that the Secret Sharing scheme is more efficient than the one based on Paillier homomorphic encryption. However, it observes a considerable increase in the overhead associated with the Shamir's secret sharing scheme, as a result of the increase in the number of parties. To reduce this overhead, it extends the secret sharing scheme without mediators to a novel model with a Fully Trusted and a Semi Trusted Third Party. The experimental results establish this functioning for global cycle detections in a temporal setup as a case study. The novel constructions proposed can also be applied to other scenarios that want to undertake Secure Multiparty Computation (SMC) for PPDARM.

Download Full-text

Application of Oblivious Transfer Protocol in Distributed Data Mining with Privacy-preserving

The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007) ◽

10.1109/isdpe.2007.39 ◽

2007 ◽

Cited By ~ 3

Author(s):

Weiping Wang ◽

Bing Deng ◽

Zhepeng Li

Keyword(s):

Data Mining ◽

Oblivious Transfer ◽

Privacy Preserving ◽

Distributed Data Mining ◽

Distributed Data ◽

Transfer Protocol

Download Full-text

RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS

International Journal of Foundations of Computer Science ◽

10.1142/s012905411350024x ◽

2013 ◽

Vol 24 (06) ◽

pp. 879-897 ◽

Cited By ~ 3

Author(s):

EN ZHANG ◽

YONGQUAN CAI

Keyword(s):

Communication Networks ◽

Secret Sharing ◽

Broadcast Channel ◽

Secret Sharing Scheme ◽

Multiple Secrets ◽

Sharing Scheme ◽

Rational Secret Sharing ◽

Point To Point ◽

Multi Secret Sharing ◽

Rational Players

Rational secret sharing was first introduced by Halpern and Teague (STOC, 2004). Since then, a series of works have focused on designing rational secret sharing protocols. However, most existing solutions can share only one secret at one secret sharing process. To share multiple secrets such as m secrets, the dealer must redistribute shares for m times. In addition, previous works assume existence of broadcast channel which is not realistic. Motivated by those problems, this paper proposes a rational multi-secret sharing scheme, which combines the secret sharing scheme with game theory. In the protocol, the problem of sharing multiple secrets is addressed, and there are multiple secrets to be shared during one secret sharing process. Furthermore, this work starts off by constructing a protocol in simultaneous broadcast networks, and then we emulate the broadcast channel over point-to-point networks. Based on a computational assumption, we show that rational players have no incentive to deviate from the protocol and every player can obtain multi-secret fairly.

Download Full-text