. Amblard, Preserving multi-relational outsourced databases confidentiality using fragmentation and encryption International Conferences ? A. Bkakria, F. Cuppens, N. Cuppens-Boulahia, and D. Gross-Amblard. Security mechanisms planning to enforce security policies, Foundations and Practice of Security -7th International Symposium, pp.39-62, 2013.

@. A. Bkakria, F. Cuppens, N. Cuppens-boulahia, and D. Gross-amblard, Specification and Deployment of Integrated Security Policies for Outsourced Data, Data and Applications Security and Privacy XXVIII -28th Annual IFIP WG 11
DOI : 10.1007/978-3-662-43936-4_2
URL : https://hal.archives-ouvertes.fr/hal-01087467

@. A. Bkakria, A. Schaad, F. Kerschbaum, F. Cuppens, N. Cuppens-boulahia et al., Optimized and controlled provisioning of encrypted outsourced data, 19th ACM Symposium on Access Control Models and Technologies, SACMAT '14, pp.141-152, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01207766

@. A. Bkakria, F. Cuppens, N. Cuppens-boulahia, and J. M. Fernandez, Confidentiality-Preserving Query Execution of Fragmented Outsourced Data, Information and Communicatiaon Technology -International Conference, ICT- EurAsia 2013. Proceedings, pp.426-440, 2013.
DOI : 10.1007/978-3-642-36818-9_47
URL : https://hal.archives-ouvertes.fr/hal-01213982

. Aggarwal, Two can keep A secret: A distributed architecture for secure database services, CIDR, pp.186-199, 2005.

. Agrawal, Orderpreserving encryption for numeric data, Proceedings of the ACM SIGMOD International Conference on Management of Data, pp.563-574, 2004.

. Aho, Data Structures and Algorithms, p.44, 1983.

. Amanatidis, Provably-Secure Schemes for Basic Query Support in Outsourced Databases, Data and Applications Security XXI, 21st Annual IFIP WG 11.3 Working Conference on Data and Applications Security Proceedings, volume 4602 of Lecture Notes in Computer Science, pp.14-30, 2007.
DOI : 10.1007/11761679_23

]. O. Amble and D. E. Knuth, Ordered hash tables, The Computer Journal, vol.17, issue.2, pp.135-142, 1974.
DOI : 10.1093/comjnl/17.2.135

. Havelund, Tools and Algorithms for the Construction and Analysis of Systems Held as Part of the European Joint Conferences on Theory and Practice of Software, 20th International Conference, TACAS 2014 Proceedings, pp.31-45, 2014.

A. and L. Compagna, Automatic satcompilation of protocol insecurity problems via reduction to planning, Formal Techniques for Networked and Distributed Systems -FORTE 2002, 22nd IFIP WG 6.1 International Conference Proceedings, volume 2529 of Lecture Notes in Computer Science, pp.210-225, 2002.

A. Armando, L. Compagna, and P. Ganty, SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis, FME 2003: Formal Methods, International Symposium of Formal Methods Europe Proceedings, volume 2805 of Lecture Notes in Computer Science, pp.875-893, 2003.
DOI : 10.1007/978-3-540-45236-2_47

. Bartoletti, Planning and verifying service composition, Journal of Computer Security, vol.17, issue.5, pp.799-837, 2009.
DOI : 10.3233/JCS-2009-0357

. Bellare, Deterministic and Efficiently Searchable Encryption, 27th Annual International Cryptology Conference Proceedings, pp.535-552, 2007.
DOI : 10.1007/978-3-540-74143-5_30

. Bellare, A concrete security treatment of symmetric encryption, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.394-403, 1997.
DOI : 10.1109/SFCS.1997.646128

A. O. Fischlin, T. Neill, and . Ristenpart, Deterministic encryption: Definitional equivalences and constructions without random oracles, Advances in Cryptology -CRYPTO 2008, 28th Annual International Cryptology Conference Proceedings, volume 5157 of Lecture Notes in Computer Science, pp.360-378, 2008.

]. A. Bertossi, The edge Hamiltonian path problem is NP-complete, Information Processing Letters, vol.13, issue.4-5, pp.157-159, 1981.
DOI : 10.1016/0020-0190(81)90048-X

]. S. Bhattacharya and A. Cortesi, A distortion free watermark framework for relational databases, ICSOFT 2009 -Proceedings of the 4th International Conference on Software and Data Technologies, pp.229-234, 2009.

]. T. Bingmann, Stx b+ tree c++ template classes v 0.8.3, p.50, 2007.

