Philipp Muens

Philipp Muens

@muens.io

Cryptography R&D @ primefactor.io • Nerd-snipe me with Lattices, Isogenies, Magmas, etc. • Instant Coffee Connoisseur • Webmaster @ muens.io

157 followers275 following209 posts

Pinned

Excited to announce Primefactor! Primefactor is a Research and Development Lab that explores the forefront of cryptographic advancements.

The Duality Technologies team published a comprehensive SoK on private LLM inference via FHE (with a focus on the CKKS scheme). It’s still inefficient, but FHE has come a long way. I am very hopeful that we'll get there someday. eprint.iacr.org/2026/935

eprint.iacr.orgSoK: Private LLM Inference using Approximate Homomorphic EncryptionAlthough recent surveys on privacy-enhancing technologies concluded that FHE cannot feasibly evaluate non-linear activation functions in modern ML architectures, 20 CKKS-based frameworks have since de...

Wow! Alfred Menezes just published this 182 page "A Gentle Introduction to Lattice-Based Cryptography" paper. I just skimmed through it, but it looks like an invaluable resource if you want to study lattices and how they're used in (PQ) Cryptography. eprint.iacr.org/2026/1098

eprint.iacr.orgA gentle introduction to lattice-based cryptographyWe present the quantum-safe Kyber key encapsulation mechanism (ML-KEM) and the Dilithium signature scheme (ML-DSA). We also develop the mathematical background on lattices needed to understand why Kyb...

This is a very interesting paper that uses FHE to turn any signature scheme into a blind signature scheme. Verifiability is ensured using a zkp. It also introduces the concept of "committed verifiable FHE" where the verifier doesn't learn the circuit. eprint.iacr.org/2026/574

eprint.iacr.orgA Universal Blinder: One-round Blind Signatures from FHEWe construct compilers that convert any secure signature scheme into a single-round blind signature scheme. An important property of the construction is that the final blind signature has exactly the ...

Key recovery is a tricky problem. This new paper outlines an interesting approach based on natural language stories which utilizes embeddings behind the scenes. It's an interesting solution at the intersection of Cryptography and Machine Learning. eprint.iacr.org/2025/2206

eprint.iacr.orgLifeXP+: Secure, Usable and Reliable Key Recovery for Web3 ApplicationsIn the Web2 world, users control their accounts using credentials such as usernames and passwords, which can be reset or recovered by centralized servers if the user loses them. In the decentralized W...

Excited to share my implementation of the paper "Verifiable Timed Signatures Made Practical" by Thyagarajan et al. More specifically I implemented the Verifiable Timed Commitment scheme described in section E.

View full thread

To maximize learning I constrained myself to only depend on the standard library and zero 3rd party dependencies. The whole code is covered with various tests which you can use to see how the implementation can be used in practice.

Excited to share my implementation of the paper "Verifiable Timed Signatures Made Practical" by Thyagarajan et al. More specifically I implemented the Verifiable Timed Commitment scheme described in section E.

View full thread

Implementing the Verifiable Timed Commitment scheme was definitely a hard nut to crack. I started working on this late last year, but there were a lot of missing pieces I had to put in place (e.g. implement the Linearly Homomorphic Time-Lock Puzzle first).

I also had to do a lot of pen-and-paper math to figure out how everything works. I'm super happy that it's finally out there! I also learned a ton while working on this which is valuable in and of itself.

Excited to share my implementation of the paper "Verifiable Timed Signatures Made Practical" by Thyagarajan et al. More specifically I implemented the Verifiable Timed Commitment scheme described in section E.

View full thread

Using this, timelock capabilities can be brought to Blockchains that don't have a scripting language. It furthermore increases privacy as no data regarding the timelock is stored on-chain (the VTC is shared off-chain).

One could use this in 2/2 multisigs (e.g. Payment Channels). Before funding the multisig, we could create a signed refund transaction which is timelocked via a VTC. The VTC can be opened after time t which allows one to refund themselves if the co-signer doesn't cooperate.

Excited to share my implementation of the paper "Verifiable Timed Signatures Made Practical" by Thyagarajan et al. More specifically I implemented the Verifiable Timed Commitment scheme described in section E.

View full thread

This construction has various applications, but the one I'm focusing on is refund transactions. Rather than using the Blockchain's scripting language you can share an encrypted signature over a refund transaction off-chain. This signature can then be recovered after time t.

Excited to share my implementation of the paper "Verifiable Timed Signatures Made Practical" by Thyagarajan et al. More specifically I implemented the Verifiable Timed Commitment scheme described in section E.

View full thread

A Verifiable Timed Commitment (VTC) allows one to commit to a value that's encrypted "into the future". For example, I can commit to and encrypt a private key in such a way that it can only be decrypted after time t.

Verifiability is implemented via a proof which guarantees that the value that can be decrypted after time t is the one that was committed to. In our example we could provide the public key and the proof guarantees that the encrypted private key corresponds to the public key.

Excited to share my implementation of the paper "Verifiable Timed Signatures Made Practical" by Thyagarajan et al. More specifically I implemented the Verifiable Timed Commitment scheme described in section E.

Currently deep down the rabbit hole to finish my implementation of "Verifiable Timed Signatures Made Practical" eprint.iacr.org/2020/1563 While doing so I had to update my LHTLP implementation. It now features a range proof and new homomorphic operations: github.com/primefactor-...

eprint.iacr.orgVerifiable Timed Signatures Made PracticalA verifiable timed signature (VTS) scheme allows one to time-lock a signature on a known message for a given amount of time $T$ such that after performing a sequential computation for time $T$ anyone ...

This is an interesting read on how EdDSA's hash-based key derivation (RFC 8032) can be used to compute PQ-ZKPs for private key ownership proofs: eprint.iacr.org/2025/1368 This is good news as it allows for an easier transition towards Post Quantum secure cryptocurrencies.

eprint.iacr.orgPost-Quantum Readiness in EdDSA ChainsThe impending threat posed by large-scale quantum computers necessitates a reevaluation of signature schemes deployed in blockchain protocols. In particular, blockchains relying on ECDSA, such as Bitc...

Turns out there's currently an ongoing "Obfuscation" Workshop / Symposia hosted by the Simons Institute! simons.berkeley.edu/workshops/ob... They just uploaded the "Expedition to Obfustopia" video by Rachel Lin which IMHO is the best overview of the SoTA of iO: www.youtube.com/watch?v=2PRU...

simons.berkeley.eduObfuscationObfuscation is an immensely powerful tool that enables us to construct essentially any other cryptographic primitive one can dream of. This workshop will focus on recent progress in obfuscation, inclu...
Philipp Muens@muens.io

For anyone interested in learning more about Indistinguishability Obfuscation (iO) I highly recommend watching this talk by Amit Sahai: mediaspace.illinois.edu/media/t/1_ur... I scoured the internet for a good introduction to the topic and this is the best talk so far IMHO.