r/cryptography • u/mrdividendsniffer • 21d ago
Homomorphic Encryption for (almost) every tech stack!
Homomorphic encryption is a cryptographic technique that enables direct computation on encrypted data without ever decrypting it first—keeping sensitive data secure even during processing.
lightphe is a comprehensive homomorphic encryption library supporting an unmatched variety of encryption schemes:
• Multiplicatively Homomorphic: RSA, ElGamal.
• Additively Homomorphic: Paillier, Damgard-Jurik, Exponential ElGamal, Elliptic Curve ElGamal, Benaloh, Naccache-Stern, Okamoto-Uchiyama.
• Logical / Bitwise: Goldwasser-Micali (XOR), Sander-Young-Yung (AND).
• Somewhat Homomorphic: Boneh-Goh-Nissim (Unlimited Additions and Only One Multiplication)
To make these powerful cryptographic algorithms easily accessible across modern software architectures, lightphe offers full multi-language support with native implementations in:
🐍 Python: https://github.com/serengil/LightPHE
🐹 Go: https://github.com/serengil/lightphe-go
☕ Java: https://github.com/serengil/lightphe4j
🟨 TypeScript: https://github.com/serengil/lightphe-ts
3
u/gnahraf 21d ago
Thank you for sharing this. I'm an application programmer, not a cryptographer, but I've been musing over if/how HE may be applied in the setting of an otherwise private, append-only ledger where you periodically reveal a total of some integral column-value w/o revealing the individual values (eg for regulatory purposes).
The issue in my application is commitment: I need a way to record an HE encoded value before the subsequent values are known (values from future ledger rows). Is such a thing even possible? (My gut says not; the HE encoded values are interdependent, but I have to ask)