. Biskup, On the inferenceproofness of database fragmentation satisfying confidentiality constraints, Information Security, 14th International Conference Proceedings, volume 7001 of Lecture Notes in Computer Science, pp.246-261, 2011.

. Bkakria, Confidentiality-Preserving Query Execution of Fragmented Outsourced Data, Information and Communicatiaon Technology -International Conference , ICT-EurAsia 2013 Proceedings, pp.426-440, 2013.
DOI : 10.1007/978-3-642-36818-9_47
URL : https://hal.archives-ouvertes.fr/hal-01213982

D. Fernandez and . Gross-amblard, Preserving multi-relational outsourced databases confidentiality using fragmentation and encryption, JoWUA, vol.4, issue.147, pp.39-62, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01213956

. Gross-amblard, Specification and deployment of integrated security policies for outsourced data, Data and Applications Security and Privacy XXVIII -28th Annual IFIP WG 11.3 Working Conference Proceedings, pp.17-32, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01087467

. Bkakria, Optimized and controlled provisioning of encrypted outsourced data Space/time trade-offs in hash coding with allowable errors, 19th ACM Symposium on Access 184 BIBLIOGRAPHY Control Models and Technologies, SACMAT '14, pp.141-152, 1970.

F. Blum, ]. A. Blum, and M. L. Furst, Fast planning through planning graph analysis, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence Volumes, pp.1636-1642, 1995.
DOI : 10.1016/S0004-3702(96)00047-1

]. A. Blum and M. L. Furst, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.1-2, pp.281-300, 1997.
DOI : 10.1016/S0004-3702(96)00047-1

. Boho, End-To-End Security for Video Distribution: The Combination of Encryption, Watermarking, and Video Adaptation, IEEE Signal Processing Magazine, vol.30, issue.2, pp.97-107, 2013.
DOI : 10.1109/MSP.2012.2230220

A. Boldyreva, N. Chenette, Y. Lee, and A. O. Neill, Order-Preserving Symmetric Encryption, Advances in Cryptology -EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Proceedings, pp.224-241, 2009.
DOI : 10.1109/TMC.2006.144

. Boldyreva, Orderpreserving encryption revisited: Improved security analysis and alternative solutions, pp.578-595, 2011.

. Boldyreva, Orderpreserving encryption revisited: Improved security analysis and alternative solutions, IACR Cryptology ePrint Archive, vol.13, pp.625-642, 2012.

]. D. Boneh, The Decision Diffie-Hellman problem, Algorithmic Number Theory, Third International Symposium Proceedings, volume 1423 of Lecture Notes in Computer Science, pp.48-63, 1998.
DOI : 10.1007/BFb0054851

. Boneh, Evaluating 2-DNF Formulas on Ciphertexts, Theory of Cryptography Conference, TCC 2005 Theory of Cryptography, 4th Theory of Cryptography Conference Proceedings, pp.325-341, 2005.
DOI : 10.1007/978-3-540-30576-7_18

. Botelho, Simple and spaceefficient minimal perfect hash functions, Algorithms and Data Structures, 10th International Workshop, WADS 2007 Proceedings, volume 4619 of Lecture Notes in Computer Science, pp.139-150, 2007.

]. F. Botelho and N. Zivian, Cmph : C minimal perfect hashing library, p.50, 2007.

F. C. Botelho and N. Ziviani, External perfect hashing for very large key sets, Proceedings of the sixteenth ACM conference on Conference on information and knowledge management , CIKM '07, pp.653-662, 2007.
DOI : 10.1145/1321440.1321532

. Brakerski, (leveled) fully homomorphic encryption without bootstrapping, Innovations in Theoretical Computer Science 2012, pp.309-325, 2012.

. Brakerski, . Vaikuntanathan-2011a-]-z, V. Brakerski, and . Vaikuntanathan, Efficient Fully Homomorphic Encryption from (Standard) LWE, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, p.109, 2011.
DOI : 10.1109/FOCS.2011.12

. Brakerski, . Vaikuntanathan-2011b-]-z, V. Brakerski, and . Vaikuntanathan, Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages, pp.505-524, 2011.
DOI : 10.1007/978-3-642-22792-9_29

. Cancellaro, A commutative digital image watermarking and encryption method in the tree structured Haar transform domain, Proc.: Image Comm, pp.1-12, 2011.
DOI : 10.1016/j.image.2010.11.001

