Posts
Reminder: FHE.org (Fully Homomorphic Encryption) 2025 cryptography Call for Presentations submission deadline is in 2 weeks!
The deadline to submit your presentation for FHE.org 2025 is fast approaching—less than two weeks left — November 23, 2024 (23:58 AoE)! Don’t miss your chance to share your work with the FHE community in Sofia on March 25th, 2025. We welcome a wide range of submissions, including work presented …
Suffragium: An Encrypted Onchain Voting System Leveraging ZK and FHE
Join us this next Thursday, Nov 14th at 1PM CEST for a new FHE.org meetup with Fabrianne Effendi, an AWS Associate Solutions Architect and recent graduate of Nanyang Technological University Singapore, presenting "Privacy-Preserving Graph ML with FHE for Collaborative Anti-Money Laundering".
How to apply Pohlig Hellman using a very limited set of auxiliary inputs in that case ?
So I was reading about [this paper](https://eprint.iacr.org/2024/1321). The underlying idea is to lift the discrete logarithm problem to *prime−1* for prime curves or *order−1* for binary curves since most elliptic curves only have small factors in that case. But [their baby‑step giant‑step variant seems to only work when the private …
Ml-Kem encapsulate non-random bytes?
I am not a cryptographer, but I am trying to use cryptographic libraries and would like to do it safely. Unfortunately, for my use case it seems to require using them in a non-standard way. The APIs don't seem to fit my use case straight-forward. I was curious if it …
Would the clipper chip apply to foreign sales of American technology?
Wouldn't that mean the Department of Commerce has keys to the entire world's communications? How would the Clipper Chip apply to foreign nations?
cr.yp.to: 2024.10.28: The sins of the 90s
Blog - Security research on Private Cloud Compute - Apple Security Research
NIST PQ-signature onramp: round 2 candidates announcement
Proof of Possession: Does a Schnorr Signature done with the sum of 2 Elliptic Curve private keys prove possession of the 2 individual keys?
G is the Generator of a Discrete Log Hard Elliptic Curve Group. 2 Private keys x1 & x2, corresponding Public Keys P1 = x1G & P2 = x2G. Now P = P1 + P2 is also a public key with corresponding private key x = x1 + x2. If I …