Structure-Preserving Compressing Primitives, Revisited

Enhanced private set union from secret-shared private membership test

This work introduces a new PSU protocol that is simple, efficient, and secure against known during-execution leakage and hashing-related leakage without relying on Cuckoo Hashing, and achieves linear complexity.

Constant-Rate Certified Deletion

This work obtains the first constant-rate constructions in the plain model that achieve certified deletion while preserving everlasting security, and shows that public verifiability can be incorporated into BB84- and coset-based certified deletion schemes with constant rate.

Prefix Puncturable Signatures with Smaller Signing Key from HIBS

A generic construction of prefix puncturable signatures from hierarchical identity-based signature (HIBS) schemes based on identity-based signatures (IBS) based on a lattice-based delegated constrained signature scheme.

U NITED : Shuffle-Free Multiparty PSU via Oblivious Invertible Sketches

U NITED is presented, a shuffle-free MPSU framework based on a new data-structure abstraction, Oblivious Insert-Only In-vertible Sketches (OIIS), which ensures that each distinct union element is inserted exactly once while hiding the insertion condition and modified locations.

Radical Ring-LWR: Efficient Key Encapsulation and Signatures from Structured Rounding

D-HPPK KEM: A Defactorized Homomorphic Polynomial Public Key Encapsulation Mechanism for IND-CCA2 Security

We present the Defactorized Homomorphic Polynomial Public Key (D-HPPK) Encapsulation Mechanism, a post-quantum KEM whose security rests on exhaustive-search problems with efficient verification for both attack paths. We adopt the NIST search-based convention, under which a primitive is assigned security level l when th...