Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Reliability

Quantum-Resistant Revocable Identity-Based Matchmaking Encryption With Revocation-Optimized Design

Jheng-Jia Huang, Guan Yu Chen

Published Jan 1, 2026• 1 citation
Publisher

Abstract

Scholars are currently exploring Identity-Based Matchmaking Encryption (IB-ME), which allows senders and receivers to specify identities for decryption, protecting sensitive data in ciphertexts. Our work advances Revocable Identity-Based Matchmaking Encryption (RIB-ME) by adding revocation of decryption rights from unauthorized users. However, most RIB-ME systems rely on the Diffie-Hellman assumption, making them vulnerable to quantum computing threats. Current security models also fail to fully capture adversaries' evolving capabilities, risking unexpected exploits. To address this, we propose a flexible RIB-ME framework, inspired by Wang et al., using a two-tier revocable hierarchical identity-based encryption (RHIBE) approach integrated with post-quantum cryptography. This creates the first quantum-resistant RIB-ME system. We also introduce a detailed security model defining adversaries' strengths and attack patterns over time, enhancing the system's robustness and reliability across various practical scenarios.

DOI
10.1109/tr.2026.3682448

Related papers

Poster: Post-Quantum Identity-Based Matching Encryption with Revocable Decryption Key

Jheng-Jia Huang, Guan Yu Chen, Nai‐Wei Lo

In recent years, scholars have developed Identity-Based Matching Encryption (IB-ME), which enables both the sender and the receiver to specify identities, ensuring ciphertext confidentiality only when these identities match. Building on this concept, our work introduces Revocable Identity-Based Matching Encryption (RIB-ME), which incorporates a revocable mechanism to withdraw decryption rights from unauthorized users. Current RIB-ME schemes rely on a variant of the Diffie-Hellman assumption, rendering it susceptible to quantum computing attacks. To address this vulnerability, we propose a generic construction of RIB-ME inspired by Wang et al. Our approach employs two-level Revocable Hierarchical Identity-Based Encryption (RHIBE) and Identity-Based Signature (IBS) and is compatible with post-quantum encryption schemes. This enables the development of a generic construction of RIB-ME and the creation of the first post-quantum RIB-ME through the use of post-quantum constructions.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Dec 2, 2024•1 citation

Revocable identity‐based matchmaking encryption in the standard model

Zhe Jiang, Xiwen Wang, Kai Zhang +3 more

Abstract Identity‐based Matchmaking Encryption (IB‐ME) is an extension notion of matchmaking encryption (CRYPTO 2019), where a sender and a receiver can specify an access policy for the other party. In IB‐ME, data encryption is performed by not only a receiver identity but also a sender's encryption key. Nevertheless, previous IB‐ME schemes have not considered the problem of efficient revocation . Hence, the authors introduce a new notion of revocable IB‐ME (RIB‐ME) and formalise the syntax and security model of RIB‐ME. In particular, the authors give an effective and simple construction of RIB‐ME in the standard model, whose security is reduced to the hardness of decisional bilinear Diffie—Hellman problem and computational Diffie—Hellman problem. In addition, the authors show two extensions of our RIB‐ME scheme to consider chosen‐ciphertext security and forward privacy.

IET Information Security•May 9, 2023•22 citations

Post-Quantum Secure Identity-Based Matchmaking Encryption

Huige Wang, Kefei Chen, Qi Xie +1 more

Matchmaking encryption constructed in the identity-based encryption setting, named identity-based matchmaking encryption (IB-ME), requires both sender and receiver to specify target identity simultaneously for each other for message decryption. The IB-ME schemes can not only ensure the privacy of the sender and the message but also provide authentication for the data source. In order to resist quantum-attacks, we put forward a post-quantum secure IB-ME scheme. Compared with Ateniese et al.'s scheme and Francati et al.'s scheme, our approach eliminates the use of functional encryption, predicate encryption and signature scheme, and only uses a more simple preimage sampling function and an IBE scheme in the way of non-black-box. Compared with post-quantum secure IB-MEs proposed currently, our scheme is the first non-black-box construction based on standard lattice assumptions such as LWE and ISIS.

IEEE Transactions on Dependable and Secure Computing•Jun 25, 2024•16 citations

Hierarchical Identity-Based Matchmaking Encryption

Sohto Chiku, Keisuke Hara, Junji Shikata

Identity-based matchmaking encryption (IB-ME) is an advanced encryption scheme that allows both the sender and the receiver to specify their respective identities. We study the notion of hierarchical IB-ME (HIB-ME), which augments IB-ME with delegation capabilities. Specifically, we first formalize HIB-ME and construct it based on hierarchical identity-based encryption and hierarchical identity-based signature. Moreover, as applications of the HIB-ME, we show two chosen ciphertext secure (H)IB-ME constructions for different security levels.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Mar 12, 2026•0 citations

Invisible Barrier: Precise Matchmaking Encryption With Keyword Search From Lattices

X D Gao, Hua Dai, Huaqun Wang +3 more

