Welcome to the InfoSci Platform
Reference Hub3
Analysis and Evaluation of Novel Privacy Preserving Techniques for Collaborative Temporal Association Rule Mining Using Secret Sharing

Analysis and Evaluation of Novel Privacy Preserving Techniques for Collaborative Temporal Association Rule Mining Using Secret Sharing

Nirali R. Nanavati, Neeraj Sen, Devesh C. Jinwala
Copyright: © 2014 |Volume: 5 |Issue: 3 |Pages: 19
ISSN: 1947-3532|EISSN: 1947-3540|EISBN13: 9781466653696|DOI: 10.4018/ijdst.2014070103
Cite Article Cite Article

MLA

Nanavati, Nirali R., et al. "Analysis and Evaluation of Novel Privacy Preserving Techniques for Collaborative Temporal Association Rule Mining Using Secret Sharing." IJDST vol.5, no.3 2014: pp.58-76. http://doi.org/10.4018/ijdst.2014070103

APA

Nanavati, N. R., Sen, N., & Jinwala, D. C. (2014). Analysis and Evaluation of Novel Privacy Preserving Techniques for Collaborative Temporal Association Rule Mining Using Secret Sharing. International Journal of Distributed Systems and Technologies (IJDST), 5(3), 58-76. http://doi.org/10.4018/ijdst.2014070103

Chicago

Nanavati, Nirali R., Neeraj Sen, and Devesh C. Jinwala. "Analysis and Evaluation of Novel Privacy Preserving Techniques for Collaborative Temporal Association Rule Mining Using Secret Sharing," International Journal of Distributed Systems and Technologies (IJDST) 5, no.3: 58-76. http://doi.org/10.4018/ijdst.2014070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.