The principle of cloud computing is to allow users to outsource computation resources to the cloud by allowing a remote service to execute, in their name, some procedures on their private data. While many commercial services are growing fast, to this day, all require the client to place total trust in the service regarding the confidentiality of their data. The aim of CRYPTOCOMP is to develop an efficient cloud-based crypto-calculus platform which, using the latest advances in Fully Homomorphic Encryption, would make it impossible for the cloud service to learn anything whatsoever about the user's data, while still executing the procedures as intended.
Who can I contact?
Meet the Holy Grail of cryptography.
Fully homomorphic encryption is the ultimate cryptographic tool to build more secure cloud computing services that respect everybody's privacy. It allows to confidentialy share data, and the encrypted data can then be processed without ever needing to decrypt or reveal it.
Our CEO is the main editor of the upcoming standard ISO/IEC 18033-6 on partially homomorphic encryption.
Homomorphic encryption is the future, and we can help you get there!
You are not prepared.
One day, quantum computers will become a reality. When that day comes, RSA, Elliptic Curves and many other fundamental cryptographic primitives will become obsolete. Post-Quantum Cryptography offers secure alternatives and we can help you get ready.
Related research project
Using Fully Homomorphic Encryption in Practice.
The HEAT project will develop advanced cryptographic technologies using Fully Homomorphic Encryption to process sensitive information in ecrypted form, without needing to compromise on the privacy and security of the citizens and organizations that provide the input data.
State of the art
The current trend for data outsourcing, with the commercial success of services like DropBox or Google Drive (or more generally all the social networks) is easily understandable: letting someone else host your data frees you from many technical issues, and this for a nominal price. However, with this trend come many new security challenges:
- How does one guarantee the confidentiality of the data with respect to other users?
- And confidentiality with respect to the service provider?
- What about data integrity or user privacy?
These problems existed before outsourcing became popular, but this particular context intensifies them even more.
The simplest solution to ensure the confidentiality of outsourced data is to encrypt it. This is very easy to implement as long as outsourced data is a simple backup with no real purpose beyond protecting against data-loss. But the strength of data outsourcing comes from the additional services offered by the service providers: indexing, sharing, collaborative work… This requires the service to perform computation on your outsourced data, which is impossible if it is encrypted, unless Fully Homomorphic Encryption is used!
Fully Homomorphic Encryption allows to perform arbitrary computations on encrypted data, in a sense solving the problem of secure cloud computing. Unfortunately, existing Fully Homomorphic Encryption schemes are fairly inefficient, with only asymptotic performance analysis. It is thus difficult to assess how far we are from their practical implementation in security solutions.
Objectives of the project
The first goal of the project is to select the best FHE solutions that exist and try to improve their performance as much as possible. This task is closely related with the task of properly selecting parameters and sizes that match an expected security level.
Then, the main goal of CRYPTOCOMP is to develop a fully automated “source to source” compiler allowing to convert any function into a “secure” version of this function able to run on encrypted data. The main features of this compiler should be:
- complete transparency of the underlying fully homomorphic encryption scheme used
- definition of low-level computation models (possibly down to levels such as Turing machines or random access machines) suitable for the efficient execution of certain algorithm classes (sorting, signal processing, etc.)
- analysis and regulation of data dependent flow control to allow the service provider access to a given part of the data, and only to this part of the data
- automatic and efficient parallelization (through the compiler) of the cryptographic computations
By the end of the project, we expect to have a fully functional demonstration platform available. Users will be able to upload their encrypted private data, locally compile their normal program into a fully homomorphic program and outsource the execution of this program to the demonstration platform. Once the execution is complete, the user can download the encrypted result from the platform and decrypt it.
Related presentations & talks
Stream ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression.In FSE 2016, 2016.
NFLlib: NTT-based Fast Lattice Library.In CT-RSA 2016, 2016.
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance.In ASIACRYPT (1) 2015, 2015. Best Paper Award
Cryptanalysis of the Co-ACD Assumption.In CRYPTO (1) 2015, pp. 561-580, 2015.
Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR.In Financial Cryptography Workshops 2015, pp. 184-193, 2015.