Practical Introduction to Homomorphic Cryptography
Homomorphic cryptography is a form of encryption that allows computations to be performed directly on encrypted data without decrypting it, producing encrypted results that can later be decrypted to reveal the correct outcome. This property is particularly valuable when sensitive data must remain private, such as secure data processing in cloud computing, privacy-preserving machine learning, or secure voting systems. For example, healthcare providers can analyze encrypted patient data for research purposes without accessing the original sensitive information, ensuring both privacy and utility.
Join us in the CSH Winter School 2025! The aim of the module is that:
- Participants can explain the necessary mathematical basics, such as groups, rings, and homomorphism.
- Participants should have a basic understanding and overview of existing homomorphic crypto systems. To this end,
- Participants should have learned the basics for using the CKKS crypto system in practice. This includes being able to name the sources of error in the crypto system and being able to explain how the following functions can be realized homomorphically: Division, root, exponential function, maximum, minimum.
- Participants should have gained practical experience working with the OpenFHE library.
All components will be supplemented by practical exercises, focusing on various applications of sentiment analysis. Participants are not required to have prior knowledge of cryptography or IT security.
Application is managed via the F.I.T. platform (weiterbildung.uni-hohenheim.de).