. Cox, An asymmetric fingerprinting scheme based on tardos codes, Information Hiding -13th International Conference, pp.43-58, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00581156

S. Kamara, Structured encryption and controlled disclosure, IACR Cryptology ePrint Archive, vol.13, pp.10-19, 2011.

M. Park, J. Eom, and T. Chung, Dynamic binary analyzer for scanning vulnerabilities with taint analysis, Multimedia Tools Appl, vol.74, issue.7, pp.2301-2320, 2015.

. Chor, Private information retrieval by keywords, IACR Cryptology ePrint Archive, vol.29, issue.3, p.43, 1998.

. Ciriani, Fragmentation and Encryption to Enforce Privacy in Data Storage, Computer Security -ESORICS 2007, 12th European Symposium On Research In Computer Security Proceedings, pp.171-186, 2007.
DOI : 10.1007/978-3-540-74835-9_12

. Ciriani, Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases, 2009 29th IEEE International Conference on Distributed Computing Systems, pp.22-26, 2009.
DOI : 10.1109/ICDCS.2009.52

. Ciriani, An OBDD approach to enforce confidentiality and visibility constraints in data publishing*, Journal of Computer Security, vol.20, issue.5, pp.463-508, 2012.
DOI : 10.3233/JCS-2012-0449

]. P. Cohn, Introduction to Ring Theory, p.20, 2000.
DOI : 10.1007/978-1-4471-0475-9

. Curtmola, Searchable symmetric encryption, Proceedings of the 13th ACM conference on Computer and communications security , CCS '06, pp.79-88, 2006.
DOI : 10.1145/1180405.1180417

]. W. Daidamiani, The crypto++ library Implementation of a storage mechanism for untrusted dbmss Information Assurance, The Storage Security Perspective, 2nd International IEEE Security in Storage Workshop, pp.50-88, 1995.

. Damiani, Balancing confidentiality and efficiency in untrusted relational DBMSs, Proceedings of the 10th ACM conference on Computer and communication security , CCS '03, pp.93-102, 2003.
DOI : 10.1145/948109.948124

M. Davis, ]. C. Davis, and V. R. Mckim, Temporal modalities and the future, Notre Dame Journal of Formal Logic, vol.17, issue.2, pp.233-238, 1976.

P. Paraboschi and . Samarati, Fragments and loose associations: Respecting privacy in data publishing, PVLDB, vol.3, issue.1, pp.1370-1381, 2010.

]. C. Dixon and M. Fisher, Resolution-based proof for multimodal temporal logics of knowledge, Seventh International Workshop on Temporal Representation and Reasoning, pp.69-78, 2000.

]. T. Elgamal-1985 and . Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, vol.31, issue.4, pp.469-472, 1985.
DOI : 10.1109/TIT.1985.1057074

A. Mcdaniel and . Sheth, Taintdroid: An information-flow tracking system for realtime privacy monitoring on smartphones, 9th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2010, pp.393-407, 2010.

. Fagin, Reasoning about Knowledge, p.86, 1995.

]. R. Fikes and N. J. Nilsson, Strips: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, vol.2, issue.3-4, pp.189-208, 1971.
DOI : 10.1016/0004-3702(71)90010-5

. Fips, Announcing the advanced encryption standard (aes), p.12, 2001.

. Frazzoli, Real-Time Motion Planning for Agile Autonomous Vehicles, Journal of Guidance, Control, and Dynamics, vol.25, issue.1, pp.116-129, 2000.
DOI : 10.2514/2.4856

. Fredman, Storing a sparse table with 0(1) worst case access time, J. ACM, issue.3, pp.31538-544, 1984.

. Gabbay, On the temporal analysis of fairness, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '80, pp.163-173, 1980.
DOI : 10.1145/567446.567462

J. Garey, D. S. Garey, and . Johnson, Computers and Intractability ; A Guide to the Theory of NP-Completeness, p.178, 1990.

]. C. Gentry, A fully homomorphic encryption scheme, p.21, 2009.

C. Gentry, S. Halevi, N. P. Smart, ]. C. Gentry, A. Sahai et al., Homomorphic Evaluation of the AES Circuit, Advances in Cryptology -CRYPTO 2012 -32nd Annual Cryptology Conference Proceedings Advances in Cryptology -CRYPTO 2013 -33rd Annual Cryptology Conference Proceedings, Part I, pp.850-867, 2012.
DOI : 10.1007/978-3-642-32009-5_49

