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}
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.