A. Kermarrec, Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE, Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS '09), ser. Lecture Notes in Computer Science, p.116, 2009.
DOI : 10.1007/978-3-642-05118-0_1

URL : https://hal.archives-ouvertes.fr/inria-00435170

M. Bertier, D. Frey, R. Guerraoui, J. Kilian, and V. Leroy, Personalized Web Search by Gossiping with Unknown Social Acquaintances, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00368137

A. Kermarrec and M. Van-steen, Gossiping in distributed systems, ACM SIGOPS Operating Systems Review, vol.41, issue.5, pp.2-7, 2007.
DOI : 10.1145/1317379.1317381

M. Jelasity, S. Voulgaris, R. Guerraoui, J. Kilian, and M. Van-steen, Gossip-based peer sampling, ACM Transactions on Computer Systems, vol.25, issue.3, p.8, 2007.
DOI : 10.1145/1275517.1275520

O. Goldreich, Cryptography and cryptographic protocols, Distributed Computing, pp.177-199, 2003.
DOI : 10.1007/s00446-002-0077-1

C. Dwork, Differential Privacy, Proceedings of the 5th international conference on, pp.1-19, 2008.
DOI : 10.1007/11787006_1

J. Imbrie and E. G. Purdy, Classification of Modern Bahamian Carbonate Sediments, " in Classification of carbonate rocks: a symposium, ser, pp.253-272, 1962.

P. Jaccard, ´ Etude Comparative de la Distribution Florale dans une Portion des Alpes et des Jura, Bulletin de la Société Vaudoise des Sciences Naturelles, pp.547-579, 1901.

A. Pfitzmann and M. Waidner, Networks Without User Observability ? Design Options, ser. Lecture Notes in Computer Science, p.245253, 1985.

A. Pfitzmann and M. Köhntopp, Anonymity, Unobservability, and Pseudonymity ? A Proposal for Terminology, ser. Lecture Notes in Computer Science, p.19, 2001.

D. L. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, vol.24, issue.2, pp.84-90, 1981.
DOI : 10.1145/358549.358563

A. Mislove, G. Oberoi, A. Post, C. Reis, P. Druschel et al., AP3, Proceedings of the 11th workshop on ACM SIGOPS European workshop: beyond the PC , EW11, p.30, 2004.
DOI : 10.1145/1133572.1133578

M. K. Reiter and A. D. Rubin, Crowds: anonymity for Web transactions, ACM Transactions on Information and System Security, vol.1, issue.1, pp.66-92, 1998.
DOI : 10.1145/290163.290168

R. Dingledine, N. Mathewson, and P. Syverson, Tor: The Second- Generation Onion Router, Proceedings of the 13th Conference on USENIX Security Symposium -Volume 13, ser. USENIX Security Symposium, p.21, 2004.

O. Goldreich, Foundations of Cryptography, 2001.

A. C. Yao, Protocols for secure computations, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
DOI : 10.1109/SFCS.1982.38

M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.1-10, 1988.
DOI : 10.1145/62212.62213

O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority, Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC '87), ser. Annual ACM Symposium on Theory of Computing, pp.218-229, 1987.

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, ser. Lecture Notes in Computer Science, pp.223-238, 1999.

I. Damgå-rd and M. Jurik, A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System, ser. Lecture Notes in Computer Science, pp.119-136, 1992.

A. Russell and H. Wang, How to Fool an Unbounded Adversary With a Short Key, Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT'02), ser. Lecture Notes In Computer Science, pp.133-148, 2002.

R. Cramer, I. Damgå, and J. B. Nielsen, Multiparty Computation from Threshold Homomorphic Encryption, ser. Lecture Notes in Computer Science, pp.280-300, 2001.

C. Dwork, F. Mcsherry, and K. Talwar, The price of privacy and the limits of LP decoding, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.85-94, 2007.
DOI : 10.1145/1250790.1250804

L. Sweeney, k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.10, issue.05, pp.557-570, 2002.
DOI : 10.1142/S0218488502001648

A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, -diversity, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, p.3, 2007.
DOI : 10.1145/1217299.1217302

