Bobi Gilburd
ABSTRACT
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a general construction of such protocols for any function. Protocols obtained in this way are, however, inefficient, and thus, practically speaking, useless when a large number of participants are involved.The contribution of this paper is to define a new privacy model -- k-privacy -- by means of an innovative, yet natural generalization of the accepted trusted third party model. This allows implementing cryptographically secure efficient primitives for real-world large-scale distributed systems.As an example for the usefulness of the proposed model, we employ k-privacy to introduce a technique for obtaining knowledge -- by way of an association-rule mining algorithm -- from large-scale Data Grids, while ensuring that the privacy is cryptographically secure.
- O. Goldreich. Secure multi-party computation, 2002. http://www.wisdom.weizmann.ac.il/~oded/PS/prot.ps.]]Google Scholar
- O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In Proc. of STOC'87, pages 218--229, 1987.]] Google ScholarDigital Library
- M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In Proc. of DMKD'02, June 2002.]]Google Scholar
- Y. Lindell. Lower bounds for concurrent self composition. In Proc. of TCC'04, Cambridge, Massachusetts, USA, February 2004.]]Google ScholarCross Ref
- Y. Lindell and B. Pinkas. Privacy preserving data mining. Proc. of Crypto'00, LNCS, 1880:20--24, August 2000.]] Google ScholarDigital Library
- H. Lipmaa. Survey of Secure Multiparty Computations Sources. http://www.tcs.hut.fi/~helger/crypto/link/mpc/.]]Google Scholar
- R. Srikant and R. Agrawal. Fast algorithms for mining association rules. In Proc. of VLDB'94, pages 487--499, Santiago, Chile, September 1994.]] Google ScholarDigital Library
- L. Sweeney. k-anonymity: A model for protecting privacy. Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557--570, 2002.]] Google ScholarDigital Library
- J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In Proc. of ACM SIGKDD'02, Edmonton, Alberta, Canada, July 2002.]] Google ScholarDigital Library
- J. Vaidya and C. Clifton. Leveraging the "Multi" in Secure Multi-Party Computation. In Workshop on Privacy in the Electronic Society, Washington, DC, October 2003.]] Google ScholarDigital Library
- R. Wolff and A. Schuster. Association rule mining in peer-to-peer systems. In Proc. ICDM'03, November 2003.]] Google ScholarDigital Library
Index Terms
- k-TTP: a new privacy model for large-scale distributed environments
Recommendations
Fast Cryptographic Privacy Preserving Association Rules Mining on Distributed Homogenous Data Base
KES '08: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part IIPrivacy is one of the most important properties of an information system must satisfy. In which systems the need to share information among different, not trusted entities, the protection of sensible information has a relevant role. A relatively new ...
A more well-founded security proof of the privacy-preserving distributed mining of association rules protocols
MoSE+DQS '09: Proceedings of the first international workshop on Model driven service engineering and data quality and securityPrivacy-preserving data mining aims at discovering beneficial information from a large amount of data without violating the privacy policy. Privacy-preserving association rules mining research has already generated many interesting results. Based on ...
DARM: a privacy-preserving approach for distributed association rules mining on horizontally-partitioned data
IDEAS '14: Proceedings of the 18th International Database Engineering & Applications SymposiumExtracting association rules helps data owners to unveil hidden patterns from their data for the purpose of analyzing and predicting the behavior of their clients. However, mining association rules in a distributed environment is not a trivial task due ...
Comments