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
Really excited for the new "Secret Mode" that will land in Go v1.26 and will make operations such as key generation more secure.
antonz.org/accepted/run...
Really great to see more research on Threshold ML-DSA (fka Dilithium): eprint.iacr.org/2026/013
The code for the implementation can be found here: zenodo.org/records/1796...
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
Very interesting talk when it comes to the SotA of Quantum Computing: www.youtube.com/watch?v=OkVY...
Here's the code for their implementation: github.com/TECDSA/ecdsa...
Great to see some progress towards a Two-Round ECDSA Threshold Signature Scheme: eprint.iacr.org/2025/1696
This is an interesting paper that allows for a context to be added to Threshold Decryptions: eprint.iacr.org/2025/279
Here's a link to the repository and its documentation:
Repository: github.com/primefactor-...
Documentation: pkg.go.dev/github.com/p...
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.
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.
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).
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.
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).
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.
The VTC implementation described in the paper is really elegant as it uses Linearly Homomorphic Time-Lock Puzzles to implement the proof via a cut-and-choose mechanism.
I highly recommend you read the paper or watch this presentation to learn more: www.youtube.com/watch?v=X4vO...
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.
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.
Paper: eprint.iacr.org/2020/1563.pdf
Repository: github.com/primefactor-...
Documentation: pkg.go.dev/github.com/p...
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.
This is a really interesting FHE paper in which BGV is used to build an ALU to do arithmetic as well as logical operations on messages in Z_2^n (e.g. 64 bit machine words).
eprint.iacr.org/2025/1449
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-...
ZKSecurity just dropped this truly awesome PlonK tutorial: plonk.zksecurity.xyz
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.
Ingonyama just published the first three lessons of their "Foundations of High-Speed Cryptography" course 👀
www.ingonyama.com/foundations-...
That would be awesome!
For me first thing in the morning is checking the new publications on eprint.iacr.org (also followed arxiv.org/list/cs.CR/recent but there’s too much noise IMHO).
This paper looks really interesting:
eprint.iacr.org/2025/770
ZKPs for (F)HE Schemes based on Ring-LWE.
FHE + ZKPs are a dream combo.
The recording of the Diamond iO talk by the Machina iO team that was held during the Simon Institute's "Obfuscation" workshop was just uploaded: www.youtube.com/watch?v=1RcK...
This is a great paper that explains how to obtain indistinguishability obfuscation (iO) via recursive Functional Encryption: piazza.com/class_profil...
It's basically a simplified version of the [BV15] paper: eprint.iacr.org/2015/163