. Wilkins, Pddl -the planning domain definition language. version 1.2, pp.2015-2023

]. E. Goh-2003a and . Goh, Secure indexes, IACR Cryptology ePrint Archive, vol.13, pp.216-234, 2003.

]. Goh, Secure indexes. Cryptology ePrint Archive, Report, vol.216, 2003.

]. I. Goldberg, Improving the Robustness of Private Information Retrieval, 2007 IEEE Symposium on Security and Privacy (SP '07), pp.131-148, 2007.
DOI : 10.1109/SP.2007.23

]. I. Goldberg, Percy++ / pir in c++, p.50, 2007.

]. O. Goldreich, Foundations of Cryptography, 1921.

M. Goldwasser, ]. S. Goldwasser, and S. Micali, Probabilistic encryption & how to play mental poker keeping secret all partial information, Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC '82, pp.365-377, 1982.

P. Golle, J. Staddon, and B. R. Waters, Secure Conjunctive Keyword Search over Encrypted Data, Applied Cryptography and Network Security, Second International Conference, ACNS 2004 Proceedings, pp.31-45, 2004.
DOI : 10.1007/978-3-540-24852-1_3

. Google, Google app engine. https://appengine.google.com/. Accessed, pp.2015-2022

. Googledrive and . Googledrive, Google drive. https://drive.google.com/. Accessed, pp.2015-2021

A. Kohler, A. Schaad, W. Schröpfer, and . Tighzert, Experiences and observations on the industrial implementation of a system to search over outsourced encrypted data, Sicherheit 2014: Sicherheit, Schutz und Zuverlässigkeit, Beiträge der 7. Jahrestagung des Fachbereichs Sicherheit der Gesellschaft für Informatik e.V. (GI), pp.19-21, 2014.

. Guo, Fingerprinting relational databases, Proceedings of the 2006 ACM symposium on Applied computing , SAC '06, pp.487-492, 2006.
DOI : 10.1145/1141277.1141391

]. A. Guttman, R-trees: A dynamic index structure for spatial searching, SIGMOD'84, Proceedings of Annual Meeting, pp.47-57, 1984.

. Hacigümüs, Executing SQL over encrypted data in the database-service-provider model, Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp.216-227, 2002.

V. Halpern, M. Y. Halpern, and . Vardi, The complexity of reasoning about knowledge and time. I. Lower bounds, Journal of Computer and System Sciences, vol.38, issue.1, pp.195-237, 1989.
DOI : 10.1016/0022-0000(89)90039-1

]. J. Hintikka, Reasoning about knowledge in philosophy: The paradigm of epistemic logic, Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, pp.63-80, 1986.

. Hore, A Privacy-Preserving Index for Range Queries, (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, pp.720-731, 2004.
DOI : 10.1016/B978-012088469-8.50064-4

. Kuo, Verifying web applications using bounded model checking, 2004 International Conference on Dependable Systems and Networks, pp.199-208, 2004.

. Weippl, Data confidentiality using fragmentation in cloud computing, Int. J. Pervasive Computing and Communications, vol.9, issue.22, pp.2013-2036

. Irwin, Avoiding information leakage in security-policy-aware planning, Proceedings of the 7th ACM workshop on Privacy in the electronic society, WPES '08, pp.85-94, 2008.
DOI : 10.1145/1456403.1456418

M. Islam, M. Kuzu, and . Kantarcioglu, Access pattern disclosure on searchable encryption: Ramification, attack and mitigation, 19th Annual Network and Distributed System Security Symposium, NDSS 2012, p.58, 2012.

]. D. Gantz-2012 and . Gantz, The digital universe in 2020: Big data, bigger digital shadows, and biggest growth in the far east, IDC iView, issue.1, pp.1-16, 2012.

. Jovanovic, Static analysis for detecting taint-style vulnerabilities in web applications, Journal of Computer Security, vol.18, issue.5, pp.861-907, 2010.
DOI : 10.3233/JCS-2009-0385

P. Kamara, ]. S. Kamara, and C. Papamanthou, Parallel and Dynamic Searchable Symmetric Encryption, Financial Cryptography and Data Security -17th International Conference, pp.258-274, 2013.
DOI : 10.1007/978-3-642-39884-1_22

. Kamara, Dynamic searchable symmetric encryption, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, pp.965-976, 2012.
DOI : 10.1145/2382196.2382298

