Lattice-based cryptography offers a promising direction for transitioning Bitcoin toward post-quantum security, serving as a secure replacement for currently deployed discrete logarithm signatures. Th...

Join us for four days of applied cryptography in the Mediterranean. July 13–16, 2026 at AUB Mediterraneo Campus, Paphos, Cyprus.

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

\emph{Lattice-based cryptography} is the use of conjectured hard problems on point lattices in~$\R^{n}$ as the foundation for secure cryptographic systems. Attractive features of lattice 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...

YouTube video by media.ccc.de

For production cryptographic software, memory safety alone does not define security. Real-world crypto must run on every platform, maintain stable assumptions

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

YouTube video by Simons Institute for the Theory of Computing

YouTube video by Simons Institute for the Theory of Computing

YouTube video by Duct Tape

A deep dive into how ZKVMs work — from ZK proofs and circuits through arithmetization to building a working STARK-based ZKVM in Rust.

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

We present a systematic security analysis of Alipay's APK signing certificate, issued in 2009 using md5WithRSAEncryption with RSA-1024 and still active in 2026, serving over one billion users. Through...

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

Automatically erase memory to prevent secret leaks.

Contribute to Threshold-ML-DSA/Threshold-ML-DSA development by creating an account on GitHub.

Threshold signature schemes allow a group of users to jointly generate a digital signature, providing resilience against faults and enhancing decentralization. With the advent of post-quantum cryptogr...

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

YouTube video by DEFCONConference

Contribute to TECDSA/ecdsa_two_round development by creating an account on GitHub.

We propose the first two-round multi-party signing protocol for the Elliptic Curve Digital Signature Algorithm (ECDSA) in the threshold-optimal setting, reducing the number of rounds by one compared t...

In a threshold decryption system a secret key is split across a number of parties so that any threshold of them can decrypt a given ciphertext. We introduce a new concept in threshold decryption call...

Implementation of the Verifiable Timed Commitment scheme - primefactor-io/vtc

YouTube video by Monash Information Technology

We present a fully homomorphic encryption scheme which natively supports arithmetic and logical operations over large "machine words", namely plaintexts of the form $\mathbb{Z}_{2^n}$ (e.g. $n=64$). O...

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

Interactive 𝒫𝔩𝔬𝔫𝒦 Zero-Knowledge Proof Tutorial

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

Start with a gentle introduction to core cryptographic primitives, explore the basics of hardware acceleration, and then apply them to build optimized systems with ICICLE.

Homomorphic Encryption (HE) allows computations on encrypted data without decryption. It can be used where the users’ information are to be processed by an untrustful server, and has been a popular ch...

YouTube video by Simons Institute