Web servers need better tools to manage agentic traffic. Fortunately, we can build these tools in a way that protects the privacy of the human in the loop. https://t.co/rsrtfmNnKr
Anonymous credentials are going to have a big year. In the realm of "fancy" cryptography, they're perhaps the most important primitive we'll need to make PQ. Where do we stand? Lena Heimberger spent part of the summer finding out.
https://t.co/TRceZqWFgu
Cloudflare is launching an experiment with Chrome to evaluate fast, scalable, and quantum-ready Merkle Tree Certificates, all without degrading performance or changing WebPKI trust relationships. https://t.co/ilGAxVjXAe
Agents need credentials that protect the privacy of the users behind them.
Read more about it
https://t.co/xARTW7ct5n
Joint work with Lena Heimberger, @cjpatton_, and @thibmeu at @Cloudflare
Working on anonymous credentials?
In this blog post @cjpatton_ and @unlocking_lox tells about the state of Post-Quantum credentials.
https://t.co/1hoSpKkW2e
We're sharing our new research on converting multiple key-dependent attacks into universal attacks. This work comes with open-source implementation tools and GPU-accelerated experiments to support reproducibility:
Paper: https://t.co/jI68yToYWP
https://t.co/eF3f1n4onj
OPRFs are one of the most widely used privacy tools, but they’re under threat from developments in quantum chips.
In this work we present Leap, a lattice-based OPRF using MPC tools (OT, OLE) for post-quantum security—fast eval (<1ms) & efficient PSI.
Joint work with @isec_tugraz, Trento, and AIT. To appear at @IACReurocrypt 2025.
https://t.co/mv9hE5OwkJ
Leap: New post-quantum oblivious pseudorandom function (OPRF).
OPRF is a 2PC between a server which holds a secret key, and a client who provides input. The server learns neither the input nor the output. The client doesn’t learn the key.
Since we obliviously evaluate the heuristically-secure OPRF SPRING, the PRF part of the OPRF is also blazingly fast. This gives rise to efficient post-quantum computation that could potentially beat classical computation.
Our paper Leap: A Fast, Lattice-based OPRF With Application to Private Set Intersection is finally public (https://t.co/Ty1hkfmowW) and will be presented at #IACR Eurocrypt 2025!
My personal favourite contribution is that we show that lattice-based OPRFs are faster than the elliptic-curve based 2HashDH construction. Our proof-of-concept implementation (though unoptimized and non-constant-time for now) shows promising computational efficiency.
@blueminimal That being said, I'm not sure how helpful I'll be: I have no experience there and never participated in the ACSC(both years I wanted to had stalking challenges).
https://t.co/6K4EWAhmiG
Periodische Erinnerung dass das Problem von wenigen weiblichen* Teilnehmerinnen bei der ACSC nicht nur die aggressive Kommunikation ist sondern dass mehrere Jahre die Qualifikation Challenges mit Stalking (zb Datenbank für Handynummer hacken) enthalten hat
@blueminimal Usually acknowledgment of previous errors is a good start ;) that being said if you actually want to chat I'm sure the people from Graz can help you with my contact details if you don't have them.