在社交网络中发现联系人的隐私保护鲁棒实现

Fabian Deifuß, Cornelius Ihle, M. Schubotz, Bela Gipp
{"title":"在社交网络中发现联系人的隐私保护鲁棒实现","authors":"Fabian Deifuß, Cornelius Ihle, M. Schubotz, Bela Gipp","doi":"10.5283/epub.44954","DOIUrl":null,"url":null,"abstract":"Current instant messengers store the users’ phone book contacts typically unencrypted or hashed on a central server. In case of a server’s corruption, all contacts are either directly available in plaintext or can be unmasked using a simple dictionary attack. To solve this problem, we present procd [pʁoːst], a python implementation for privacy preserving contact discovery. procd is a trustless solution that requires neither plaintext numbers nor hashes of single phone numbers to retrieve contacts. Instead, we transfer hashed combinations of multiple phone numbers, which increases the effort for dictionary attacks to an unfeasible level using today’s hardware.","PeriodicalId":90875,"journal":{"name":"ISI ... : ... IEEE Intelligence and Security Informatics. IEEE International Conference on Intelligence and Security Informatics","volume":"368 1","pages":"363-368"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"procd: A Privacy-preserving Robust Implementation to Discover Contacts in Social Networks\",\"authors\":\"Fabian Deifuß, Cornelius Ihle, M. Schubotz, Bela Gipp\",\"doi\":\"10.5283/epub.44954\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Current instant messengers store the users’ phone book contacts typically unencrypted or hashed on a central server. In case of a server’s corruption, all contacts are either directly available in plaintext or can be unmasked using a simple dictionary attack. To solve this problem, we present procd [pʁoːst], a python implementation for privacy preserving contact discovery. procd is a trustless solution that requires neither plaintext numbers nor hashes of single phone numbers to retrieve contacts. Instead, we transfer hashed combinations of multiple phone numbers, which increases the effort for dictionary attacks to an unfeasible level using today’s hardware.\",\"PeriodicalId\":90875,\"journal\":{\"name\":\"ISI ... : ... IEEE Intelligence and Security Informatics. IEEE International Conference on Intelligence and Security Informatics\",\"volume\":\"368 1\",\"pages\":\"363-368\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ISI ... : ... IEEE Intelligence and Security Informatics. IEEE International Conference on Intelligence and Security Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5283/epub.44954\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISI ... : ... IEEE Intelligence and Security Informatics. IEEE International Conference on Intelligence and Security Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5283/epub.44954","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

目前的即时通讯工具通常将用户的电话簿联系人存储在一个中央服务器上,这些联系人通常是未加密的或散列的。在服务器损坏的情况下,所有联系人要么直接以明文形式可用,要么可以使用简单的字典攻击来解密。为了解决这个问题,我们提出了procd [p [o] st],一个保护隐私的联系人发现的python实现。Procd是一种无需信任的解决方案,既不需要明文号码,也不需要单个电话号码的哈希值来检索联系人。相反,我们传输多个电话号码的散列组合,这将字典攻击的工作量增加到使用当今硬件无法实现的水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
procd: A Privacy-preserving Robust Implementation to Discover Contacts in Social Networks
Current instant messengers store the users’ phone book contacts typically unencrypted or hashed on a central server. In case of a server’s corruption, all contacts are either directly available in plaintext or can be unmasked using a simple dictionary attack. To solve this problem, we present procd [pʁoːst], a python implementation for privacy preserving contact discovery. procd is a trustless solution that requires neither plaintext numbers nor hashes of single phone numbers to retrieve contacts. Instead, we transfer hashed combinations of multiple phone numbers, which increases the effort for dictionary attacks to an unfeasible level using today’s hardware.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信