{"title":"An Enhanced Scheme for Privacy-Preserving Association Rules Mining on Horizontally Distributed Databases","authors":"Xuan Canh Nguyen, H. Le, T. A. Cao","doi":"10.1109/rivf.2012.6169821","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an Enhanced M.Hussein et al.'s Scheme (EMHS) for privacy-preserving association rules mining on horizontally distributed databases. EMHS is based on the M.Hussein et al.'s Scheme (MHS) proposed in 2008 and improves privacy and performance when increasing the number of sites. EMHS uses two servers, Initiator and Combiner, combined with MFI approach to generate candidate set and homomorphic Paillier cryptosystem to compute global supports. Experimental results show that the performance of EMHS is better than MHS in specific databases when increasing the number of sites. A second scheme is also proposed for the other databases.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/rivf.2012.6169821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29
Abstract
In this paper, we propose an Enhanced M.Hussein et al.'s Scheme (EMHS) for privacy-preserving association rules mining on horizontally distributed databases. EMHS is based on the M.Hussein et al.'s Scheme (MHS) proposed in 2008 and improves privacy and performance when increasing the number of sites. EMHS uses two servers, Initiator and Combiner, combined with MFI approach to generate candidate set and homomorphic Paillier cryptosystem to compute global supports. Experimental results show that the performance of EMHS is better than MHS in specific databases when increasing the number of sites. A second scheme is also proposed for the other databases.
本文提出了一种改进的M.Hussein et al. s Scheme (EMHS),用于水平分布数据库的隐私保护关联规则挖掘。EMHS以2008年提出的m.h hussein等人的方案(MHS)为基础,并在增加网站数量时改善隐私和性能。EMHS采用Initiator和Combiner两个服务器,结合MFI方法生成候选集,并采用同态Paillier密码系统计算全局支持度。实验结果表明,随着站点数量的增加,EMHS在特定数据库中的性能优于MHS。对其他数据库也提出了第二种方案。