. Kautz, . A. Selman-1996-]-h, B. Kautz, and . Selman, Pushing the envelope: Planning, propositional logic and stochastic search, Proceedings of the Thirteenth BIBLIOGRAPHY National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI 96, IAAI 96, pp.1194-1201, 1996.

. Kautz, . A. Selman-1999-]-h, B. Kautz, and . Selman, Unifying sat-based and graph-based planning, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, pp.318-325, 1450.

. Kautz, SatPlan: Planning as satisfiability, Abstracts of the 5th International Planning Competition, p.129, 2006.

. Kerschbaum, DEMO: Adjustably encrypted in-memory column-store, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.1325-1328, 2013.
DOI : 10.1145/2508859.2512491

A. Kohler, A. Schaad, W. Schröpfer, and . Tighzert, Optimal re-encryption strategy for joins in encrypted databases, Data and Applications Security and Privacy XXVII -27th Annual IFIP WG 11.3 Conference Proceedings, volume 7964 of Lecture Notes in Computer Science, pp.195-210, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01490705

A. Hang, A. Schaad, W. Schröpfer, and . Tighzert, An encrypted in-memory column-store: The onion selection problem, Information Systems Security -9th International Conference, ICISS 2013, pp.14-26, 2013.

. Kindel, Kinodynamic motion planning amidst moving obstacles, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), pp.537-543, 2000.
DOI : 10.1109/ROBOT.2000.844109

. Kolesnikov, . Shikfa-2012-]-v, A. Kolesnikov, and . Shikfa, On The Limits of Privacy Provided by Order-Preserving Encryption, Bell Labs Technical Journal, vol.17, issue.3, pp.135-146, 2012.
DOI : 10.1002/bltj.21564

P. K. Mukkamala and . Baruah, Efficient privacy-preserving data distribution in outsourced environments: a fragmentation-based approach, 2012 International Conference on Advances in Computing, Communications and Informatics, ICACCI '12, pp.589-595, 2012.

L. Lewis, ]. C. Lewis, and C. H. Langford, Symbolic logic Century Co New York] D. Lewis. icloud data breach: Hacking and celebrity photos icloud-data-breach-hacking-and-nude-celebrity-photos, pp.83-2015, 1932.

. Li, t-closeness: Privacy beyond k-anonymity and l-diversity The Marmara Hotel, Proceedings of the 23rd International Conference on Data Engineering, pp.106-115, 2007.

. Machanavajjhala, -diversity, Proceedings of the 22nd International Conference on Data Engineering, pp.3-8, 2006.
DOI : 10.1145/1217299.1217302

]. J. Maddock, Regular expressions in c++, p.49, 2001.

G. Mell, ]. P. Mell, and T. Grance, The nist definition of cloud computing . National Institute of Standards and Technology, 2011.

. Microsoft and . Microsoft, Microsoft share point. https://products.office.com/ fr-fr/sharepoint/collaboration, pp.2015-2022

. Moataz, . Shikfa-2013-]-t, A. Moataz, and . Shikfa, Boolean symmetric searchable encryption, Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, ASIA CCS '13, pp.265-276, 2013.
DOI : 10.1145/2484313.2484347
URL : https://hal.archives-ouvertes.fr/hal-00952541

. Mulazzani, Dark clouds on the horizon: Using cloud storage as attack vector and online slack space, 20th USENIX Security Symposium Proceedings, 2011.

M. Mykletun, G. Narasimha, and . Tsudik, Authentication and integrity in outsourced databases, Proceedings of the Network and Distributed System Security Symposium, NDSS 2004, p.81, 2004.
DOI : 10.1145/1149976.1149977

G. Tsudik, DSAC: an approach to ensure integrity of outsourced databases using signature aggregation and chaining, IACR Cryptology ePrint Archive, pp.297-81, 2005.

. Navathe, Vertical partitioning algorithms for database design, ACM Transactions on Database Systems, vol.9, issue.4, pp.680-710, 1984.
DOI : 10.1145/1994.2209

]. D. Newton, Dropbox authentication: insecure by design, pp.2015-2021, 2011.

]. N. Nist, Data encryption standard (des), Technology, vol.46, issue.3, pp.1-26, 1999.

. Nsa, Nsa spying poisons the cloud market: survey. http://www.zdnet. com/nsa-spying-poisons-the-cloud-market-survey-7000022964, pp.2015-2022, 2013.

