Haiyang Xue

Efficient Lossy Trapdoor Functions Based on Subgroup Membership Assumptions

We propose a generic construction of lossy trapdoor function from the subgroup membership assumption. We present three concrete constructions based on the k-DCR assumption over

(Deterministic) Hierarchical Identity-based Encryption from Learning with Rounding over Small Modulus

\mathbb{Z}^*_{N^2}

Identity-Based Lossy Encryption from Learning with Errors

, the extended p-subgroup assumption over

Lossy Trapdoor Relation and Its Applications to Lossy Encryption and Adaptive Trapdoor Relation

\mathbb{Z}^*_{N^2}

On the Lossiness of 2k-th Power and the Instantiability of Rabin-OAEP

, and the decisional RSA subgroup membership assumption over

Lattice-Based Dual Receiver Encryption and More.

\mathbb{Z}^*_{N}

Understanding and Constructing AKE via Double-Key Key Encapsulation Mechanism

. Our constructions are more efficient than the previous construction from the DCR assumption over

New Framework of Password-Based Authenticated Key Exchange from Only-One Lossy Encryption

\mathbb{Z}^*_{N^{s}}

IND-PCA Secure KEM Is Enough for Password-Based Authenticated Key Exchange (Short Paper)

(s ≤ 3).

Towards Tightly Secure Deterministic Public Key Encryption

In this paper, we propose a hierarchical identity-based encryption (HIBE) scheme in the random oracle (RO) model based on the learning with rounding (LWR) problem over small modulus