Skip to main navigation Skip to search Skip to main content

Decentralized Multi-Authority Accurate Matchmaking Encryption Scheme for Mobile Social Networks

  • Jiayun Yan
  • , Jie Chen*
  • , Haifeng Qian
  • , Jianting Ning
  • , Debiao He
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Mobile social networks (MSNs) are integral to the digital era, but the current architectures raise fundamental challenges to user privacy and security. First, these systems rely on a trusted authority, which causes the single point of failure and raises concerns about data leakage. Second, there is a lack of cryptographic mechanisms to enforce bilateral access control, which ensures mutual consent communication by both senders and receivers. Therefore, it’s necessary to design a system to eliminate single-point trust and accurate consent-based matchmaking access control between users. To address these issues, we propose a decentralized multi-authority identity-based matchmaking encryption (DMA-IBME) scheme, including its formal syntax and security definitions. This primitive enables bilateral access control, which ensures both data privacy and user authenticity. Moreover, we formally prove the security of our scheme in the random oracle model under the standard bilinear Diffie-Hellman (BDH) assumption. Performance evaluation demonstrates the efficiency of our scheme. Compared to existing works, our construction reduces the setup time by approximately 50% and the encryption key generation time by 30%.

Original languageEnglish
Pages (from-to)4381-4392
Number of pages12
JournalIEEE Transactions on Mobile Computing
Volume25
Issue number3
DOIs
StatePublished - 2026

Keywords

  • Bilateral access control
  • decentralized
  • matchmaking encryption
  • mobile social networks
  • multi-authority

Fingerprint

Dive into the research topics of 'Decentralized Multi-Authority Accurate Matchmaking Encryption Scheme for Mobile Social Networks'. Together they form a unique fingerprint.

Cite this