N. Li, T. Li, and S. Venkatasubramanian, t-Closeness: Privacy Beyond k- Anonymity and l-Diversity The Marmara Hotel, Proceedings of the 23rd International Conference on Data Engineering (ICDE '07, pp.106-115, 2007.

C. Dwork, F. Mcsherry, K. Nissim, and A. Smith, Calibrating Noise to Sensitivity in Private Data Analysis, ser. Lecture Notes in Computer Science, pp.265-284, 2006.

S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith, What Can We Learn Privately, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS '08)

G. S. Narayanan, T. Aishwarya, A. Agrawal, A. Patra, A. Choudhary et al., Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security, Proceedings of the 8th International Conference on Cryptology and Network Security (CANS'09), ser. Lecture Notes In Computer Science, pp.21-40, 2009.

R. Li and C. Wu, An Unconditionally Secure Protocol for Multi-Party Set Intersection, Proceedings of the 5th international conference on Applied Cryptography and Network Security (ACNS'07), ser, pp.226-236, 2007.
DOI : 10.1007/978-3-540-72738-5_15

L. Kissner and D. Song, Privacy-Preserving Set Operations, ser. Lecture Notes in Computer Science, pp.241-257, 2005.

M. J. Freedman, K. Nissim, and B. Pinkas, Efficient Private Matching and Set Intersection, ser. Lecture Notes in Computer Science, pp.1-19, 2004.

B. Goethals, S. Laur, H. Lipmaa, and T. Mielikäinen, On Private Scalar Product Computation for Privacy-Preserving Data Mining, ser. Lecture Notes in Computer Science, pp.104-120, 2004.

R. Wright and Z. Yang, Privacy-preserving Bayesian network structure computation on distributed heterogeneous data, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.713-718, 2004.
DOI : 10.1145/1014052.1014145

A. Amirbekyan and V. Estivill-castro, A New Efficient Privacy-Preserving Scalar Product Protocol, Proceedings of the 6th Australasian Conference on Data Mining and Analytics ACM International Conference Proceeding Series, pp.209-214, 2007.

C. A. Melchor, B. Ait-salem, and P. Gaborit, A Collusion-Resistant Distributed Scalar Product Protocol with Application to Privacy-Preserving Computation of Trust, 2009 Eighth IEEE International Symposium on Network Computing and Applications, pp.140-147, 2009.
DOI : 10.1109/NCA.2009.48

I. Wang, C. Shen, J. Zhan, T. Hsu, C. Liau et al., Towards Empirical Aspects of Secure Scalar Product, 2008 International Conference on Information Security and Assurance (isa 2008), pp.440-447, 2009.
DOI : 10.1109/ISA.2008.78

A. Inan, M. Kantarcioglu, G. Ghinita, and E. Bertino, Private record matching using differential privacy, Proceedings of the 13th International Conference on Extending Database Technology, EDBT '10, pp.123-134, 2010.
DOI : 10.1145/1739041.1739059

A. C. Yao, How to Generate and Exchange Secrets (extended abstract ), Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS '86, pp.162-167, 1986.

H. Lin and W. Tzeng, An Efficient Solution to the Millionaires' Problem Based on Homomorphic Encryption, ser. Lecture Notes in Computer Science, pp.456-466, 2005.

J. Garay, B. Schoenmakers, and J. Villegas, Practical and Secure Solutions for Integer Comparison, ser. Lecture Notes in Computer Science, pp.330-342, 2007.

T. Nishide and K. Ohta, Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol, Proceedings of the 10th International Conference on Practice and Theory in Public- Key Cryptography (PKC'07), ser. Lecture Notes in Computer Science, pp.343-360, 2007.
DOI : 10.1007/978-3-540-71677-8_23

B. Schoenmakers and P. Tuyls, Efficient Binary Conversion for Paillier Encrypted Values, ser. Lecture Notes in Computer Science, pp.522-537, 2006.

I. Damgå-rd, M. Fitzi, E. Kiltz, J. B. Nielsen, and T. Toft, Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison , Bits and Exponentiation, ser. Lecture Notes in Computer Science, pp.285-304, 2006.

B. Schoenmakers and P. Tuyls, Practical Two-Party Computation Based on the Conditional Gate, ser. Lecture Notes in Computer Science, pp.129-145, 2004.

P. Fouque, J. Stern, and G. Wackers, CryptoComputing with Rationals , ser. Lecture Notes in Computer Science, pp.136-146, 2003.

J. Bar-ilan and D. Beaver, Non-cryptographic fault-tolerant computing in constant number of rounds of interaction, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing , PODC '89, pp.201-209, 1989.
DOI : 10.1145/72981.72995

W. L. Harkness, Properties of the Extended Hypergeometric Distribution, The Annals of Mathematical Statistics, vol.36, issue.3, pp.938-945, 1965.
DOI : 10.1214/aoms/1177700066