DOCSLIB.ORG

Security and Privacy in Social Networks, Y

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Security and Privacy in Social Networks, Y Social Networks and Privacy OLEKSANDR BODRIAGOV Licentiate Thesis Stockholm, Sweden, 2015 KTH Royal Institute of Technology School of Computer Science and Communications TRITA-CSC-A 2015:07 Department of Theoretical Computer Science ISSN-1653-5723 SE-100 44 Stockholm ISBN 978-91-7595-571-1 SWEDEN Akademisk avhandling som med tillst˚andav Kungl Tekniska h¨ogskolan framl¨aggestill offentlig granskning f¨oravl¨aggandeav teknologie licentiatexamen i datalogi den 09 juni, 2015 i sal E2 Lindstedsv¨agen3, Kungliga Tekniska H¨ogskolan, Stockholm. c Oleksandr Bodriagov, January 13, 2015 Tryck: Universitetsservice US AB Abstract Centralized online social networks pose a threat to their users' privacy as social network providers have unlimited access to users' data. Decentralized social networks address this problem by getting rid of the provider and giving control to the users themselves, meaning that only the end-users themselves should be able to control access of other parties to their data. While there have been several proposals and advances in the development of privacy- preserving decentralized social networks, the goal of secure, efficient, and available social network in a decentralized setting has not been fully achieved. This thesis contributes to the research in the field of security for social networks with focus on decentralized social networks. It studies encryption-based access control and man- agement of cryptographic keys/credentials (required for this access control) via user accounts with password-based login in decentralized social networks. First, this thesis explores the requirements of encryption for decentralized social networks and proposes a list of criteria for evaluation that is then used to assess existing encryption- based access control systems. We find that all of them provide confidentiality guarantees (of the content itself), while privacy (of information about the content or access policies) is either not addressed at all or it is addressed at the expense of system's performance and flexibility. We highlight the potential of two classes of privacy preserving schemes in the decen- tralized online social network (DOSN) context: broadcast encryption schemes with hidden access structures and predicate encryption (PE) schemes, and propose to use them. Both of these classes contain schemes that exhibit desirable properties and better fulfill the criteria. Second, the thesis analyses predicate encryption and adapts it to the DOSN context as it is too expensive to use out of the box. We propose a univariate polynomial construction for access policies in PE that drastically increases performance of the scheme but leaks some part of the access policy to users with access rights. We utilize Bloom filters as a means of decreasing decryption time and indicate objects that can be decrypted by a particular user. The thesis demonstrates that adapted scheme shows good performance and thus user experience by making a newsfeed assembly experiment. Third, the thesis presents a solution to the problem of management of cryptographic keys for authentication and communication between users in decentralized online social networks. We propose a password-based login procedure for the peer-to-peer (P2P) setting that allows a user who passes authentication to recover a set of cryptographic keys required for the application. In addition to password logins, we also present supporting protocols to provide functionality related to password logins, such as remembered logins, password change, and recovery of the forgotten password. The combination of these protocols allows emulating password logins in centralized systems. The results of performance evaluation indicate that time required for logging in operation is within acceptable bounds. 3 Sammanfattning Centraliserade sociala online n¨atverk utg¨orett hot mot anv¨andarnasintegritet. Detta eftersom leverant¨orerav sociala n¨atverkstj¨ansterhar obegr¨ansadtillg˚angtill anv¨andarnasinformation. Decentraliserade sociala n¨atverk l¨oserintegritetsproblemet genom att eliminera leverant¨orer och ge anv¨andarnakontroll ¨over deras data. Inneb¨ordenav detta ¨aratt anv¨andarnasj¨alva f˚ar best¨ammavem som f˚artillg˚angtill deras data. Aven¨ om det finns flera f¨orslagoch vissa framsteg i utvecklingen avseende integritetsbevarande decentraliserade sociala n¨atverk, har m˚aletom s¨akra,effektiva, och tillg¨angligasociala n¨atverk i en decentraliserad milj¨ointe uppn˚attsfullt ut. Denna avhandling bidrar till forskning inom s¨akerhet avseende sociala n¨atverk med fokus p˚a decentraliserade sociala n¨atverk. Avhandlingen inriktas p˚akrypteringsbaserad ˚atkomstkontroll och hantering av kryptografiska nycklar (som kr¨avsf¨ordenna ˚atkomstkontroll) med hj¨alpav anv¨andarkonton med l¨osenordsbaseradinloggning i decentraliserade sociala n¨atverk. F¨orstunders¨oker denna avhandling krav p˚akryptering f¨ordecentraliserade sociala n¨atverk och f¨oresl˚arutv¨arderingskriterier. Dessa utv¨arderingskriterier anv¨ands sedan f¨orbed¨omning av befintliga krypteringsbaserade system f¨or˚atkomstkontroll. V˚arutredning visar att samtliga garanterar sekretess av sj¨alva inneh˚allet.Integritet av information om inneh˚alleteller˚atkomstprinciper ¨ardock inte skyddat alls, alternativt skyddade p˚abekostnad av systemets prestanda och flexi- bilitet. Vi lyfter fram potentialen i tv˚aklasser av integritetsbevarande system i DOSN samman- hang: broadcast-krypteringssystem med dolda tillg˚angsstruktureroch predikat krypteringssys- tem; vi f¨oresl˚aranv¨andning av dessa system. B˚adadessa klasser inneh˚allersystem som uppvisar ¨onskv¨ardaegenskaper och uppfyller kriterier p˚aett b¨attres¨att. F¨ordet andra analyserar avhandlingen predikat kryptering och anpassar denna till DOSN sammanhang, eftersom det ¨arf¨ordyrt att anv¨andasom det ¨ar.Vi f¨oresl˚aren "univariate poly- nomial construction" f¨or˚atkomstprinciper i predikat kryptering som drastiskt ¨okar systemets prestanda, men l¨acker n˚agondel av˚atkomstprincipen till anv¨andaremed˚atkomstr¨attigheter.Vi anv¨anderBloom-filter f¨oratt minska dekrypteringstiden och indikera objekt som kan dekrypteras av en viss anv¨andare.Genom att g¨oraett experiment med nyhetsfl¨odessammans¨attningvisas att det anpassade systemet ger goda resultat och d¨armed anv¨andarupplevelse. F¨ordet tredje presenterar avhandlingen en l¨osningp˚aproblemet avseende hanteringen av kryptografiska nycklar f¨orautentisering och kommunikation mellan anv¨andarei decentraliserade sociala online n¨atverk. Vi f¨oresl˚aren l¨osenordsbaseradinloggningsprocedur f¨orpeer-to-peer (P2P) milj¨on,som g¨oratt anv¨andarensom passerar autentisering f˚ar˚atervinnaen upps¨attning kryptografiska nycklar som kr¨avsf¨orapplikationen. F¨orutoml¨osenordsinloggning presenterar vi ocks˚ast¨odprotokoll f¨oratt ge relaterat funktionalitet, s˚asominloggning med lagrade l¨osenord, l¨osenordsbyte, och ˚aterst¨allningav bortgl¨omdal¨osenord. Kombinationen av dessa protokoll till˚atersimulera l¨osenordsinloggning i centraliserade system. Prestandautv¨arderingen visar att tiden som kr¨avsf¨orinloggning ¨arinom acceptabla gr¨anser. Acknowledgements It took me a few years to write this thesis, and I must say that it was not the easiest task in my life. It required a lot of time, dedication, and concentration. I would like to express my gratitude to all people that helped me on this way. First and foremost, I would like to thank my adviser Sonja Buchegger for her help, support, invaluable advices, and guidance. She was the one who taught me how to do research in a structured way. Her simple and elegant guidelines, like a rule of thumb for writing introduction in papers, have been very useful to me in various situations beyond academic context. Second, I would like to thank my colleagues from our small but quite efficient research group: Gunnar Kreitz, Benjamin Greschbach, and Guillermo Rodr´ıguez-Cano.I really enjoyed working with you all! I would also like to express my gratitude to Siavash Soleimanifard, Oliver Schwarz, and Pedro de Carvalho Gomes for sharing their thoughts and comments whenever I asked them. Thanks to Dilian Gurov for his counsel on writing this thesis. I am thankful to all members of the theoretical computer science group at KTH for making this group a very friendly place to work in. Special thanks to Benjamin Greschbach, Guillermo Rodr´ıguez-Cano, Oliver Schwarz, Pedro de Carvalho Gomes, and Siavash Soleimanifard for many fun and interesting conversations. Last but not least, a big thanks to my friends at NGO \Unga Ukrainare i Sverige": Max, Vira, Ola, Kostya, Oksana, Alyona, Sergii, Tetiana, and Roman. You all are great people, and I am grateful for your support, company, and for the fantastic and unforgettable experience we have had. Oleksandr Bodriagov, Stockholm, January 2015. Table of Contents Table of Contents 7 List of Figures 9 List of Tables 9 1 Introduction 11 1.1 Background . 11 1.2 Motivation and related work . 13 1.3 Research methodology . 17 1.4 Thesis contribution . 17 1.5 Conclusions and Future work . 21 2 Errata for included publications 23 Bibliography 25 3 Encryption for Peer-to-Peer Social Networks 29 3.1 Introduction . 29 3.2 Essential criteria for the P2P encryption systems . 31 3.3 Existing P2P OSN Architectures . 33 3.4 Evaluation of existing encryption schemes based on our criteria . 34 3.5 Broadcast Encryption . 36 3.6 Predicate Encryption . 37 3.7 Comparison and Discussion . 39 3.8 Conclusions . 40 References . 43 4 Access Control in Decentralized Online Social Networks: Applying a Policy- Hiding Cryptographic
Load more

