Privacy-preserving double auction for resource allocation in satellite MEC
by Chuanling Chen; Lu Li
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 45, No. 3, 2024

Abstract: Mobile edge computing (MEC) can deploy applications at the edge of the network in real-time and adapt to diverse service scenarios. In recent years, resource allocation auction in MEC has received widespread attention. Most studies only focus on improving computational efficiency and social welfare, but they neglect the potential security and privacy breaches in resource allocation auctions, which may have a great impact on the authenticity of auction results. In this paper, by combining garbled circuit and homomorphic encryption, we propose a privacy-preserving double auction for resource allocation (PDARA) in satellite MEC, which uses dynamic programming and monotone FPTAS (MFPTAS) algorithm for resource allocation. We propose secure subroutines secure division and oblivious selection, which can serve as building blocks for other applications. Then, we theoretically analysed the complexity and effectiveness of the system and demonstrated that our system is sufficiently secure in a semi-honest adversary model. Finally, evaluate the performance of our system through a quantity of simulation experiments.

Online publication date: Thu, 21-Mar-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com