The paper introduces a novel, asymptotically ideal Conjunctive Hierarchical Secret Sharing (CHSS) scheme using the Chinese Remainder Theorem (CRT) for polynomial rings, achieving high security and an…

The paper proposes two new asymptotically ideal and secure Hierarchical Secret Sharing (HSS) schemes, disjunctive and conjunctive, utilizing the Chinese Remainder Theorem (CRT) over an integer ring an…

The paper proposes a new DDH-based technique that significantly reduces the key size of multi-party Distributed Point Function (DPF) secret sharing schemes, achieving an $O( oot{3}{N})$ key size for h…

The paper presents a lattice-based Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme that supports $\mathsf{NC}^1$ access policies while maintaining constant-size ciphertexts.

The paper proposes a novel ring-based information-theoretic Private Information Retrieval (itED-PIR) scheme that overcomes the key size and communication overhead limitations of existing field-based A…

The paper proposes efficient Fuzzy Private Set Intersection (FPSI) protocols for various $L_p$ distance metrics by leveraging symmetric-key operations, achieving linear complexity and significantly ou…

This paper establishes a complexity hierarchy for shuffle operations used in card-based cryptography, classifying them by implementation difficulty and proving separations between these levels.

The paper proposes a novel, perfectly secure Information-Theoretic Distributed Point Function (ITDPF) that converts point functions into shares using asymptotically shorter secret keys compared to exi…

The paper systematically investigates the conditions under which linear layers in AES-like ciphers avoid related-differential structures, proving that the MDS property is necessary and identifying spe…

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

The paper establishes a strong connection between scalable pseudorandom unitaries (PRUs) and the unitary synthesis problem, proving that any such PRU construction must require a classical oracle of si…

The paper establishes that the existence of many-time secure uncloneable encryption (UCE) can be shown to follow from relatively weak assumptions, such as the existence of many-time secure symmetric k…

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

This paper provides a comprehensive, system-level taxonomy for designing quantum-resistant network architectures, moving beyond simple protocol substitutions to address key distribution and management…

The paper introduces a novel authentication-with-response scheme that halves the key consumption required for mutual authentication in Quantum Key Distribution (QKD) while maintaining unconditional se…

This paper demonstrates that a proposed lightweight RFID authentication protocol is structurally insecure and susceptible to a multi-session algebraic attack, enabling full compromise of the secret ke…

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…

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…

The paper introduces the PML envelope, a novel definition that provides a robust and operationally meaningful measure of information leakage about a secret, satisfying both post-processing robustness…