Abstract
Due to high fairness and allocation efficiency, the task assignment problem of mobile applications via auctions has become a promising approach to motivate bidders to provide their mobile device resources effectively. However, most of existing works focus on the auction mechanism under the plaintexts, and ignore the problems caused by information leakage. In this paper, we study the problem of the privacy-preserving auction for task assignment in outsourced cloud environments without leaking any private information to anyone. Specifically, we use Yao’s garbled circuits and homomorphic encryption system as underlying tools. Along with several elaborately designed secure arithmetic subroutines, we propose a privacy-preserving and truthful auction framework for task assignment in outsourced cloud environments. Theoretically, we analyze the complexity of our scheme in detail and prove the security in the presence of semi-honest adversaries. Finally, we evaluate the performance and feasibility of our scheme through a large number of simulation experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wang, X., Chen, X. Wu, W.: Towards truthful auction mechanisms for task assignment in mobile device clouds. In: Proceedings of Conference on Computer Communications (INFOCOM), pp. 1–9. IEEE, Atlanta (2017)
Jin, A.-L., Song, W., Zhuang, W.: Auction-based resource allocation for sharing cloudlets in mobile cloud computing. Trans. Emerg. Top. Comput. 6(1), 1–12 (2015)
Wang, A.-L., et al.: Auction mechanisms toward efficient resource sharing for cloudlets in mobile cloud computing. Trans. Serv. Comput. 9(6), 1–14 (2015)
Shi, J., Yang, Z., Zhu, J.: An auction-based rescue task allocation approach for heterogeneous multi-robot system. Multimed. Tools App. 79, 14529–14538 (2018). https://doi.org/10.1007/s11042-018-7080-4
Chen, Z., et al.: On privacy-preserving cloud auction. In: Symposium on Reliable Distributed Systems, pp. 279–288. IEEE, Budapest (2016)
Cheng, K., et al.: Towards efficient privacy-preserving auction mechanism for two-sided cloud markets. In: ICC, pp. 1–6. IEEE (2019)
Jiang, X., Pei, X., Tian, D., Li, L.: Privacy-preserving auction for heterogeneous task assignment in mobile device clouds. In: Liu, Z., Wu, F., Das, S.K. (eds.) WASA 2021. LNCS, vol. 12939, pp. 345–358. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-86137-7_38
Chen, Z., et al.: PS-TRUST: provably secure solution for truthful double spectrum auctions. In: INFOCOM, pp. 1249–1257. IEEE, Toronto (2014)
Chen, Z., et al.: Secure, efficient and practical double spectrum auction. In: IWQoS, pp. 1–6. IEEE, Vilanova (2017)
Wang, J., et al.: A secure spectrum auction scheme without the trusted party based on the smart contract. Dig. Commun. Netw. 7(2), 223–234 (2021)
Wang, Q., et al.: Privacy-preserving and truthful double auction for heterogeneous spectrum. TON 27(2), 848–861 (2019)
Wang, Q., Huang, J., Chen, Y., et al.: Prost: Privacy-preserving and truthful online double auction for spectrum allocation. Trans. Inf. Forensics Secur. 14(2), 374–386 (2019)
Cheng, K., et al.: A lightweight auction framework for spectrum allocation with strong security guarantees. In: INFOCOM, pp. 1708–1717. IEEE, Toronto (2020)
Goldreich, O.: Foundations of Cryptography, vol. 2, Basic Applications. Cambridge University Press, Cambridge (2004)
Liu, A., et al.: Efficient secure similarity computation on encrypted trajectory data. In: ICDE, pp. 66–77. IEEE (2015)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48910-X_16
Yao, A.C.: How to generate and exchange secrets. In: FOCS, pp. 162–167 (1986)
Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145–161. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45146-4_9
Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 1–20. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10433-6_1
Cui, N., et al.: SVKNN: efficient secure and verifiable k-nearest neighbor query on the cloud platform. In: ICDE, pp. 253–264. IEEE (2020)
Huang, Y., et al.: Faster secure two-party computation using garbled circuits. In: USENIX Security, San Francisco (2011)
Lindell, Y., Pinkas, B.: A proof of security of Yao’s protocol for two-party computation. J. Cryptol. 22(2), 161–188 (2009)
Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., et al. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 486–498. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70583-3_40
Acknowledgement
This work was partially supported by Natural Science Foundation of China (Grant No. 61602400) and Jiangsu Provincial Department of Education (Grant NO. 16KJB520043).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Jiang, X., Li, L. (2022). Privacy-Preserving and Truthful Auction for Task Assignment in Outsourced Cloud Environments. In: Wang, L., Segal, M., Chen, J., Qiu, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2022. Lecture Notes in Computer Science, vol 13471. Springer, Cham. https://doi.org/10.1007/978-3-031-19208-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-031-19208-1_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19207-4
Online ISBN: 978-3-031-19208-1
eBook Packages: Computer ScienceComputer Science (R0)