Tessera
Folgen

Philipp Muens

@muens.io

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

208 Posts149 Follower275 Folgt
Philipp Muens@muens.io · 2mo ago

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

SoK: Private LLM Inference using Approximate Homomorphic Encryption

Although 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...

eprint.iacr.org

Philipp Muens@muens.io · 2mo ago

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

A gentle introduction to lattice-based cryptography

We 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...

eprint.iacr.org

Philipp Muens@muens.io · 3mo ago

This is a nice list with different resources on FHE attacks: github.com/Hexens/aweso... Pairs well with the Security Notions Zoo: securitynotionszoo.com

GitHub - Hexens/awesome-fhe-attacks: A curated list of research, articles, tools, and resources focused on attacks against Fully Homomorphic Encryption (FHE)

A curated list of research, articles, tools, and resources focused on attacks against Fully Homomorphic Encryption (FHE) - Hexens/awesome-fhe-attacks

github.com

Philipp Muens@muens.io · 4mo ago

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

A Universal Blinder: One-round Blind Signatures from FHE

We 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 ...

eprint.iacr.org

Philipp Muens@muens.io · 7mo ago

I'm a huge fan of Adaptor Signatures and use them in a project I'm currently working on. A new paper was just released that studies Blind Adaptor Signatures which is an interesting combination of Blind Signatures and Adaptor Signatures: eprint.iacr.org/2026/060

Blind Adaptor Signatures, Revisited: Stronger Security Definitions and Their Construction toward Practical Applications

Although both blind signatures and adaptor signatures have individually attracted attention, there is little research on combining these primitives so far. To the best of our knowledge, although the ...

eprint.iacr.org

Philipp Muens@muens.io · 8mo ago

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

LifeXP+: Secure, Usable and Reliable Key Recovery for Web3 Applications

In 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...

eprint.iacr.org

Philipp Muens@muens.io · 12mo ago

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.

Philipp Muens@muens.io · 12mo ago

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-...

Verifiable Timed Signatures Made Practical

A 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 ...

eprint.iacr.org

Philipp Muens@muens.io · last yr.

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.

Post-Quantum Readiness in EdDSA Chains

The 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...

eprint.iacr.org