Modern cloud-based data marketplaces require secure mechanisms that enable sensitive data sharing and retrieval among mutually distrustful parties under strict confidentiality, accountability, and regulatory constraints, while relying on semi-trusted cloud infrastructures. Existing cryptographic solutions address only limited aspects of these requirements and fail to jointly support bilateral access control, efficient keyword-based retrieval, and privacy protection against information leakage in unsuccessful access attempts, particularly in the presence of post-quantum adversaries. To bridge these gaps, we propose a quantum-resistant matchmaking encryption scheme with keyword search (QKS-ME), which supports flexible keyword-based ciphertext filtering and enables on-demand decryption under bilateral access control, thereby reducing communication overhead while ensuring data authenticity. Unsuccessful searches or decryption attempts reveal no information about the plaintext, keywords, or underlying access structures to either the cloud server or unauthorized receivers. We formally prove that QKS-ME achieves indistinguishability under chosen-plaintext attacks and existential unforgeability under chosen-message attacks based on standard lattice assumptions. Experimental evaluations demonstrate that QKS-ME is computationally efficient and suitable for practical data marketplace environments.

IEEE Transactions on Dependable and Secure Computing•Jul 21, 2026•0 citations

Post-Quantum Secure Lightweight Revocable IBE with Decryption Key Exposure Resistance

Dandan Zhang, Hongwei Ju, Zixuan Yan +2 more

Revocable Identity-Based Encryption (RIBE) can dynamically revoke users whose secret keys have been compromised, ensuring a system's backward security. An RIBE scheme with decryption key exposure resistance (DKER) guarantees the confidentiality of ciphertext during any time period where the decryption key remains undisclosed. Existing RIBE schemes with DKER generate O(rlog(N/r)) ciphertexts for each plaintext message. Redundant ciphertexts impose significant computational burdens on users and substantial communication overhead on the system. To reduce high computation and communication overhead in existing schemes, this paper proposes a dual-key combination trapdoor generation method. Based on the proposed method, an indirect RIBE scheme with DKER is constructed, reducing ciphertext redundancy and obtaining computation and communication efficiency. Firstly, this paper proposes a dual-key combination trapdoor generation mechanism. By constructing an Inhomogeneous Small Integer Solution (ISIS) instance, the Key Generation Center (KGC) generates and distributes short bases to users as their identity keys. Subsequently, based on the constructed ISIS instance, a new inverse ISIS instance is derived. Furthermore, during each time period, KGC generates short bases for all non-revoked users as their time keys. By linearly combining their identity key with the corresponding time key, every non-revoked user can derive a re-randomized decryption key, achieving controlled key derivation. Secondly, based on the proposed method, a Post-Quantum Secure, Lightweight RIBE scheme with DKER (PQS-LRIBE-DKER) is constructed. For every non-revoked user, their identity key and time key serve as their own user secret key and key update, respectively. Controllable key derivation enables indirect revocation of the scheme. By adopting an indirect revocation, the PQS-LRIBE-DKER scheme achieves a single ciphertext per plaintext message, significantly reducing the sender's computational load and the system's communication overhead. Finally, under the hardness assumptions of the Learning with Errors (LWE) and ISIS problems, we prove that the proposed scheme achieves selective identity security in the standard model.