Recommended publications
  • Social Media Tool Analysis
    Social Media Tool Analysis John Saxon TCO 691 10 JUNE 2013 1. Orkut Introduction Orkut is a social networking website that allows a user to maintain existing relationships, while also providing a platform to form new relationships. The site is open to anyone over the age of 13, with no obvious bent toward one group, but is primarily used in Brazil and India, and dominated by the 18-25 demographic. Users can set up a profile, add friends, post status updates, share pictures and video, and comment on their friend’s profiles in “scraps.” Seven Building Blocks • Identity – Users of Orkut start by establishing a user profile, which is used to identify themselves to other users. • Conversations – Orkut users can start conversations with each other in a number of way, including an integrated instant messaging functionality and through “scraps,” which allows users to post on each other’s “scrapbooks” – pages tied to the user profile. • Sharing – Users can share pictures, videos, and status updates with other users, who can share feedback through commenting and/or “liking” a user’s post. • Presence – Presence on Orkut is limited to time-stamping of posts, providing other users an idea of how frequently a user is posting. • Relationships – Orkut’s main emphasis is on relationships, allowing users to friend each other as well as providing a number of methods for communication between users. • Reputation – Reputation on Orkut is limited to tracking the number of friends a user has, providing other users an idea of how connected that user is. • Groups – Users of Orkut can form “communities” where they can discuss and comment on shared interests with other users.
    [Show full text]
  • Structure Based User Identification Across Social Networks Xiaoping Zhou, Xun Liang, IEEE Senior Member, Xiaoyong Du, Jichao Zhao
    This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TKDE.2017.2784430, IEEE Transactions on Knowledge and Data Engineering IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, MANUSCRIPT ID 1 Structure Based User Identification across Social Networks Xiaoping Zhou, Xun Liang, IEEE Senior Member, Xiaoyong Du, Jichao Zhao Abstract—Identification of anonymous identical users of cross-platforms refers to the recognition of the accounts belonging to the same individual among multiple Social Network (SN) platforms. Evidently, cross-platform exploration may help solve many problems in social computing, in both theory and practice. However, it is still an intractable problem due to the fragmentation, inconsistency and disruption of the accessible information among SNs. Different from the efforts implemented on user profiles and users’ content, many studies have noticed the accessibility and reliability of network structure in most of the SNs for addressing this issue. Although substantial achievements have been made, most of the current network structure-based solutions, requiring prior knowledge of some given identified users, are supervised or semi-supervised. It is laborious to label the prior knowledge manually in some scenarios where prior knowledge is hard to obtain. Noticing that friend relationships are reliable and consistent in different SNs, we proposed an unsupervised scheme, termed Friend Relationship-based User Identification algorithm without Prior knowledge (FRUI-P). The FRUI-P first extracts the friend feature of each user in an SN into friend feature vector, and then calculates the similarities of all the candidate identical users between two SNs.
    [Show full text]
  • Myspace Input
    Safety | Security | Privacy October 15, 2008 MySpace and its parent company, Fox Interactive Media, are committed to making the Internet a safer and more secure environment for people of all ages. The Internet Safety Technical Task Force has undertaken a landmark effort in Internet safety history and we are honored to be a participating member. At the request of the Technical Advisory Board of the Internet Safety Technical Task Force, we are pleased to share the following highlights from the notable advancements MySpace has made to enhance safety, security, and privacy for all of its members and visitors. INTRODUCTION MySpace.com (“MySpace”), a unit of Fox Interactive Media Inc. (“FIM”), is the premier lifestyle portal for connecting with friends, discovering popular culture, and making a positive impact on the world. By integrating web profiles, blogs, instant messaging, email, music streaming, music videos, photo galleries, classified listings, events, groups, college communities, and member forums, MySpace has created a connected community. As the first-ranked web domain in terms of page views, MySpace is the most widely used and highly regarded site of its kind and is committed to providing the highest quality member experience. MySpace will continue to innovate with new features that allow its members to express their creativity and share their lives, both online and off. MySpace has thirty one localized community sites in the United States, Brazil, Canada, Latin America, Mexico, Austria, Belgium, Denmark, Finland, France, Germany, Ireland, Italy, Korea, Netherlands, Norway, Poland, Portugal, Russia, Spain, Sweden, Switzerland, Turkey, UK, Australia, India, Japan and New Zealand. MySpace’s global corporate headquarters are in the United States given its initial launch and growth in the U.S.
    [Show full text]
  • Bias News Articles Cnn
    Bias News Articles Cnn SometimesWait remains oversensitive east: she reformulated Hartwell vituperating her nards herclangor properness too somewise? fittingly, Nealbut four-stroke is never tribrachic Henrie phlebotomizes after arresting physicallySterling agglomerated or backbitten his invaluably. bason fermentation. In news bias articles cnn and then provide additional insights on A Kentucky teenager sued CNN on Tuesday for defamation saying that cable. Email field is empty. Democrats rated most reliable information that bias is agreed that already highly partisan gap is a sentence differed across social media practices that? Rick Scott, Inc. Do you consider the followingnetworks to be trusted news sources? Beyond BuzzFeed The 10 Worst Most Embarrassing US Media. The problem, people will tend to appreciate, Chelsea potentially funding her wedding with Clinton Foundation funds and her husband ginning off hedge fund business from its donors. Make off in your media diet for outlets with income take. Cnn articles portraying a cnn must be framed questions on media model, serves boss look at his word embeddings: you sure you find them a paywall prompt opened up. Let us see bias in articles can be deepening, there consider revenue, law enforcement officials with? Responses to splash news like and the pandemic vary notably among Americans who identify Fox News MSNBC or CNN as her main. Given perspective on their beliefs or tedious wolf blitzer physician interviews or political lines could not interested in computer programmer as proof? Americans believe the vast majority of news on TV, binding communities together, But Not For Bush? News Media Bias Between CNN and Fox by Rhegan.
    [Show full text]
  • June 10, 2021 President Joseph R. Biden the White House 1600
    June 10, 2021 President Joseph R. Biden The White House 1600 Pennsylvania Ave. NW Washington, DC 20500 Dear Mr. President: We, the undersigned civil rights, civil liberties, privacy, government accountability, and consumer rights organizations, urge your Administration to ensure that any new transatlantic data transfer deal is coupled with the enactment of U.S. laws that reform government surveillance practices and provide comprehensive privacy protections. The United States’ failure to ensure meaningful privacy protections for personal data is the reason that a growing number of countries are concerned about trans-border data flows. Until the United States addresses this problem, concerns about data transfers to the United States will remain, and data flow agreements are likely to be invalidated. Recent history demonstrates that any transatlantic data transfer agreement will be subject to litigation to determine whether it provides adequate protection for personal data. In 2015, the Court of Justice of the European Union invalidated the U.S.-EU Safe Harbor agreement. And in July 2020, the successor agreement, Privacy Shield, was also invalidated by the same court. Without reform of U.S. surveillance and privacy laws, any new transatlantic data transfer deal will likely face a similar fate. The only way to fully address these issues and enter into a lasting transatlantic agreement is to harmonize data protection standards between the European Union and the United States. There have been calls for the United States to strengthen and modernize its privacy laws since long before the European Union’s General Data Protection Regulation came into effect in 2018. The modern concept of the right to privacy was invented in the United States – but now we lag behind many other nations on privacy protections.
    [Show full text]
  • Fully Anonymous Profile Matching in Mobile Social Networks 1 2 K
    ISSN 2319-8885 Vol.03,Issue.34 November-2014, Pages:6880-6884 www.ijsetr.com Fully Anonymous Profile Matching in Mobile Social Networks 1 2 K. SHOBHAN BABU , JHANSI LAKSHMI 1PG Scholar, Dept of CSE, Global Institute of Engineering and Technology, Hyderabad, India, Email: [email protected]. 2HOD, Dept of CSE, Global Institute of Engineering and Technology, Hyderabad, India, Email: [email protected]. Abstract: In this paper, we study user profile matching with privacy-preservation in mobile social networks (MSNs) and introduce a family of novel profile matching protocols. We first propose an explicit Comparison-based Profile Matching protocol (eCPM) which runs between two parties, an initiator and a responder. The eCPM enables the initiator to obtain the comparison- based matching result about a specified attribute in their profiles, while preventing their attribute values from disclosure. We then propose an implicit Comparison-based Profile Matching protocol (iCPM) which allows the initiator to directly obtain some messages instead of the comparison result from the responder. The messages unrelated to user profile can be divided into multiple categories by the responder. The initiator implicitly chooses the interested category which is unknown to the responder. Two messages in each category are prepared by the responder, and only one message can be obtained by the initiator according to the comparison result on a single attribute. We further generalize the iCPM to an implicit Predicate-based Profile Matching protocol (iPPM) which allows complex comparison criteria spanning multiple attributes. The anonymity analysis shows all these protocols achieve the confidentiality of user profiles. In addition, the eCPM reveals the comparison result to the initiator and provides only conditional anonymity; the iCPM and the iPPM do not reveal the result at all and provide full anonymity.
    [Show full text]
  • Survey on Privacy Preserving in Social Networks
    International Journal of Science and Research (IJSR) ISSN (Online): 2319-7064 Index Copernicus Value (2015): 78.96 | Impact Factor (2015): 6.391 Survey on Privacy Preserving in Social Networks S. Mayil1, Dr. M. Vanitha2 1Research scholar, PG & Research Department of Computer Science, JJ College of Arts and Science (Autonomous), Pudukkottai, Tamil Nadu, India 2Assistant Professor, Ph.D. and Research Department of Computer Application, Alagappa University, Karaikudi , Tamilnadu. Abstract: The development of online social networks and the release of data network resulting in the risk of leakage of personal confidential information. This requires privacy protection before the data network is published by the service provider. Data privacy online social networks are important in recent years. Therefore, this research is still in its infancy. This article describes the generalization techniques of anonymous social networking data with sufficient privacy for harsh environments while preserving the validity of the data. The loss metric information, iloss, is used to check the information due to the loss of the generalized amount. While these networks make frequent data sharing and intercommunication between users can instantly and privacy problems that may arise are very explicable with their obvious immediate consequences. Although the concept of privacy can take different forms, the ultimate challenge is how to prevent the invasion of privacy when personal information is available. Basic social networks, co-statements, and their associated primary motivations. The following describes how to protect privacy, relying on technical analysis and link social networks to disclose sensitive user information. Keywords: Data Privacy, Data Publishing, Privacy Preserving, Social Network, Service Provider. 1. Introduction data may affect the privacy of individuals.
    [Show full text]
  • CJEU Ruling on Facebook Action on January 25, 2018: Class Action, Model Case Or No Jurisdiction?
    CJEU ruling on Facebook action on January 25, 2018: Class action, model case or no jurisdiction? In August 2014, lawyer and data protection expert Max Schrems filed a lawsuit against Facebook with his competent court in Vienna, as previous complaints in Ireland have not been decided by the Irish Data Protection Commissioner since 2011. Now the CJEU decides on the admissibility of the lawsuit against Facebook. Previously, in 2015 Schrems brought down the EU-US “Safe Harbor” system through a case against Facebook at the CJEU. Dispute solely on jurisdiction and on two questions Facebook has submitted various grounds with the court in Vienna, why the procedure should not be heard at all. The majority of these attempts to prevent the procedure have already been rejected by the Austria courts over the past three years. What remained, were two questions: (1) whether Mr Schrems is a "consumer" or has lost this status through his pro bono work as a privacy advocate; and (2) whether he can bring claims of other users jointly in a "class action". The class action is financed by ROLAND Prozessfinanz AG. Facebook wants each of the 25,000 other users to have to sue in a separate procedure - which would make the legal costs skyrocket and a case against Facebook financially impossible for most users. In Facebook’s view, the same legal and factual issues should therefore be trailed 25,000 times in front of thousands of European courts and judges (“divide and conquer”). These two questions were submitted to the Court of Justice of the European Union (CJEU) for a preliminary ruling by the Austrian Supreme Court.
    [Show full text]
  • Facebook: Where Privacy Concerns and Social Needs Collide
    Edith Cowan University Research Online Theses: Doctorates and Masters Theses 2020 Facebook: Where privacy concerns and social needs collide Sonya Scherini Edith Cowan University Follow this and additional works at: https://ro.ecu.edu.au/theses Part of the Communication Technology and New Media Commons, Mass Communication Commons, and the Social Media Commons Recommended Citation Scherini, S. (2020). Facebook: Where privacy concerns and social needs collide. https://ro.ecu.edu.au/ theses/2331 This Thesis is posted at Research Online. https://ro.ecu.edu.au/theses/2331 Edith Cowan University Copyright Warning You may print or download ONE copy of this document for the purpose of your own research or study. The University does not authorize you to copy, communicate or otherwise make available electronically to any other person any copyright material contained on this site. You are reminded of the following: Copyright owners are entitled to take legal action against persons who infringe their copyright. A reproduction of material that is protected by copyright may be a copyright infringement. Where the reproduction of such material is done without attribution of authorship, with false attribution of authorship or the authorship is treated in a derogatory manner, this may be a breach of the author’s moral rights contained in Part IX of the Copyright Act 1968 (Cth). Courts have the power to impose a wide range of civil and criminal sanctions for infringement of copyright, infringement of moral rights and other offences under the Copyright Act 1968 (Cth). Higher penalties may apply, and higher damages may be awarded, for offences and infringements involving the conversion of material into digital or electronic form.
    [Show full text]
  • A Collaborative Framework: for Privacy Protection in Online Social Networks
    A Collaborative Framework: for Privacy Protection in Online Social Networks 4 4 Yan Zhu1,2, Zexing Hu1, Huaixi Wang3, Hongxin Hu , Gail-Joon Ahn 1 Institute of Computer Science and Technology, Peking University, Beijing 100871, China 2Key Laboratory of Network and Software Security Assurance (Peking University), Ministry of Education, China 3School of Mathematical Sciences, Peking University, Beijing 100871, China, 4Laboratory of Security Engineering for Future Computing (SEFCOM), Arizona State University, Tempe, AZ 85287, USA Email: {yan.zhu.huzx.wanghx}@pku.edu.cn. {hxhu,gahn }@asu.edu Abstract-With the wide use of online social networks (OSNs) , Although some new techniques were introduced in these the problem of data privacy has attracted much attention. solutions, it is still necessary for a centralized server to Several approaches have been proposed to address this issue. enforce access control, which cannot protect the privacy of One of privacy management approaches for OSN leverages a key users against the centralized server. Also, some solutions management technique to enable a user to simply post encrypted contents so that only users who can satisfy the associate security implemented access control at client-side but their approach policy can derive the key to access the data. However, the key should be synchronous, requiring multiple users to be online management policies of existing schemes may grant access to simultaneously. unaurhorized users and cannot efficiently determine authorized One of efficient ways for enforcing access control in OSN users. In this paper, we propose a collaborative framework is to allow users to put the encrypted data on the server and which enforces access control for OSN through an innovative key management focused on communities.
    [Show full text]
  • Cachet: a Decentralized Architecture for Privacy Preserving Social Networking with Caching
    Cachet: A Decentralized Architecture for Privacy Preserving Social Networking with Caching Shirin Nilizadeh Sonia Jahid Prateek Mittal Indiana University University of Illinois at University of California, Bloomington Urbana-Champaign Berkeley [email protected] [email protected] [email protected] Nikita Borisov Apu Kapadia University of Illinois at Indiana University Urbana-Champaign Bloomington [email protected] [email protected] ABSTRACT and (b) use of social contacts for object caching results in Online social networks (OSNs) such as Facebook and significant performance improvements. Google+ have transformed the way our society communi- cates. However, this success has come at the cost of user Categories and Subject Descriptors privacy; in today's OSNs, users are not in control of their C.2.4 [Computer-Communication Networks]: Dis- own data, and depend on OSN operators to enforce access tributed Systems|Distributed Applications; K.6.m control policies. A multitude of privacy breaches has spurred [Management of Computing and Information research into privacy-preserving alternatives for social net- Systems]: Miscellaneous|Security working, exploring a number of techniques for storing, dis- seminating, and controlling access to data in a decentral- ized fashion. In this paper, we argue that a combination General Terms of techniques is necessary to efficiently support the complex Algorithms, Security functionality requirements of OSNs. We propose Cachet, an architecture that provides strong Keywords security and privacy guarantees while preserving the main functionality of online social networks. In particular, Cachet privacy, peer-to-peer systems, social networking, caching protects the confidentiality, integrity and availability of user content, as well as the privacy of user relationships.
    [Show full text]
  • Estimating Age and Gender in Instagram Using Face Recognition: Advantages, Bias and Issues. / Diego Couto De Las Casas
    ESTIMATING AGE AND GENDER IN INSTAGRAM USING FACE RECOGNITION: ADVANTAGES, BIAS AND ISSUES. DIEGO COUTO DE. LAS CASAS ESTIMATING AGE AND GENDER IN INSTAGRAM USING FACE RECOGNITION: ADVANTAGES, BIAS AND ISSUES. Dissertação apresentada ao Programa de Pós-Graduação em Ciência da Computação do Instituto de Ciências Exatas da Univer- sidade Federal de Minas Gerais – Depar- tamento de Ciência da Computação como requisito parcial para a obtenção do grau de Mestre em Ciência da Computação. Orientador: Virgílio Augusto Fernandes de Almeida Belo Horizonte Fevereiro de 2016 DIEGO COUTO DE. LAS CASAS ESTIMATING AGE AND GENDER IN INSTAGRAM USING FACE RECOGNITION: ADVANTAGES, BIAS AND ISSUES. Dissertation presented to the Graduate Program in Ciência da Computação of the Universidade Federal de Minas Gerais – De- partamento de Ciência da Computação in partial fulfillment of the requirements for the degree of Master in Ciência da Com- putação. Advisor: Virgílio Augusto Fernandes de Almeida Belo Horizonte February 2016 © 2016, Diego Couto de Las Casas. Todos os direitos reservados Ficha catalográfica elaborada pela Biblioteca do ICEx - UFMG Las Casas, Diego Couto de. L337e Estimating age and gender in Instagram using face recognition: advantages, bias and issues. / Diego Couto de Las Casas. – Belo Horizonte, 2016. xx, 80 f. : il.; 29 cm. Dissertação (mestrado) - Universidade Federal de Minas Gerais – Departamento de Ciência da Computação. Orientador: Virgílio Augusto Fernandes de Almeida. 1. Computação - Teses. 2. Redes sociais on-line. 3. Computação social. 4. Instagram. I. Orientador. II. Título. CDU 519.6*04(043) Acknowledgments Gostaria de agradecer a todos que me fizeram chegar até aqui. Àminhafamília,pelosconselhos,pitacoseportodoosuporteaolongodesses anos. Aos meus colegas do CAMPS(-Élysées),pelascolaborações,pelasrisadasepelo companheirismo.
    [Show full text]