Toward Fine-Grained Task Allocation With Bilateral Access Control for Intelligent Transportation Systems

Tong Wu, Xiaochen Ma, Chuan Zhang*, Ximeng Liu, Guomin Yang, Liehuang Zhu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In this article, we propose a secure fine-grained task allocation scheme with bilateral access control (FTA-BAC) for intelligent transportation systems. To enhance the security, we formulate bilateral access control in task allocation, by adopting the matchmaking encryption (ME) to encrypt the task requirements/interests for secure task matching. In this way, both task requesters and workers can specify their match policies simultaneously, without revealing their sensitive information (i.e., attributes and geographical location). To realize fine-grained task allocation, we use a linear integer secret sharing (LISS) scheme to represent task requirements/interests, supporting the AND/OR operation on match policies. To further improve the efficiency, we design a delegation mechanism to reduce the computation burden on resource-limited end devices, by diverting the high-frequency matching operations to edge nodes. Then, we prove the security of FTA-BAC under formally defined security model. Finally, we analyze the performance of FTA-BAC through theoretical analysis and experimental evaluation, demonstrating that FTA-BAC can provide practical task allocation for intelligent transportation systems compared with the state-of-the-art works.

Original languageEnglish
Pages (from-to)14814-14828
Number of pages15
JournalIEEE Internet of Things Journal
Volume11
Issue number8
DOIs
Publication statusPublished - 15 Apr 2024

Keywords

  • Bilateral access control
  • edge computing
  • linear integer secret sharing (LISS)
  • task allocation

Fingerprint

Dive into the research topics of 'Toward Fine-Grained Task Allocation With Bilateral Access Control for Intelligent Transportation Systems'. Together they form a unique fingerprint.

Cite this