Entropy•Nov 14, 2025•0 citations
Scholars are currently exploring Identity-Based Matchmaking Encryption (IB-ME), which allows senders and receivers to specify identities for decryption, protecting sensitive data in ciphertexts. Our work advances Revocable Identity-Based Matchmaking Encryption (RIB-ME) by adding revocation of decryption rights from unauthorized users. However, most RIB-ME systems rely on the Diffie-Hellman assumption, making them vulnerable to quantum computing threats. Current security models also fail to fully capture adversaries' evolving capabilities, risking unexpected exploits. To address this, we propose a flexible RIB-ME framework, inspired by Wang et al., using a two-tier revocable hierarchical identity-based encryption (RHIBE) approach integrated with post-quantum cryptography. This creates the first quantum-resistant RIB-ME system. We also introduce a detailed security model defining adversaries' strengths and attack patterns over time, enhancing the system's robustness and reliability across various practical scenarios.
In recent years, scholars have developed Identity-Based Matching Encryption (IB-ME), which enables both the sender and the receiver to specify identities, ensuring ciphertext confidentiality only when these identities match. Building on this concept, our work introduces Revocable Identity-Based Matching Encryption (RIB-ME), which incorporates a revocable mechanism to withdraw decryption rights from unauthorized users. Current RIB-ME schemes rely on a variant of the Diffie-Hellman assumption, rendering it susceptible to quantum computing attacks. To address this vulnerability, we propose a generic construction of RIB-ME inspired by Wang et al. Our approach employs two-level Revocable Hierarchical Identity-Based Encryption (RHIBE) and Identity-Based Signature (IBS) and is compatible with post-quantum encryption schemes. This enables the development of a generic construction of RIB-ME and the creation of the first post-quantum RIB-ME through the use of post-quantum constructions.
Abstract Identity‐based Matchmaking Encryption (IB‐ME) is an extension notion of matchmaking encryption (CRYPTO 2019), where a sender and a receiver can specify an access policy for the other party. In IB‐ME, data encryption is performed by not only a receiver identity but also a sender's encryption key. Nevertheless, previous IB‐ME schemes have not considered the problem of efficient revocation . Hence, the authors introduce a new notion of revocable IB‐ME (RIB‐ME) and formalise the syntax and security model of RIB‐ME. In particular, the authors give an effective and simple construction of RIB‐ME in the standard model, whose security is reduced to the hardness of decisional bilinear Diffie—Hellman problem and computational Diffie—Hellman problem. In addition, the authors show two extensions of our RIB‐ME scheme to consider chosen‐ciphertext security and forward privacy.
Matchmaking encryption constructed in the identity-based encryption setting, named identity-based matchmaking encryption (IB-ME), requires both sender and receiver to specify target identity simultaneously for each other for message decryption. The IB-ME schemes can not only ensure the privacy of the sender and the message but also provide authentication for the data source. In order to resist quantum-attacks, we put forward a post-quantum secure IB-ME scheme. Compared with Ateniese et al.'s scheme and Francati et al.'s scheme, our approach eliminates the use of functional encryption, predicate encryption and signature scheme, and only uses a more simple preimage sampling function and an IBE scheme in the way of non-black-box. Compared with post-quantum secure IB-MEs proposed currently, our scheme is the first non-black-box construction based on standard lattice assumptions such as LWE and ISIS.
Identity-based matchmaking encryption (IB-ME) is an advanced encryption scheme that allows both the sender and the receiver to specify their respective identities. We study the notion of hierarchical IB-ME (HIB-ME), which augments IB-ME with delegation capabilities. Specifically, we first formalize HIB-ME and construct it based on hierarchical identity-based encryption and hierarchical identity-based signature. Moreover, as applications of the HIB-ME, we show two chosen ciphertext secure (H)IB-ME constructions for different security levels.
Modern cloud-based data marketplaces require secure mechanisms that enable sensitive data sharing and retrieval among mutually distrustful parties under strict confidentiality, accountability, and regulatory constraints, while relying on semi-trusted cloud infrastructures. Existing cryptographic solutions address only limited aspects of these requirements and fail to jointly support bilateral access control, efficient keyword-based retrieval, and privacy protection against information leakage in unsuccessful access attempts, particularly in the presence of post-quantum adversaries. To bridge these gaps, we propose a quantum-resistant matchmaking encryption scheme with keyword search (QKS-ME), which supports flexible keyword-based ciphertext filtering and enables on-demand decryption under bilateral access control, thereby reducing communication overhead while ensuring data authenticity. Unsuccessful searches or decryption attempts reveal no information about the plaintext, keywords, or underlying access structures to either the cloud server or unauthorized receivers. We formally prove that QKS-ME achieves indistinguishability under chosen-plaintext attacks and existential unforgeability under chosen-message attacks based on standard lattice assumptions. Experimental evaluations demonstrate that QKS-ME is computationally efficient and suitable for practical data marketplace environments.
Revocable Identity-Based Encryption (RIBE) can dynamically revoke users whose secret keys have been compromised, ensuring a system's backward security. An RIBE scheme with decryption key exposure resistance (DKER) guarantees the confidentiality of ciphertext during any time period where the decryption key remains undisclosed. Existing RIBE schemes with DKER generate O(rlog(N/r)) ciphertexts for each plaintext message. Redundant ciphertexts impose significant computational burdens on users and substantial communication overhead on the system. To reduce high computation and communication overhead in existing schemes, this paper proposes a dual-key combination trapdoor generation method. Based on the proposed method, an indirect RIBE scheme with DKER is constructed, reducing ciphertext redundancy and obtaining computation and communication efficiency. Firstly, this paper proposes a dual-key combination trapdoor generation mechanism. By constructing an Inhomogeneous Small Integer Solution (ISIS) instance, the Key Generation Center (KGC) generates and distributes short bases to users as their identity keys. Subsequently, based on the constructed ISIS instance, a new inverse ISIS instance is derived. Furthermore, during each time period, KGC generates short bases for all non-revoked users as their time keys. By linearly combining their identity key with the corresponding time key, every non-revoked user can derive a re-randomized decryption key, achieving controlled key derivation. Secondly, based on the proposed method, a Post-Quantum Secure, Lightweight RIBE scheme with DKER (PQS-LRIBE-DKER) is constructed. For every non-revoked user, their identity key and time key serve as their own user secret key and key update, respectively. Controllable key derivation enables indirect revocation of the scheme. By adopting an indirect revocation, the PQS-LRIBE-DKER scheme achieves a single ciphertext per plaintext message, significantly reducing the sender's computational load and the system's communication overhead. Finally, under the hardness assumptions of the Learning with Errors (LWE) and ISIS problems, we prove that the proposed scheme achieves selective identity security in the standard model.