B. Seer, Bloom index search of encrypted results. http://www.cs. columbia

E. Balas, An Additive Algorithm for Solving Linear Programs with Zero-One Variables, Operations Research, vol.13, issue.4, pp.517-546, 1965.
DOI : 10.1287/opre.13.4.517

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

M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation (extended abstract), STOC '88, pp.1-10, 1988.

D. Bogdanov, Sharemind: programmable secure computations with practical applications, 2013.

D. Bogdanov, R. Jagomägis, and S. Laur, A Universal Toolkit for Cryptographically Secure Privacy-Preserving Data Mining, PAISI '12, pp.112-126, 2012.
DOI : 10.1007/978-3-642-30428-6_9

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

D. Bogdanov, M. Niitsoo, T. Toft, and J. Willemson, High-performance secure multi-party computation for data mining applications, International Journal of Information Security, vol.70, issue.1, pp.403-418, 2012.
DOI : 10.1007/s10207-012-0177-2

J. Bohli, W. Li, and J. Seedorf, Assisting Server for Secure Multi-Party Computation, WISTP '12, pp.144-159, 2012.
DOI : 10.1007/978-3-642-30955-7_13

M. Burkhart, M. Strasser, D. Many, and X. A. Dimitropoulos, SEPIA: Privacypreserving aggregation of multi-domain network events and statistics, USENIX '10, pp.223-240, 2010.

N. Chandran, V. Goyal, R. Ostrovsky, and A. Sahai, Covert Multi-Party Computation, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), pp.238-248, 2007.
DOI : 10.1109/FOCS.2007.61

S. G. Choi, K. Hwang, J. Katz, T. Malkin, and D. Rubenstein, Secure multiparty computation of boolean circuits with applications to privacy in on-line marketplaces, CT-RSA, pp.416-432, 2012.

W. Elmenreich, T. Ibounig, and I. Fehérvári, Robustness versus performance in sorting and tournament algorithms, Acta Polytechnica Hungarica, vol.6, issue.5, pp.7-18, 2009.

C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.169-178, 2009.
DOI : 10.1145/1536414.1536440
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.7592

C. Gentry and S. Halevi, Implementing Gentry???s Fully-Homomorphic Encryption Scheme, EUROCRYPT '11, pp.129-148, 2011.
DOI : 10.1007/978-3-642-20465-4_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.6183

C. Gentry, S. Halevi, and N. P. Smart, Homomorphic Evaluation of the AES Circuit, CRYPTO '12, pp.850-867, 2012.
DOI : 10.1007/978-3-642-32009-5_49

O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, STOC '87, pp.218-229, 1987.

V. Goyal and A. Jain, On the round complexity of covert computation, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.191-200, 2010.
DOI : 10.1145/1806689.1806717

V. Goyal, P. Mohassel, and A. Smith, Efficient Two Party and Multi Party Computation Against Covert Adversaries, EUROCRYPT '06, pp.289-306, 2008.
DOI : 10.1007/978-3-540-78967-3_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.5841

W. Henecka, S. Kögl, A. Sadeghi, T. Schneider, and I. Wehrenberg, TASTY, Proceedings of the 17th ACM conference on Computer and communications security, CCS '10, pp.451-462, 2010.
DOI : 10.1145/1866307.1866358

M. Hirt, C. Lucas, U. Maurer, and D. Raub, Graceful Degradation in Multi-Party Computation (Extended Abstract), ICITS '11, pp.163-180, 2011.
DOI : 10.1007/978-3-642-20728-0_15

M. Hirt, C. Lucas, U. Maurer, and D. Raub, Passive corruption in statistical multiparty computation -(extended abstract), ICITS '12, pp.129-146, 2012.
DOI : 10.1007/978-3-642-32284-6_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.9885

L. Kamm, D. Bogdanov, S. Laur, and J. Vilo, A new way to protect privacy in large-scale genome-wide association studies, Bioinformatics, vol.29, issue.7, pp.29886-893, 2013.
DOI : 10.1093/bioinformatics/btt066

S. Laur, J. Willemson, and B. Zhang, Round-Efficient Oblivious Database Manipulation, ISC '11, pp.262-277, 2011.
DOI : 10.1145/359168.359176
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.8559

Y. Lindell and B. Pinkas, Privacy Preserving Data Mining, Journal of Cryptology, vol.15, issue.3, pp.177-206, 2002.
DOI : 10.1007/s00145-001-0019-2

L. Malka, VMCrypt, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, pp.715-724, 2011.
DOI : 10.1145/2046707.2046787

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT '99, pp.223-238, 1999.
DOI : 10.1007/3-540-48910-X_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.4035

B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams, Secure Two-Party Computation Is Practical, ASIACRYPT '09, pp.250-267, 2009.
DOI : 10.1007/978-3-642-10366-7_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.2341

J. Sakuma and S. Kobayashi, A genetic algorithm for privacy preserving combinatorial optimization, Proceedings of the 9th annual conference on Genetic and evolutionary computation , GECCO '07, pp.1372-1379, 2007.
DOI : 10.1145/1276958.1277214

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

T. Takahashi, K. Emura, A. Kanaoka, S. Matsuo, and T. Minowa, Risk visualization and alerting system, Proceedings of the first international workshop on Security in embedded systems and smartphones, SESP '13, pp.3-10, 2013.
DOI : 10.1145/2484417.2484421

T. Teruya and J. Sakuma, Round-Efficient Private Stable Matching from Additive Homomorphic Encryption, ISC '13, 2014.
DOI : 10.1007/978-3-319-27659-5_5

A. C. Yao, Protocols for secure computations (extended abstract), FOCS '82, pp.160-164, 1982.
DOI : 10.1109/sfcs.1982.38

Q. Ye, H. Wang, J. Pieprzyk, and X. Zhang, Efficient Disjointness Tests for Private Datasets, ACISP '08, pp.155-169, 2008.
DOI : 10.1007/978-3-540-70500-0_12