Privacy-preserving profile matching using the social graph
暂无分享,去创建一个
[1] Benny Pinkas,et al. Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.
[2] Alec Wolman,et al. Lockr: better privacy for social networks , 2009, CoNEXT '09.
[3] Saikat Guha,et al. NOYB: privacy in online social networks , 2008, WOSN '08.
[4] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[5] Krishna P. Gummadi,et al. Measurement and analysis of online social networks , 2007, IMC '07.
[6] Nikita Borisov,et al. FlyByNight: mitigating the privacy risks of social networking , 2008, WPES '08.
[7] Matt Blaze,et al. Divertible Protocols and Atomic Proxy Cryptography , 1998, EUROCRYPT.
[8] Ramanathan V. Guha,et al. Propagation of trust and distrust , 2004, WWW '04.
[9] Virgílio A. F. Almeida,et al. Characterizing user behavior in online social networks , 2009, IMC '09.
[10] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.