This paper presents an architecture for private and verifiable electronic voting using the Paillier cryptosystem, without a trusted key dealer, and proves its correctness under certain assumptions.

The paper provides distinguishers for McEliece type cryptosystems with larger row and column weights, and presents a framework to turn distinguishers into key-recovery attacks. It successfully attacks…

This paper provides the first comprehensive cryptanalysis of the Legendre Pseudorandom Function over extension fields, demonstrating key recovery attacks under both passive and active threat models.

The paper estimates the quantum resources required to break 256-bit ECC cryptography and warns that fast-clock quantum computers could enable on-spend attacks on modern cryptocurrencies, necessitating…

The paper introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

The paper introduces the Unicity Execution Layer, a secure, modular component that enables trustless off-chain transactions while guaranteeing double-spending prevention and enhancing user privacy.

Pepper is a novel, high-bandwidth anonymous broadcast protocol that achieves cryptographic sender anonymity and significantly improves messaging throughput compared to existing state-of-the-art system…

This paper provides a focused, preparatory introduction to sheaves and topoi, establishing the necessary structural background to understand the advanced sheaf-theoretic framework used in cryptographi…

The paper introduces PolyVeil, a protocol for private Boolean summation that uses permutation matrices in the Birkhoff polytope, achieving strong security guarantees while highlighting a fundamental t…

SILMARILS presents a quantum-secure, information-theoretic designated-verifier (DV) signature scheme built on a minimal algebraic core, suitable for lightweight blockchain authentication.

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

This paper proposes the first constant-time decoding algorithm for Augmented Gabidulin (AG) codes, a variation of Gabidulin codes used in efficient rank-based cryptosystems.

This paper presents an unconditional construction for a one-bit one-time private-key unclonable encryption scheme, which is information-theoretically secure, efficient, and has exponentially small unc…

This paper proposes using polynomial multiproofs (PMP) to aggregate multiple data availability samples into a single proof, significantly reducing the bandwidth and computational overhead for blockcha…

The paper proposes using deep learning to empirically test the indistinguishability of various post-quantum and hybrid cryptographic schemes, finding that no tested combination showed a significant ad…

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.

The paper proposes a provably secure, single-round two-party computation protocol for approximate matrix multiplication using lattice-based cryptography, demonstrated for secure control law implementa…

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…

This paper extends quantum lattice reduction techniques (CDPR) from ideal to module lattices over cyclotomic rings, achieving a constant module reduction factor and providing a rigorous, bounded-preci…