User-Friendly Matching Protocol for Online Social Networks

被引：1

作者：

Tang, Qiang ^{[1
]}

机构：

[1] Univ Twente, Fac EEMCS, DIES, POB 217, NL-7500 AE Enschede, Netherlands

来源：

PROCEEDINGS OF THE 17TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'10) | 2010年

关键词：

Online social network; matching; privacy;

D O I：

10.1145/1866307.1866413

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper,we outline a privacy-preserving matching protocol for OSN (online social network) users to find their potential friends. With the proposed protocol, a logged-in user can match her profile with that of an off-line stranger, while both eliminates the requirement of "out-of-band" communication channels, which is one of the biggest obstacles facing cryptographic solutions for OSNs.

引用

页码：732 / 734

页数：3

共 7 条

[1]

[Anonymous], 2008, P 1 WORKSH ONL SOC N

[2]

Dodis Y, 2004, LECT NOTES COMPUT SC, V3027, P523

[3]

Freedman M. J., 2007, P 6 INT WORKSH PEER

[4]

Lucas MatthewM., 2008, Proceedings of the 7th ACM workshop on Privacy in the electronic society, WPES '08, P1, DOI DOI 10.1145/1456403.1456405

[5]

Mori G, 2003, PROC CVPR IEEE, P134

[6]

Paillier P, 1999, LECT NOTES COMPUT SC, V1592, P223

[7] Telling humans and computers apart automatically [J].

von Ahn, L ;

Blum, M ;

Langford, J .

COMMUNICATIONS OF THE ACM, 2004, 47 (02) :57-60

← 1 →