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

ACM SIGSAC Conference on Computer and Communications Security (CCS)

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

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

Published Dec 2, 2024• 1 citation
Publisher

Abstract

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.

DOI
10.1145/3658644.3691397

Related papers

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

Jheng-Jia Huang, Guan Yu Chen

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.

IEEE Transactions on Reliability•Jan 1, 2026•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

Generic Construction of Forward-Secure Revocable Identity-Based Signature and Lattice-Based Instantiations

Yan He, Baodong Qin, Wen Gao +2 more

Forward-secure revocation is a powerful cryptographic technique to alleviate key exposure attacks on identity-based cryptosystems. In recent years, quantum computers have made some breakthroughs, so in the foreseeable future, existing cryptographic systems will be subject to quantum attacks. However, known forward-secure revocable identity-based signature (FS-RIBS) schemes were designed over bilinear pairing groups and may suffer from quantum computing attacks. To address this issue, this paper proposes a generic method to construct FS-RIBS schemes, taking (hierarchical) IBS schemes as a basic component. By instantiating it with some post-quantum (hierarchical) IBS schemes, e.g., lattice-based (hierarchical) IBS, we immediately obtain six FS-RIBS schemes under the hardness of the small integer solution problem, which is secure against quantum computing attacks.

Security and Communication Networks•Nov 16, 2022•1 citation

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

Revocable Identity-Based Authenticated Key Exchange: Generic and Direct Constructions

Kazuma Wariki, Kohei Nakagawa, Atsushi Fujioka +4 more

We investigate the design of scalable revocable identity-based authenticated key exchange (RIB-AKE) protocols secure against adaptive adversaries. Our work yields two main positive results. First, we present a generic construction that combines a revocable identity-based key encapsulation mechanism (RIB-KEM) with a standard KEM, improving scalability compared with prior hierarchical approaches. Second, we introduce a direct construction based on the Fiore-Gennaro pairing-free IB-AKE protocol, achieving more than a fifty-fold performance improvement over existing RIB-AKE schemes and enabling straightforward deployment using standard elliptic-curve libraries. The generic construction incurs certain degradation in provable security, whereas the direct construction achieves a tight security bound with respect to the number of identities. In other words, while the first result provides a theoretical guarantee that a generic construction is feasible, the second demonstrates that a concrete scheme can simultaneously improve security and efficiency relative to the generic approach.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2026•0 citations
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.
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.
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.
Forward-secure revocation is a powerful cryptographic technique to alleviate key exposure attacks on identity-based cryptosystems. In recent years, quantum computers have made some breakthroughs, so in the foreseeable future, existing cryptographic systems will be subject to quantum attacks. However, known forward-secure revocable identity-based signature (FS-RIBS) schemes were designed over bilinear pairing groups and may suffer from quantum computing attacks. To address this issue, this paper proposes a generic method to construct FS-RIBS schemes, taking (hierarchical) IBS schemes as a basic component. By instantiating it with some post-quantum (hierarchical) IBS schemes, e.g., lattice-based (hierarchical) IBS, we immediately obtain six FS-RIBS schemes under the hardness of the small integer solution problem, which is secure against quantum computing attacks.
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.
We investigate the design of scalable revocable identity-based authenticated key exchange (RIB-AKE) protocols secure against adaptive adversaries. Our work yields two main positive results. First, we present a generic construction that combines a revocable identity-based key encapsulation mechanism (RIB-KEM) with a standard KEM, improving scalability compared with prior hierarchical approaches. Second, we introduce a direct construction based on the Fiore-Gennaro pairing-free IB-AKE protocol, achieving more than a fifty-fold performance improvement over existing RIB-AKE schemes and enabling straightforward deployment using standard elliptic-curve libraries. The generic construction incurs certain degradation in provable security, whereas the direct construction achieves a tight security bound with respect to the number of identities. In other words, while the first result provides a theoretical guarantee that a generic construction is feasible, the second demonstrates that a concrete scheme can simultaneously improve security and efficiency relative to the generic approach.