Fully Homomorphic Encryption logo

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!

Related service

Post-Quantum Cryptography

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 projects


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.



A crypto-calculus platform for the Cloud.

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.


Protecting your privacy, or your consumers’ privacy, is even more important when it come to Cloud storage or services. While classical and standardized cryptography is used to build very powerful protocols to protect your communications, your data, your keys in hardware and in software, your randomness and so much more… when it comes to computing on private data, to apply procedures on your private data, current solutions unfortunately require to get the data in clear.

However, solutions do exist.

An homomorphic encryption scheme allows to operate over encrypted data, without ever needing to decrypt it.

Build Powerful Services with Optimal Security

Using homomorphic encryption can completely reshape your business to protect your users’ privacy.

Using Partially Homomorphic Encryption Schemes

Partially homomorphic encryption schemes allow to perform an operation (either additions or multiplications) over encrypted values. Partially homomorphic encryption has existed for many years, and we currently witness efforts towards its standardization to secure the Cloud.

The additional property of these schemes allows to build exciting applications. Some examples of applications can be found

  • in electronic voting: the homomorphic property provides a tool to compute the tally from the encrypted votes without decrypting the individual votes, only the final result is decrypted.
  • in data mining: the homomorphic property provides a way to compute some simple statistic computations such as mean, variance, linear regressions, etc.
  • in voice/image processing: usual processing functions, such as fast Fourier transformations and matrix multiplications, are linear functions and can therefore be performed efficiently using partially homomorphic encryption.

We can help you bring privacy protection to your services.

Using More Powerful Homomorphic Encryption Schemes

Rather than being limited to one type of operations only, (fully) homomorphic encryption schemes allow to perform any function on encrypted data, without ever needing to reveal it. Applications are theoretically endless: whatever a computer can do on data, you can do it over encrypted data without needing to know what you are processing!

Existing fully homomorphic encryption schemes are fairly inefficient for generic functions, but depending on your application, very efficient solutions can be designed and solve the Cloud security problem. Applications such as private databases intersections, privacy-preserving biometric authentication, search over encrypted databases, privacy-preserving advertising and pricing, and many others are definitely possible today.

You could really make a difference on privacy protection in your services, and you can do it without sacrificing any functionality. Contact us!

Why choose CryptoExperts

From Research to Nicely Optimized Implementation and Standardization

Not only are we actively involved in the research community on homomorphic encryption (and participating to European projects on homomorphic encryption), but we can also design a complete protocol, provide secure, efficient and fine-tuned libraries for any computing platform. And we can even implement everything for you.

Also, our CEO is the main editor of the upcoming standard ISO/IEC 18033-6 on partially homomorphic encryption.

If you would like to see a powerful cryptographic scheme perfectly protecting your consumers’ privacy, or just need to conduct a feasibility study, we can help you get ready. Simply ask us.

Related presentations & talks

  • 🇫🇷 Chiffrement (complètement) homomorphe : de la théorie à la pratique.
    Tancrède Lepoint.
    Séminaire confiance numérique, Clermont-Ferrand, France, October 09, 2014.
  • Homomorphic Encryption: From Theory to Practice.
    Tancrède Lepoint.
    CryptoBG International Summer School 2014, Bulgaria, July 23, 2014.

Related publications

  • Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression.
    Anne Canteaut, Sergiu Carpov, Caroline Fontaine, Tancrède Lepoint, María Naya-Plasencia, portrait ofPascal Paillier, Renaud Sirdey.
    In FSE 2016, pp. 313-333, 2016.
  • NFLlib: NTT-based Fast Lattice Library.
    Carlos Aguilar-Melchor, Joris Barrier, Serge Guelton, Adrien Guinet, Marc-Olivier Killijian, Tancrède Lepoint.
    In CT-RSA 2016, 2016.
  • Scale-Invariant Fully Homomorphic Encryption over the Integers.
    Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi.
    In Public Key Cryptography 2014, pp. 311-328, 2014.
  • A Comparison of the Homomorphic Encryption Schemes FV and YASHE.
    Tancrède Lepoint, Michael Naehrig.
    In AFRICACRYPT 2014, pp. 318-335, 2014.
  • Batch Fully Homomorphic Encryption over the Integers.
    Jung Hee Cheon, Jean-Sébastien Coron, Jinsu Kim, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi, Aaram Yun.
    In EUROCRYPT 2013, pp. 315-335, 2013.
  • On the Minimal Number of Bootstrappings in Homomorphic Circuits.
    Tancrède Lepoint, portrait ofPascal Paillier.
    In Financial Cryptography Workshops 2013, pp. 189-200, 2013.
  • Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions.
    Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, portrait ofPascal Paillier, Haixia Shi.
    In J. Cryptol., 2008.
  • Decryptable Searchable Encryption.
    Thomas Fuhr, portrait ofPascal Paillier.
    In ProvSec 2007, pp. 228-236, 2007.
  • Public-Key Cryptosystems Based on Composite Degree Residuosity Classes.
    portrait ofPascal Paillier.
    In EUROCRYPT 1999, pp. 223-238, 1999.