Paper 2022/085

Cross-Domain Identity-based Matchmaking Encryption

Axin Wu, Jian Weng, Weiqi Luo, Anjia Yang, Jia-Nan Liu, and Zike Jiang


Recently, Ateniese et al. (CRYPTO 2019) proposed a new cryptographic primitive called matchmaking encryption (ME), which provides fine-grained access control over encrypted data by allowing both the sender and receiver to specify access control policies. The encrypted message can be decrypted correctly if and only if the attributes of the sender and receiver simultaneously meet each other's specified policies. In current ME, when users from different organizations need secret communication, they need to be managed by a single-authority center. However, it is more reasonable if users from different domains obtain secret keys from their own authority centers, respectively. Inspired by this, we extend ME to cross-domain scenarios. Specifically, we introduce the concept of the cross-domain ME and instantiate it in the identity-based setting (i.e., cross-domain identity-based ME). Then, we first formulate and design a cross-domain identity-based ME (IB-ME) scheme and prove its privacy and authenticity in the random oracle model. Further, we extend the cross-domain IB-ME to the multi-receiver setting and give the formal definition, concrete scheme and security proof. Finally, we analyze and implement the schemes, which confirms the efficiency feasibility.

Available format(s)
Public-key cryptography
Publication info
Preprint. Minor revision.
Contact author(s)
waxinsec @ 163 com
2022-01-25: revised
2022-01-25: received
See all versions
Short URL
Creative Commons Attribution


      author = {Axin Wu and Jian Weng and Weiqi Luo and Anjia Yang and Jia-Nan Liu and Zike Jiang},
      title = {Cross-Domain Identity-based Matchmaking Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2022/085},
      year = {2022},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.