A. Wahab, O. Hachami, M. O. Zaffari, A. Vivas, M. Dagher et al., Darm: A privacy-preserving approach for distributed association rules mining on horizontally-partitioned data, p.IDEAS, 2014.

A. Amirbekyan and V. Estivill-castro, A new efficient privacy-preserving scalar product protocol, p.AusDM, 2007.

M. J. Atallah and W. Du, Secure Multi-party Computational Geometry, Intl Workshop on Algorithms and Data Structures, 2001.
DOI : 10.1007/3-540-44634-6_16

URL : http://www.cis.syr.edu/~wedu/Research/paper/wads2001.ps

A. Ben-david, N. Nisan, and B. Pinkas, FairplayMP, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, p.CCS, 2008.
DOI : 10.1145/1455770.1455804

M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation, p.STOC, 1988.
DOI : 10.1145/62212.62213

M. Blanton and E. Aguiar, Private and oblivious set and multiset operations, p.ASIACCS, 2012.
DOI : 10.1145/2414456.2414479

D. Bogdanov, S. Laur, and J. Willemson, Sharemind: A Framework for Fast Privacy-Preserving Computations, p.ESORICS, 2008.
DOI : 10.1007/s001459910003

URL : http://www.math.ut.ee/%7Eswen/publications/articles/bogdanov-laur-willemson-2008.pdf

S. Borzsony, D. Kossmann, and K. Stocker, The Skyline operator, Proceedings 17th International Conference on Data Engineering, p.ICDE, 2001.
DOI : 10.1109/ICDE.2001.914855

M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos, Sepia: Privacy-preserving aggregation of multi-domain network events and statistics, 2010.

C. Cachin, Efficient private bidding and auctions with an oblivious third party, Proceedings of the 6th ACM conference on Computer and communications security , CCS '99, p.CCS, 1999.
DOI : 10.1145/319709.319726

URL : http://www.zurich.ibm.com/~cca/papers/bid.ps.gz

D. Chaum, C. Crépeau, and I. Damgard, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, p.STOC, 1988.
DOI : 10.1145/62212.62214

URL : http://crypto.cs.mcgill.ca/~crepeau/PDF/ASPUBLISHED/CCD88A.pdf

W. Du and M. J. Atallah, Protocols for Secure Remote Database Access with Approximate Matching, 2001.
DOI : 10.1007/978-1-4615-1467-1_6

R. Fagin, M. Naor, and P. Winkler, Comparing information without leaking it, Communications of the ACM, vol.39, issue.5, 1996.
DOI : 10.1145/229459.229469

URL : http://www.wisdom.weizmann.ac.il/~naor/PAPERS/comp.ps

O. Goldreich, S. Micali, and A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, p.STOC, 1987.
DOI : 10.1145/28395.28420

D. S. Gordon, H. Carmit, J. Katz, and Y. Lindell, Complete fairness in secure twoparty computation, p.STOC, 2008.
DOI : 10.1145/1374376.1374436

D. Harnik, M. Naor, O. Reingold, and A. Rosen, Completeness in two-party secure computation, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, p.STOC, 2004.
DOI : 10.1145/1007352.1007395

A. Holzer, M. Franz, S. Katzenbeisser, and H. Veith, Secure two-party computations in ANSI C, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, p.CCS, 2012.
DOI : 10.1145/2382196.2382278

Y. Huang, D. Evans, J. Katz, and L. Malka, Faster secure two-party computation using garbled circuits, USENIX Security Symposium, 2011.

M. H. Ibrahim, Two-Party Private Vector Dominance: The All-Or-Nothing Deal, Third International Conference on Information Technology: New Generations (ITNG'06), pp.166-171, 2006.
DOI : 10.1109/ITNG.2006.136

URL : http://www.angelfire.com/al4/maged/Publications/PVD.pdf

J. Yuan, Q. Ye, H. W. Pieprzyk, and J. , Secure Computation of the Vector Dominance Problem, p.ISPEC, 2008.
DOI : 10.1007/978-3-540-79104-1_23

S. Laur, R. Talviste, and J. Willemson, From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting, p.ACNS, 2013.
DOI : 10.1007/978-3-642-38980-1_6

C. Liu, X. S. Wang, K. Nayak, Y. Huang, and E. Shi, ObliVM: A Programming Framework for Secure Computation, 2015 IEEE Symposium on Security and Privacy, 2015.
DOI : 10.1109/SP.2015.29

URL : http://ieeexplore.ieee.org:80/stamp/stamp.jsp?tp=&arnumber=7163036

M. J. Freedman, K. N. Pinkas, and B. , Efficient Private Matching and Set Intersection, p.EUROCRYPT, 2004.
DOI : 10.1007/978-3-540-24676-3_1

M. Bellare, S. K. Viet-tung-hoang, and P. Rogaway, Efficient garbling from a fixedkey blockcipher, IEEE Symposium on Security and Privacy, 2013.
DOI : 10.1109/sp.2013.39

URL : http://doi.org/10.1109/sp.2013.39

A. Miyaji and M. S. Rahman, Privacy-Preserving Data Mining: A Game-Theoretic Approach, p.DBSec, 2011.
DOI : 10.1007/978-3-642-22348-8_15

URL : https://hal.archives-ouvertes.fr/hal-01586580

M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, p.STOC, 1999.
DOI : 10.1145/301250.301312

M. Naor and B. Pinkas, Efficient oblivious transfer protocols, p.SODA, 2001.

J. Vaidya and C. Clifton, Privacy-Preserving Top-k Queries, 21st International Conference on Data Engineering (ICDE'05), p.ICDE, 2005.
DOI : 10.1109/ICDE.2005.112

URL : http://csdl.computer.org/comp/proceedings/icde/2005/2285/00/22850545.pdf

J. Vaidya, M. Kantarcioglu, and C. Clifton, Privacy-preserving Na??ve Bayes classification, The VLDB Journal, vol.28, issue.6, 2008.
DOI : 10.1007/s00778-006-0041-y

A. C. Yao, Protocols for secure computations (extended abstract), p.FOCS, 1982.
DOI : 10.1109/sfcs.1982.38