Achieving Strong Privacy in Online Survey.

You Zhou, Yian Zhou, Shigang Chen, Samuel S Wu
{"title":"Achieving Strong Privacy in Online Survey.","authors":"You Zhou,&nbsp;Yian Zhou,&nbsp;Shigang Chen,&nbsp;Samuel S Wu","doi":"10.1109/icdcs.2017.247","DOIUrl":null,"url":null,"abstract":"<p><p>Thanks to the proliferation of Internet access and modern digital and mobile devices, online survey has been flourishing into data collection of marketing, social, financial and medical studies. However, traditional data collection methods in online survey suffer from serious privacy issues. Existing privacy protection techniques are not adequate for online survey for lack of strong privacy. In this paper, we propose a practical strong privacy online survey scheme SPS based on a novel data collection technique called <i>dual matrix masking</i> (DM<sup>2</sup>), which guarantees the correctness of the tallying results with low computation overhead, and achieves universal verifiability, robustness and strong privacy. We also propose a more robust scheme RSPS, which incorporates multiple distributed survey managers. The RSPS scheme preserves the nice properties of SPS, and further achieves robust strong privacy against joint collusion attack. Through extensive analyses, we demonstrate our proposed schemes can be efficiently applied to online survey with accuracy and strong privacy.</p>","PeriodicalId":74571,"journal":{"name":"Proceedings. International Conference on Distributed Computing Systems","volume":"2017 ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/icdcs.2017.247","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icdcs.2017.247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2017/7/17 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Thanks to the proliferation of Internet access and modern digital and mobile devices, online survey has been flourishing into data collection of marketing, social, financial and medical studies. However, traditional data collection methods in online survey suffer from serious privacy issues. Existing privacy protection techniques are not adequate for online survey for lack of strong privacy. In this paper, we propose a practical strong privacy online survey scheme SPS based on a novel data collection technique called dual matrix masking (DM2), which guarantees the correctness of the tallying results with low computation overhead, and achieves universal verifiability, robustness and strong privacy. We also propose a more robust scheme RSPS, which incorporates multiple distributed survey managers. The RSPS scheme preserves the nice properties of SPS, and further achieves robust strong privacy against joint collusion attack. Through extensive analyses, we demonstrate our proposed schemes can be efficiently applied to online survey with accuracy and strong privacy.

Abstract Image

Abstract Image

实现在线调查的强隐私。
由于互联网接入和现代数字和移动设备的普及,在线调查已经蓬勃发展成为营销,社会,金融和医学研究的数据收集。然而,传统的在线调查数据收集方式存在严重的隐私问题。现有的隐私保护技术对网络调查的隐私保护力度不够。本文提出了一种实用的强隐私在线调查方案SPS,该方案基于一种新的数据采集技术——双矩阵掩蔽(dual matrix masking, DM2),以较低的计算开销保证了统计结果的正确性,并实现了通用可验证性、鲁棒性和强隐私性。我们还提出了一个更健壮的方案RSPS,它包含多个分布式调查管理器。RSPS方案保留了SPS的优良特性,进一步实现了抗联合合谋攻击的鲁棒强隐私性。通过广泛的分析,我们证明了所提出的方案可以有效地应用于在线调查,具有准确性和强隐私性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.80
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信