<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Are you really my friend? efficient and secure friend-matching in mobile social networks

Loading...
Thumbnail Image

Departments

School / College / Institute

Item type:Organizational Unit,

Program

Organization Authors

Co-Authors

Beato, Filipe

Preneel, Bart

Date

Language

Embargo Status

Yes

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

Social networks provide users with solutions to manage and acquire social connections in the modern society. Since users of a social network can make a new friendship even when they are not meeting physically, there should be a mechanism enabling them to securely verify identity of each other. One such mechanism is to check if there are enough number of common friends, relying on the friendships established already. Current protocols for mobile social networks require parties to act honestly during the protocol, and are limited to the two-party settings. We propose two solutions for friend matching based on authenticated data structures and polynomial operations that preserve privacy of non-common friends and provide authenticity of the result. Both constructions are efficient and general to be employed in multi-party settings.

Source

Publisher

Institute of Electrical and Electronics Engineers

Citation

item.page.haspartof

Source

2017 2nd IEEE European Symposium On Security And Privacy Workshops (Euros&Pw)

item.page.ispartofseries

item.page.edition

DOI

10.1109/EuroSPW.2017.61

item.page.datauri

item.page.link

Rights

CC BY (Attribution)

Copyrights Note

Creative Commons license

Except where otherwise noted, this item's license is described as CC BY (Attribution)

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators