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 novel CRT-based asymptotically perfect Disjunctive Hierarchical Secret Sharing (DHSS) scheme that overcomes security and information rate limitations of existing methods.

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

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

This paper presents a cryptanalytic attack demonstrating that a specific code-based Private Information Retrieval (PIR) scheme can be broken, allowing the server to efficiently determine the requested…

This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…

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…

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

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 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 provides the first unconditional proof for Weber's Conjecture for the case $k ext{ up to } 12$, which is crucial for lattice-based cryptography.

This paper proposes a novel secure aggregation protocol for Federated Learning using two-layer secret sharing, reducing communication and computational overhead.

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