M. Ekstrand, J. Riedl, and J. Konstan, Collaborative Filtering Recommender Systems, Foundations and Trends?? in Human???Computer Interaction, vol.4, issue.2, 2011.
DOI : 10.1561/1100000009

A. Boutet, D. Frey, R. Guerraoui, A. Jégou, and A. Kermarrec, WHATSUP: A Decentralized Instant News Recommender, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp.741-752, 2013.
DOI : 10.1109/IPDPS.2013.47

R. Baraglia, P. Dazzi, M. Mordacchini, and L. Ricci, A peer-to-peer recommender system for self-emerging user communities based on gossip overlays, Journal of Computer and System Sciences, vol.79, issue.2, pp.291-308, 2013.
DOI : 10.1016/j.jcss.2012.05.011

M. Bertier, D. Frey, R. Guerraoui, A. Kermarrec, and V. Leroy, The Gossple Anonymous Social Network, Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware, pp.191-211, 2010.
DOI : 10.1007/978-3-642-16955-7_10
URL : https://hal.archives-ouvertes.fr/hal-01055283

S. Voulgaris and M. V. Steen, Epidemic-Style Management of Semantic Overlays for Content-Based Searching, Euro-Par 2005 Parallel Processing, pp.1143-1152, 2005.
DOI : 10.1007/11549468_125

A. Boutet, D. Frey, A. Jégou, A. Kermarrec, and H. B. Ribeiro, Freerec: An anonymous and distributed personalization architecture, The First International Conference on Networked Systems, pp.58-73, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00844813

D. Frey, A. Jégou, and A. Kermarrec, Social Market: Combining Explicit and Implicit Social Networks, Stabilization, Safety, and Security of Distributed Systems, pp.193-207, 2011.
DOI : 10.1007/978-3-642-24550-3_16
URL : https://hal.archives-ouvertes.fr/inria-00624129

M. Bertier, R. Guerraoui, V. Leroy, and A. Kermarrec, Toward personalized query expansion, Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, SNS '09, pp.7-12, 2009.
DOI : 10.1145/1578002.1578004
URL : https://hal.archives-ouvertes.fr/inria-00368168

U. Kuter and J. Golbeck, SUNNY: a new algorithm for trust inference in social networks using probabilistic confidence models, Proceedings of the 22d National Conference on Artificial Intelligence, pp.1377-1382, 2007.

S. Blake-wilson and A. Menezes, Authenticated Diffe-Hellman Key Agreement Protocols, Selected Areas in Cryptography, pp.339-361, 1999.
DOI : 10.1007/3-540-48892-8_26

D. J. Bernstein, NaCl: Networking and cryptography library

B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970.
DOI : 10.1145/362686.362692

P. L. Ecuyer, Good parameters and implementations for combined multiple recursive random number generators, 1998.

M. Matsumoto and T. Nishimura, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Transactions on Modeling and Computer Simulation, vol.8, issue.1, pp.3-30, 1998.
DOI : 10.1145/272991.272995

M. Blum, Coin flipping by telephone a protocol for solving impossible problems, ACM SIGACT News, vol.15, issue.1, pp.23-27, 1983.
DOI : 10.1145/1008908.1008911

R. Cleve, Limits on the security of coin flips when half the processors are faulty, Proceedings of the eighteenth annual ACM symposium on Theory of computing , STOC '86, pp.364-369, 1986.
DOI : 10.1145/12130.12168

J. L. Herlocker, J. A. Konstan, A. Borchers, and J. , An algorithmic framework for performing collaborative filtering, Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '99, pp.230-237, 1999.
DOI : 10.1145/312624.312682

K. Goldberg, T. Roeder, and C. Perkins, Eigentaste: A constant time collaborative filtering algorithm, Information Retrieval, vol.4, issue.2, pp.133-151, 2001.
DOI : 10.1023/A:1011419012209

M. Naor, Bit Commitment Using Pseudo-Randomness, Journal of Cryptology, vol.4, pp.151-158, 1991.
DOI : 10.1007/0-387-34805-0_13

