D. Fiore, R. Gennaro, and V. Pastro, Efficiently Verifiable Computation on Encrypted Data, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.844-855, 2014.
DOI : 10.1145/2660267.2660366
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.455.2271

M. Backes, D. Fiore, and R. M. Reischuk, Verifiable delegation of computation on outsourced data, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.863-874, 2013.
DOI : 10.1145/2508859.2516681

R. Agrawal and R. Srikant, Privacy-preserving data mining, ACM SIGMOD Record, vol.29, issue.2, pp.439-450, 2000.
DOI : 10.1145/335191.335438

E. D. Cristofaro and G. Tsudik, Practical Private Set Intersection Protocols with Linear Complexity, 14th International Conference on Financial Cryptography and Data Security, pp.143-159, 2010.
DOI : 10.1007/978-3-642-14577-3_13

M. J. Freedman, K. Nissim, and B. Pinkas, Efficient Private Matching and Set Intersection, EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, pp.1-19, 2004.
DOI : 10.1007/978-3-540-24676-3_1

L. Kissner and D. X. Song, Privacy-Preserving Set Operations, CRYPTO 2005, 25th International Cryptology Conference, pp.241-257, 2005.
DOI : 10.1007/11535218_15

E. D. Cristofaro, J. Kim, and G. Tsudik, Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model, ASIACRYPT 2010 -16th International Conference on the Theory and Application of Cryptology and Information Security, pp.213-231, 2010.
DOI : 10.1007/978-3-642-17373-8_13

C. Dong, L. Chen, and Z. Wen, When private set intersection meets big data, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.789-800, 2013.
DOI : 10.1145/2508859.2516701

B. Pinkas, T. Schneider, and M. Zohner, Faster private set intersection based on OT extension, 23rd USENIX Security Symposium, 2014.

C. Papamanthou, R. Tamassia, and N. Triandopoulos, Optimal Verification of Operations on Dynamic Sets, CRYPTO 2011, 31st International Cryptology Conference, pp.91-110, 2011.
DOI : 10.1007/978-3-642-22792-9_6

R. Canetti, O. Paneth, D. Papadopoulos, and N. Triandopoulos, Verifiable Set Operations over Outsourced Databases, 17th IACR International Conference on Theory and Practice of Public-Key Cryptography, pp.113-130, 2014.
DOI : 10.1007/978-3-642-54631-0_7

S. Kamara, P. Mohassel, M. Raykova, and S. Sadeghian, Scaling Private Set Intersection to Billion-Element Sets, 18th International Conference on Financial Cryptography and Data Security, pp.863-874, 2014.
DOI : 10.1007/978-3-662-45472-5_13

F. Kerschbaum, Collusion-resistant outsourcing of private set intersection, Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC '12, pp.1451-1456, 2012.
DOI : 10.1145/2245276.2232008

F. Liu, W. K. Ng, W. Zhang, D. H. Giang, and S. Han, Encrypted Set Intersection Protocol for Outsourced Datasets, 2014 IEEE International Conference on Cloud Engineering, pp.135-140, 2014.
DOI : 10.1109/IC2E.2014.18

F. Kerschbaum, Outsourced private set intersection using homomorphic encryption, Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, ASIACCS '12, pp.85-86, 2012.
DOI : 10.1145/2414456.2414506

Q. Zheng and S. Xu, Verifiable Delegated Set Intersection Operations on Outsourced Encrypted Data, 2015 IEEE International Conference on Cloud Engineering, p.178, 2014.
DOI : 10.1109/IC2E.2015.38

O. Goldreich, The Foundations of Cryptography Basic Applications, 2004.

E. Stefanov and E. Shi, Multi-cloud oblivious storage, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.247-258, 2013.
DOI : 10.1145/2508859.2516673

M. Raykova, B. Vo, S. M. Bellovin, and T. Malkin, Secure anonymous database search, Proceedings of the 2009 ACM workshop on Cloud computing security, CCSW '09, pp.115-126, 2009.
DOI : 10.1145/1655008.1655025

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EU- ROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, pp.223-238, 1999.
DOI : 10.1007/3-540-48910-X_16

A. V. Aho and J. E. Hopcroft, The Design and Analysis of Computer Algorithms, 1974.

G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner et al., Provable data possession at untrusted stores, Proceedings of the 14th ACM conference on Computer and communications security , CCS '07, pp.598-609, 2007.
DOI : 10.1145/1315245.1315318

C. Wang, K. Ren, and J. Wang, Secure and practical outsourcing of linear programming in cloud computing, 2011 Proceedings IEEE INFOCOM, pp.820-828, 2011.
DOI : 10.1109/INFCOM.2011.5935305

F. Hahn and F. Kerschbaum, Searchable Encryption with Secure and Efficient Updates, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.310-320, 2014.
DOI : 10.1145/2660267.2660297