. Nsa, Nsa surveillance: First prism, now muscled out of cloud. http://www.darkreading.com/cloud-security/ nsa-surveillance-first-prismnow-muscled-out-of-cloud, p.50

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

]. J. Park, Efficient Hidden Vector Encryption for Conjunctive Queries on Encrypted Data, PCIDSS ] PCIDSS. Pci security standards council, pp.1483-1497, 2011.
DOI : 10.1109/TKDE.2010.206

S. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.1, pp.106-110, 1978.
DOI : 10.1109/TIT.1978.1055817

. Popa, CryptDB, Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP '11, 2011.
DOI : 10.1145/2043556.2043566

]. V. Pournaghshband, A new watermarking approach for relational data, Proceedings of the 46th Annual Southeast Regional Conference on XX, ACM-SE 46, pp.127-131, 2008.
DOI : 10.1145/1593105.1593138

. Pretschner, Mechanisms for usage control, Proceedings of the 2008 ACM symposium on Information, computer and communications security , ASIACCS '08, pp.240-244, 2008.
DOI : 10.1145/1368310.1368344

. Rackspace and . Rackspace, Rackspace?Äôs cloud services, pp.2015-2022

. Rivest, On data banks and privacy homomorphisms. Foundations of Secure Computation, pp.169-179, 1978.

. Robinson, Co-plan: Combining sat-based planning with forward-search, Proc. IPC-6, p.129, 2008.

]. J. Rosser, Highlights of the History of the Lambda-Calculus, IEEE Annals of the History of Computing, vol.6, issue.4, pp.337-349, 1984.
DOI : 10.1109/MAHC.1984.10040

S. Seeed, https://www.sics.se/sites/default/files/pub/ andreasschaad.pdf. Accessed, pp.2015-2021

. Perrig, Multi-dimensional range query over encrypted data, pp.350-364, 2007.

]. R. Sion, Database Watermarking for Copyright Protection, Handbook of Database Security -Applications and Trends, pp.297-328, 2008.
DOI : 10.1007/978-0-387-48533-1_13

. Song, Practical techniques for searches on encrypted data, IEEE Symposium on Security and Privacy, pp.44-55, 2000.

]. D. Stehlé and R. Steinfeld, Faster Fully Homomorphic Encryption, Advances in Cryptology -ASIACRYPT 2010 -16th International Conference on the Theory and Application of Cryptology and Information Security Proceedings, pp.377-394, 2010.
DOI : 10.1007/978-3-642-17373-8_22

]. 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

. Tseng, Statistics on Encrypted Cloud Data, Advances in Information and Computer Security -8th International Workshop on Security, IWSEC 2013 Proceedings, pp.133-150, 2013.
DOI : 10.1007/978-3-642-41383-4_9

]. V. Vaikuntanathan, M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, Computing blindfolded: New developments in fully homomorphic encryption Fully homomorphic encryption over the integers, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011 Advances in Cryptology -EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, volume 6110 of Lecture Notes in Computer Science, pp.5-16, 2010.

. Wang, Maple, Proceedings of the 9th ACM symposium on Information, computer and communications security, ASIA CCS '14, pp.111-122, 2014.
DOI : 10.1145/2590296.2590305
URL : https://hal.archives-ouvertes.fr/inria-00099637

S. Wang, ]. C. Wang, and S. W. Shieh, DROIT: dynamic alternation of dual-level tainting for malware analysis, J. Inf. Sci. Eng, vol.31, issue.1, pp.111-129, 2015.

I. Yen, Security analysis for order preserving encryption schemes, 46th Annual Conference on Information Sciences and Systems, CISS 2012, pp.1-6, 2012.

A. Xie, A. Xie, and . Aiken, Static detection of security vulnerabilities in scripting languages, Proceedings of the 15th USENIX Security Symposium, p.135, 2006.

R. Yoo, S. Fitch, and . Sukkarieh, Provably-correct stochastic motion planning with safety constraints, 2013 IEEE International Conference on Robotics and Automation, pp.981-986, 2013.
DOI : 10.1109/ICRA.2013.6630692

. Zhang, Relational databases watermark technique based on content characteristic 97, 100 List of Figures 2.1 (a) Patient relation, (b) partition function used for attribute Dob, and (c) the encrypted relation P atient s stored in the cloud server, First International Conference on Innovative Computing, Information and Control, pp.677-680, 2006.