EUVIMEDEUVIMED entdecken
Crossref

Exploring Dynamic Task Loading in SGX-Based Distributed Computing

Pengfei Wu, Jianting Ning, Wu Luo, Xinyi Huang, Debiao He

IEEE Transactions on Services Computing · 01.01.2023 · 16 (1) · 288-301

DOI: 10.1109/tsc.2021.3123511 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Services Computing, erschienen am 01.01.2023. Verfasst von Pengfei Wu und 4 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 38 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Science Foundation of Fujian Provincial Science and Technology Agency, Fujian Science and Technology Association.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Nowadays, data privacy is one of the most critical concerns in cloud computing, and many privacy-preserving distributed computing systems based on the trusted execution environment (e.g., Intel SGX) have been proposed to protect the user’s privacy during cloud-outsourced computation. However, these SGX-based solutions are vulnerable to some traffic analyses, and loading all tasks into the enclave introduces much overhead for frequent EPC-paging. In this article, we propose a T-SGX framework, which keeps the confidentiality of a distributed job and guarantees the system efficiency by allowing dynamically loading an enclave shared object for the task under processing. In T-SGX, all these objects are secretly shared and stored in a verifiably distributed share management system (SMS) outside the TCB. To mitigate the exposure of sensitive information, we present an efficient oblivious transfer (OT) protocol under the Decisional Diffie-Hellman (DDH) assumption for obliviously transmitting desired shares. Detailed security analysis demonstrates that the proposed T-SGX achieves the goal of secure distributed computing without privacy leakage to unauthorized parties. Finally, we benchmark the framework in six real-world applications, and the experimental results show that T-SGX significantly outperforms a state-of-the-art solution, with 11.9%-29.7% less overhead performing an SGX-based application.

Förderung

  • National Natural Science Foundation of China
  • Science Foundation of Fujian Provincial Science and Technology Agency
  • Fujian Science and Technology Association
  • Blockchain Core Technology Strategic Research Program of Ministry of Education of China
  • Wuhan Municipal Science and Technology

Zitieren

APA

Wu, P., Ning, J., Luo, W., Huang, X., & He, D. (2023). Exploring Dynamic Task Loading in SGX-Based Distributed Computing. IEEE Transactions on Services Computing, 16(1), 288-301. https://doi.org/10.1109/tsc.2021.3123511

Vancouver

Wu P, Ning J, Luo W, Huang X, He D. Exploring Dynamic Task Loading in SGX-Based Distributed Computing. IEEE Transactions on Services Computing. 2023;16(1):288-301. doi:10.1109/tsc.2021.3123511

BibTeX
@article{Wu2023,
  author = {Wu, Pengfei and Ning, Jianting and Luo, Wu and Huang, Xinyi and He, Debiao},
  title = {Exploring Dynamic Task Loading in SGX-Based Distributed Computing},
  journal = {IEEE Transactions on Services Computing},
  year = {2023},
  volume = {16},
  number = {1},
  pages = {288--301},
  doi = {10.1109/tsc.2021.3123511}
}
Kostenlos starten →