Proceedings of the 13th Workshop on Privacy in the Electronic Society最新文献

筛选
英文 中文
Facet: Streaming over Videoconferencing for Censorship Circumvention 面向:流媒体视频会议的审查规避
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665944
Shuai Li, Michael Schliep, Nick Hopper
{"title":"Facet: Streaming over Videoconferencing for Censorship Circumvention","authors":"Shuai Li, Michael Schliep, Nick Hopper","doi":"10.1145/2665943.2665944","DOIUrl":"https://doi.org/10.1145/2665943.2665944","url":null,"abstract":"In this paper, we introduce Facet, an unobservable transport service for social video sites. Facet evades detection by Internet censors by streaming social videos over Skype calls, and applying a novel traffic-analysis countermeasure called video morphing. We report on the performance and security of a prototype implementation of Facet and find that a single Facet server can support roughly 20 simultaneous sessions, while providing strong unobservability: using the best known traffic analysis methods, a censor seeking to block 90% of Facet calls would need to block over 40% of all Skype calls. An additional benefit of our prototype implementation is that it avoids the distribution problem: clients can use Facet without installing any additional software.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127151343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 93
Private Browsing: an Inquiry on Usability and Privacy Protection 隐私浏览:可用性与隐私保护的探讨
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665953
Xianyi Gao, Yulong Yang, Huiqing Fu, J. Lindqvist, Yang Wang
{"title":"Private Browsing: an Inquiry on Usability and Privacy Protection","authors":"Xianyi Gao, Yulong Yang, Huiqing Fu, J. Lindqvist, Yang Wang","doi":"10.1145/2665943.2665953","DOIUrl":"https://doi.org/10.1145/2665943.2665953","url":null,"abstract":"Private browsing is a feature in web browsers to prevent local users from gaining information about browsing sessions. However, it is not clear how well people interpret private browsing's functionalities and what are the privacy gains from using it. Towards studying people's understanding of private browsing, we conducted a survey on Amazon Mechanical Turk. Our survey results show that (1) one third of our participants were not aware of this privacy-enhancing feature, and (2) for people who knew or even used this feature, they had various misconceptions which could put them at risk. In the end, we provide design suggestions to help address these misconceptions.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125004355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 31
Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection 非确定性有限自动机的遗忘评价及其在隐私保护病毒基因组检测中的应用
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665954
Hirohito Sasakawa, Hiroki Arimura, David duVerle, H. Arimura, K. Tsuda, Jun Sakuma
{"title":"Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection","authors":"Hirohito Sasakawa, Hiroki Arimura, David duVerle, H. Arimura, K. Tsuda, Jun Sakuma","doi":"10.1145/2665943.2665954","DOIUrl":"https://doi.org/10.1145/2665943.2665954","url":null,"abstract":"Various string matching problems can be solved by means of a deterministic finite automaton (DFA) or a non-deterministic finite automaton (NFA). In non-oblivious cases, DFAs are often preferred for their run-time efficiency despite larger sizes. In oblivious cases, however, the inevitable computation and communication costs associated with the automaton size are more favorable to NFAs. We propose oblivious protocols for NFA evaluation based on homomorphic encryption and demonstrate that our method can be orders of magnitude faster than DFA-based methods, making it applicable to real-life scenarios, such as privacy-preserving detection of viral infection using genomic data.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Sybil-Resistant Mixing for Bitcoin 比特币的抗sybil混合
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665955
G. Bissias, A. P. Ozisik, B. Levine, M. Liberatore
{"title":"Sybil-Resistant Mixing for Bitcoin","authors":"G. Bissias, A. P. Ozisik, B. Levine, M. Liberatore","doi":"10.1145/2665943.2665955","DOIUrl":"https://doi.org/10.1145/2665943.2665955","url":null,"abstract":"A fundamental limitation of Bitcoin and its variants is that the movement of coin between addresses can be observed by examining the public block chain. This record enables adversaries to link addresses to individuals, and to identify multiple addresses as belonging to a single participant. Users can try to hide this information by mixing, where a participant exchanges the funds in an address coin-for-coin with another participant and address. In this paper, we describe the weaknesses of extant mixing protocols, and analyze their vulnerability to Sybil-based denial-of-service and inference attacks. As a solution, we propose Xim, a two-party mixing protocol that is compatible with Bitcoin and related virtual currencies. It is the first decentralized protocol to simultaneously address Sybil attackers, denial-of-service attacks, and timing-based inference attacks. Xim is a multi-round protocol with tunably high success rates. It includes a decentralized system for anonymously finding mix partners based on ads placed in the block chain. No outside party can confirm or find evidence of participants that pair up. We show that Xim's design increases attacker costs linearly with the total number of participants, and that its probabilistic approach to mixing mitigates Sybil-based denial-of-service attack effects. We evaluate protocol delays based on our measurements of the Bitcoin network.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129305826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 135
Stylometric Linkability of Tweets 推文的文体链接性
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665966
M. A. Mishari, Dali Kaafar, Ekin Oguz, G. Tsudik
{"title":"Stylometric Linkability of Tweets","authors":"M. A. Mishari, Dali Kaafar, Ekin Oguz, G. Tsudik","doi":"10.1145/2665943.2665966","DOIUrl":"https://doi.org/10.1145/2665943.2665966","url":null,"abstract":"Microblogging is a very popular Internet activity that informs and entertains a large number of people via terse messages; e.g., tweets on Twitter. Even though microblogging does not emphasize privacy, authors can easily hide behind pseudonyms and multiple accounts on the same, or across multiple, site(s). In this paper, we explore stylometric linkability of tweets. Our results clearly demonstrate that multiple sets of tweets by the same author are easily linkable even when the number of possible authors is large. This is also confirmed by showing that linkability holds for a set of actual Twitter users who admittedly tweet via multiple accounts.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123153224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Fast and Private Genomic Testing for Disease Susceptibility 快速和私人基因组检测疾病易感性
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665952
G. Danezis, Emiliano De Cristofaro
{"title":"Fast and Private Genomic Testing for Disease Susceptibility","authors":"G. Danezis, Emiliano De Cristofaro","doi":"10.1145/2665943.2665952","DOIUrl":"https://doi.org/10.1145/2665943.2665952","url":null,"abstract":"Advances in DNA sequencing are bringing mass computational genomic testing increasingly closer to reality. The sensitivity of genetic data, however, prompts the need for carefully protecting patients' privacy. Also, it is crucial to conceal the test's specifics, which often constitute a pharmaceutical company's trade secret. This paper presents two cryptographic protocols for privately assessing a patient's genetic susceptibility to a disease, computing a weighted average of patient's genetic markers (the \"SNPs\") and their importance factor. We build on the architecture introduced by Ayday et al. but point out an important limitation of their model, namely, that the protocol leaks which and how many SNPs are tested. Then, we demonstrate that an alternative SNP encoding can simplify (private) computations, and make patient-side computation on a smartcard device extremely efficient. A second protocol variant, based on secret sharing, further reduces online computation.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126522054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 34
General Area or Approximate Location?: How People Understand Location Permissions 大致区域还是大致位置?:人们如何理解位置权限
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665957
Huiqing Fu, J. Lindqvist
{"title":"General Area or Approximate Location?: How People Understand Location Permissions","authors":"Huiqing Fu, J. Lindqvist","doi":"10.1145/2665943.2665957","DOIUrl":"https://doi.org/10.1145/2665943.2665957","url":null,"abstract":"More than half of American adults use smartphones and about two thirds of them use location-based services. On Android smartphones, these location-based services are implemented by apps. Android phones provide two location-related permissions: \"precise\" location and \"approximate\" location. In this paper, we present an online survey of 106 Android users to investigate how people understand location descriptions related to their apps. Our results suggest that most participants considered the \"precise\" location to mean their exact location and the \"approximate\" location as a general area. This mental model of the \"approximate\" location seems to allay people's privacy concerns related to their apps. However, after participants were shown the ground truth of how accurate \"approximate\" location actually is, twice as many participants no longer thought \"approximate\" location offered enough protection, compared to before showing the ground truth. Our results indicate that the location permissions might mislead smartphone users about the privacy protections the apps are providing.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126848161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Sensible Privacy: How We Can Protect Domestic Violence Survivors Without Facilitating Misuse 明智的隐私:我们如何保护家庭暴力幸存者而不助长滥用
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665965
B. Arief, Kovila P. L. Coopamootoo, M. Emms, A. Moorsel
{"title":"Sensible Privacy: How We Can Protect Domestic Violence Survivors Without Facilitating Misuse","authors":"B. Arief, Kovila P. L. Coopamootoo, M. Emms, A. Moorsel","doi":"10.1145/2665943.2665965","DOIUrl":"https://doi.org/10.1145/2665943.2665965","url":null,"abstract":"Privacy is a concept with real life ties and implications. Privacy infringement has the potential to lead to serious consequences for the stakeholders involved, hence researchers and organisations have developed various privacy enhancing techniques and tools. However, there is no solution that fits all, and there are instances where privacy solutions could be misused, for example to hide nefarious activities. Therefore, it is important to provide suitable measures and to make necessary design tradeoffs in order to avoid such misuse. This short paper aims to make a case for the need of careful consideration when designing a privacy solution, such that the design effectively addresses the user requirements while at the same time minimises the risk of inadvertently assisting potential offenders. In other words, this paper strives to promote \"sensible privacy\" design, which deals with the complex challenges in balancing privacy, usability and accountability. We illustrate this idea through a case study involving the design of privacy solutions for domestic violence survivors. This is the main contribution of the paper. The case study presents specific user requirements and operating conditions, which coupled with the attacker model, provide a complex yet interesting scenario to explore. One example of our solutions is described in detail to demonstrate the feasibility of our approach.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132676606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 28
Measuring the Leakage of Onion at the Root: A measurement of Tor's .onion pseudo-TLD in the global domain name system 测量洋葱在根部的泄漏:Tor的。Onion伪顶级域名在全球域名系统中的测量
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665951
Matthew Thomas, Aziz Mohaisen
{"title":"Measuring the Leakage of Onion at the Root: A measurement of Tor's .onion pseudo-TLD in the global domain name system","authors":"Matthew Thomas, Aziz Mohaisen","doi":"10.1145/2665943.2665951","DOIUrl":"https://doi.org/10.1145/2665943.2665951","url":null,"abstract":"The Tor project provides individuals with a mechanism of communicating anonymously on the Internet. Furthermore, Tor is capable of providing anonymity to servers, which are configured to receive inbound connections only through Tor---more commonly called hidden services. In order to route requests to these hidden services, a namespace is used to identify the resolution requests to such services. A namespace under a non-delegated (pseudo) top-level-domain (TLD) of .onion was elected. Although the Tor system was designed to prevent .onion requests from leaking into the global DNS resolution process, numerous requests are still observed in the global DNS. In this paper we will present the state of .onion requests received at the global public DNS A and J root nodes over a longitudinal period of time, a synthesis of Day In The Life of the Internet (DITL) data repository, and potential explanations of the leakage, and highlights of trends associated with global censorship events. By sharing this preliminary work, we wish to trigger further discussions on the matter in the community.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114915964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
IMUX: Managing Tor Connections from Two to Infinity, and Beyond IMUX:管理Tor连接从2到无限,以及超越
Proceedings of the 13th Workshop on Privacy in the Electronic Society Pub Date : 2014-11-03 DOI: 10.1145/2665943.2665948
John Geddes, Rob Jansen, Nicholas Hopper
{"title":"IMUX: Managing Tor Connections from Two to Infinity, and Beyond","authors":"John Geddes, Rob Jansen, Nicholas Hopper","doi":"10.1145/2665943.2665948","DOIUrl":"https://doi.org/10.1145/2665943.2665948","url":null,"abstract":"We consider proposals to improve the performance of the Tor overlay network by increasing the number of connections between re- lays, such as Torchestra and PCTCP. We introduce a new class of attacks that can apply to these designs, socket exhaustion, and show that these attacks are effective against PCTCP. We also describe IMUX, a design that generalizes the principles behind these designs while still mitigating against socket exhaustion attacks. We demonstrate empirically that IMUX resists socket exhaustion while finding that web clients can realize up to 25% increase in performance compared to Torchestra. Finally, we empirically evaluate the interaction between these designs and the recently proposed KIST design, which aims to improve performance by intelligently scheduling kernel socket writes.","PeriodicalId":408627,"journal":{"name":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116494241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信