V. Leroy, B. B. Cambazoglu, and F. Bonchi, Cold start link prediction, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.393-402, 2010.
DOI : 10.1145/1835804.1835855
URL : https://hal.archives-ouvertes.fr/inria-00485619

X. Bai, M. Bertier, R. Guerraoui, A. Kermarrec, and V. Leroy, Gossiping personalized queries, Proceedings of the 13th International Conference on Extending Database Technology, EDBT '10, pp.87-98, 2010.
DOI : 10.1145/1739041.1739055
URL : https://hal.archives-ouvertes.fr/inria-00455643

S. Buchegger, D. Schiöberg, L. Vu, and A. Datta, PeerSoN: P2P social networking, Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, SNS '09, pp.46-52, 2009.
DOI : 10.1145/1578002.1578010

S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy et al., Opendht: A public dht service and its uses, Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp.73-84, 2005.

M. Jelasity and O. Babaoglu, T-Man: Gossip-Based Overlay Topology Management, Proceedings of the 3rd International Workshop on Engineering Self-Organising Applications, pp.1-15, 2005.
DOI : 10.1007/978-3-540-39671-0_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.9444

W. Dong, C. Moses, and K. Li, Efficient k-nearest neighbor graph construction for generic similarity measures, Proceedings of the 20th international conference on World wide web, WWW '11, pp.577-586, 2011.
DOI : 10.1145/1963405.1963487

L. A. Cutillo, R. Molva, and T. Strufe, Safebook: A privacy-preserving online social network leveraging on real-life trust, IEEE Communications Magazine, vol.47, issue.12, pp.94-101, 2009.
DOI : 10.1109/MCOM.2009.5350374
URL : https://hal.archives-ouvertes.fr/hal-00687143

R. Agrawal and R. Srikant, Privacy-preserving data mining, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp.439-450, 2000.

H. Polat and W. Du, SVD-based collaborative filtering with privacy, Proceedings of the 2005 ACM symposium on Applied computing , SAC '05, pp.791-795, 2005.
DOI : 10.1145/1066677.1066860

Z. Huang, W. Du, and B. Chen, Deriving private information from randomized data, Proceedings of the 2005 ACM SIGMOD international conference on Management of data , SIGMOD '05, pp.37-48, 2005.
DOI : 10.1145/1066157.1066163

H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar, On the privacy preserving properties of random data perturbation techniques, Third IEEE International Conference on Data Mining, pp.99-106, 2003.
DOI : 10.1109/ICDM.2003.1250908

M. Murugesan, W. Jiang, C. Clifton, L. Si, and J. Vaidya, Efficient privacy-preserving similar document detection, The VLDB Journal, vol.24, issue.2, pp.457-475, 2010.
DOI : 10.1007/s00778-009-0175-9

T. Zhu, G. Li, Y. Ren, W. Zhou, and P. Xiong, Differential privacy for neighborhood-based collaborative filtering, Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM '13, pp.752-759, 2013.
DOI : 10.1145/2492517.2492519

B. Schoenmakers and P. Tuyls, Private Profile Matching, Intelligent Algorithms in Ambient and Biomedical Computing, pp.259-272, 2006.
DOI : 10.1007/1-4020-4995-1_15
URL : http://repository.tue.nl/655113

M. Li, N. Cao, S. Yu, and W. Lou, FindU: Privacy-preserving personal profile matching in mobile social networks, 2011 Proceedings IEEE INFOCOM, pp.2435-2443, 2011.
DOI : 10.1109/INFCOM.2011.5935065

X. Liang, X. Li, K. Zhang, R. Lu, X. Lin et al., Fully Anonymous Profile Matching in Mobile Social Networks, IEEE Journal on Selected Areas in Communications, vol.31, issue.9, pp.641-655, 2013.
DOI : 10.1109/JSAC.2013.SUP.0513056

E. D. Cristofaro and G. Tsudik, Practical Private Set Intersection Protocols with Linear Complexity, " in Financial Cryptography and Data Security, pp.143-159, 2010.

R. Zhang, Y. Zhang, J. Sun, and G. Yan, Fine-grained private matching for proximity-based mobile social networking, 2012 Proceedings IEEE INFOCOM, pp.1969-1977
DOI : 10.1109/INFCOM.2012.6195574