Privacy-Preserving Two-Party k-Means Clustering in Malicious Model

Rahena Akhter, Rownak Jahan Chowdhury, K. Emura, T. Islam, Mohammad Shahriar Rahman, Nusrat Rubaiyat
{"title":"Privacy-Preserving Two-Party k-Means Clustering in Malicious Model","authors":"Rahena Akhter, Rownak Jahan Chowdhury, K. Emura, T. Islam, Mohammad Shahriar Rahman, Nusrat Rubaiyat","doi":"10.1109/COMPSACW.2013.53","DOIUrl":null,"url":null,"abstract":"In data mining, clustering is a well-known and useful technique. One of the most powerful and frequently used techniques is k-means clustering. Most of the privacy-preserving solutions based on cryptography proposed by different researchers in recent years are in semi-honest model, where participating parties always follow the protocol. This model is realistic in many cases. But providing stonger solutions considering malicious model would be more useful for many practical applications because it tries to protect a protocol from arbitrary malicious behavior using cryptographic tools. In this paper, we have proposed a new protocol for privacy-preserving two-party k-means clustering in malicious model. We have used threshold homomorphic encryption and non-interactive zero knowledge protocols to construct our protocol according to real/ideal world paradigm.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSACW.2013.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

In data mining, clustering is a well-known and useful technique. One of the most powerful and frequently used techniques is k-means clustering. Most of the privacy-preserving solutions based on cryptography proposed by different researchers in recent years are in semi-honest model, where participating parties always follow the protocol. This model is realistic in many cases. But providing stonger solutions considering malicious model would be more useful for many practical applications because it tries to protect a protocol from arbitrary malicious behavior using cryptographic tools. In this paper, we have proposed a new protocol for privacy-preserving two-party k-means clustering in malicious model. We have used threshold homomorphic encryption and non-interactive zero knowledge protocols to construct our protocol according to real/ideal world paradigm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
恶意模型中保护隐私的两方k-均值聚类
在数据挖掘中,聚类是一种众所周知且有用的技术。最强大和最常用的技术之一是k-means聚类。近年来,不同研究人员提出的基于密码学的隐私保护方案大多是半诚实模型,参与方始终遵循协议。这个模型在许多情况下是现实的。但是,考虑到恶意模型,提供更强大的解决方案对于许多实际应用更有用,因为它试图使用加密工具保护协议免受任意恶意行为的侵害。在本文中,我们提出了一种新的协议,用于在恶意模型中保护隐私的两方k-means聚类。我们采用了阈值同态加密和非交互式零知识协议,根据真实/理想世界范式构建了我们的协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Patrol Guidance Mechanism in a Context-Aware Environment Investigating the Relevance of Linked Open Data Sets with SPARQL Queries A Distributed Protective Approach for Multiechelon Supply Systems Model Checking for SpaceWire Link Interface Design Using Uppaal An Optimal Route Selection Mechanism for Outbound Connection on IPv6 Site Multihoming Environment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1