Recent advancements in cryptography are increasingly focused on enhancing security while addressing practical deployment challenges. One notable trend is the development of condition-triggered cryptographic asset control, which allows for regulatory compliance and conditional delegation without persistent key exposure, potentially transforming digital asset management. Concurrently, lightweight block ciphers like ExpanderGraph-128 are being designed to optimize performance and security through novel structural approaches, making them suitable for resource-constrained environments. Additionally, the emergence of DNA-based cryptographic primitives offers a unique solution for unconditional security, enabling long-distance key distribution without the vulnerabilities associated with traditional methods. Meanwhile, the exploration of post-quantum cryptography is gaining momentum, particularly in the context of TLS 1.3 handshakes, as researchers assess the impact of various algorithms on transaction efficiency. Collectively, these developments indicate a shift towards more flexible, secure, and efficient cryptographic systems that meet the evolving demands of digital communication and data protection.
Control of encrypted digital assets is traditionally equated with permanent possession of private keys, a model that precludes regulatory supervision, conditional delegation, and legally compliant tra...
Lightweight block cipher design has largely focused on incremental optimization of established paradigms such as substitution--permutation networks, Feistel structures, and ARX constructions, where se...
Function Secret Sharing (FSS) schemes enable sharing efficiently secret functions. Schemes dedicated to point functions, referred to as Distributed Point Functions (DPFs), are the center of FSS litera...
Secure communication is the cornerstone of modern infrastructures, yet achieving unconditional security -resistant to any computational attack- remains a fundamental challenge. The One-Time Pad (OTP),...
Deploying ML-DSA (FIPS 204) in threshold settings has remained an open problem: the scheme's inherently non-linear rounding step defeats the additive share techniques that underpin practical threshold...
The \textsc{prim-lwe} problem (Sehrawat, Yeo, and Desmedt, \emph{Theoret.\ Comput.\ Sci.}\ 886, 2021) is a variant of Learning with Errors requiring the secret matrix to have a primitive-root determin...
Conjunctive Hierarchical Secret Sharing (CHSS) is a type of secret sharing that divides participants into multiple distinct hierarchical levels, with each level having a specific threshold. An authori...
In this paper, we present a laboratory study focused on the impact of post-quantum cryptography (PQC) algorithms on multiple layers of stateful HTTP over TLS transactions: the TCP handshake, the inter...
Disjunctive Hierarchical Secret Sharing (DHSS)} scheme is a type of secret sharing scheme in which the set of all participants is partitioned into disjoint subsets, and each subset is said to be a lev...
We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to $U,U^\dagger,U^*,U^T$ for a Haar random unitary $U$. Our scheme satisfies the standard n...