Efficient Identity-Based Matchmaking Encryption with Enhanced Privacy and Chosen-Ciphertext Security

In this paper, we present the first efficient generic construction of Identity-Based Matchmaking Encryption (IB-ME) that achieves enhanced privacy against chosen-ciphertext attacks. Our approach can be instantiated using well-established cryptographic primitives under standard computational assumptions on pairings and lattices, ensuring security in classical and post-quantum settings. To evaluate practicality, we implement a lattice-based instantiation, demonstrating that our generic construction yields practical post-quantum IB-ME schemes that provide strong privacy guarantees even under chosen-ciphertext attacks.