Advertisement · 728 × 90

Posts by Jonas Janneck

I'm looking for a PhD student to work with me on formal verification for cryptographic protocols.

This is a 4-year position at VU Amsterdam, co-supervised with Kristina Sojakova. Send me an email if you want to know more!

4 days ago 8 9 1 0
CASA Summer School | Cluster of Excellence CASA | RUB The annual summer school offers young scientists lectures by high-ranking scientists and international exchange.

Consider attending our CASA summer school on cryptography and distributed computing from June 22.-25. in Bochum! Registration is open until March 12.

casa.rub.de/en/events/ca...

1 month ago 7 5 0 0

I am very excited that our work on secure cloud storage is now online. A big shoutout also to my co-author @jonasjanneck.bsky.social who will present the results at Eurocrypt’26!

1 month ago 9 2 1 0

Compared to a previous version, we improved the security bounds and have a meaningful result for strong unforgebaility 💪
We also give a security analysis of the FFO Sampler used in Falcon completing the analysis of the scheme.

1 month ago 2 0 0 0
Preview
A Closer Look at Falcon Falcon is a winner of NIST’s six-year post-quantum cryptography standardisation competition. Based on the celebrated full-domain-hash framework of Gentry, Peikert and Vaikuntanathan (GPV) (STOC’08), F...

We updated our work on the first concrete security proof of the Falcon signature scheme 🦅

ia.cr/2024/1769

This is joint work with Pierre-Alain, Phillip, Hubert, and @kiltz.bsky.social and will appear at Eurocrypt’26 🎉

1 month ago 3 0 1 0

The schemes are further highly practical by being as compact as the naive concatenation of two signatures.

One construction, which can be used to combine EdDSA and ML-DSA, achieves even smaller signatures than the sum of the both component schemes 🎉

1 month ago 2 0 0 0

The designs allow for a simple migration without messing with the PQ component meaning:
- FIPS compliance for NIST standardized schemes ✅
- no new PQ implementation needed 💻
- no patent issues 🧑‍⚖️

The Bird of Prey combiners are the first achieving this requirement together with strong unforgeability!

1 month ago 2 0 1 0
Preview
Bird of Prey: Practical Signature Combiners Preserving Strong Unforgeability Following the announcement of the first winners of the NIST post-quantum cryptography standardization process in 2022, cryptographic protocols are now undergoing migration to the newly standardized sc...

Happy to announce that Bird of Prey is accepted at EC’26 🛸✍️🎉

eprint.iacr.org/2025/1844

The paper presents three signature combiners for PQC migration preserving strong unforgeability. They capture all broadly used classical schemes and can be used with *any* PQ signature in a black-box way!

1 month ago 4 1 1 0
PrivCrypt 2026

I am co-organising (with @drl3c7er.bsky.social and Lucjan Hanzlik) a workshop on Privacy-Enhancing Cryptography in Rome on May 10 as an affiliated event to IACR Eurocrypt. Submit your best PEC-work (3-page extended abstract) for presentation by February 25th: privcryptworkshop.github.io

2 months ago 11 9 1 0
Call for Presentations Workshop on Proofs and Proof Techniques for Cryptographic Security. Affiliated with Eurocrypt 2026.

Planning your trip to Eurocrypt or looking for an excuse to still go? The reviewers did not appreciate your too involved or too elegant proofs?

Consider submitting a talk to ProTeCS (protecs-workshop.gitlab.io), an affiliated event of EC, where we celebrate proofs as independent objects of study!

2 months ago 11 4 1 2
Advertisement

Are you looking for a signature combiner for PQC migration?
We already have combiners/hybrids for unforgeability. But do we have combiners that also preserve strong unforgeability and all BUFF properties? Now we do:

6 months ago 4 0 0 0
Abstract. An Authenticated Key Encapsulation Mechanism (AKEM) combines public-key encryption and digital signatures to provide confidentiality and authenticity. AKEMs build the core of Hybrid Public Key Encryption (RFC 9180) and serve as a useful abstraction for messaging applications like the Messaging Layer Security (MLS) protocol (RFC 9420) and Signal’s X3DH protocol. To date, most existing AKEM constructions either rely on classical (non post-quantum) assumptions or on unoptimized black-box approaches leading to suboptimal efficiency.

In this work, we choose a different abstraction level to combine KEMs and identification schemes more efficiently by leveraging randomness reuse. We construct a generic scheme and identify the necessary security requirements on the underlying KEM and identification scheme when reusing parts of their randomness. This allows for a concrete instantiation from isogenies based on the POKÉ KEM (EUROCRYPT’25) and the SQIsignHD identification scheme (EUROCRYPT’24). To be used in our black-box construction, the identification scheme requires the more advanced security property of response non-malleability. Hence, we further show that a slight modification of SQIsignHD satisfies this notion, which might be of independent interest.

Putting everything together, our final scheme yields the most compact AKEM from PQ assumptions with public keys of 366 bytes and ciphertexts of 216 bytes while fulfilling the strongest confidentiality and authenticity notions.

Abstract. An Authenticated Key Encapsulation Mechanism (AKEM) combines public-key encryption and digital signatures to provide confidentiality and authenticity. AKEMs build the core of Hybrid Public Key Encryption (RFC 9180) and serve as a useful abstraction for messaging applications like the Messaging Layer Security (MLS) protocol (RFC 9420) and Signal’s X3DH protocol. To date, most existing AKEM constructions either rely on classical (non post-quantum) assumptions or on unoptimized black-box approaches leading to suboptimal efficiency. In this work, we choose a different abstraction level to combine KEMs and identification schemes more efficiently by leveraging randomness reuse. We construct a generic scheme and identify the necessary security requirements on the underlying KEM and identification scheme when reusing parts of their randomness. This allows for a concrete instantiation from isogenies based on the POKÉ KEM (EUROCRYPT’25) and the SQIsignHD identification scheme (EUROCRYPT’24). To be used in our black-box construction, the identification scheme requires the more advanced security property of response non-malleability. Hence, we further show that a slight modification of SQIsignHD satisfies this notion, which might be of independent interest. Putting everything together, our final scheme yields the most compact AKEM from PQ assumptions with public keys of 366 bytes and ciphertexts of 216 bytes while fulfilling the strongest confidentiality and authenticity notions.

Image showing part 2 of abstract.

Image showing part 2 of abstract.

Snake Mackerel: An Isogeny-Based AKEM Leveraging Randomness Reuse (Jonas Janneck, Jonas Meers, Massimo Ostuzzi, Doreen Riepel) ia.cr/2025/1474

8 months ago 2 1 0 0
Post image

The preliminary program for the Cryptographic Applications Workshop (CAW) at Eurocrypt'25 is out.
#CAW focuses on the construction and analysis of cryptography built for practice.
This thread gives a quick overview; the full program and abstracts are here: caw.cryptanalysis.fun#program

1 year ago 9 7 1 1
WISC | Cluster of Excellence CASA | RUB The Women in Security and Cryptography Workshop promotes international female PhD students and outstanding female students in the field of IT security.

The 3rd edition of WISC – Women in Security and Cryptography Workshop will take place in Bochum from June 16 to 18. Already confirmed are talks by Lejla Batina, Zinaida Benenson, Shafi Goldwasser, Martina Lindorfer, and Doreen Riepel. Registration is open now! casa.rub.de/en/events/wi...

1 year ago 16 11 0 0