Abstract
In the past several decades, despite the continuous improvement of mobile devices, mobile applications requiring resources are still beyond its capacity to be completed on a single device. Due to high fairness and distribution efficiency, cloud auctions of mobile device allocation has recently attracted a lot of attention. However, most of them focus on efficiency but ignore the privacy-preserving issues in cloud auction process, which will have a significant impact on the authenticity of auctions. In this paper, we propose PAHTA, a privacy-preserving auction for heterogeneous task assignment in mobile device clouds by using Yao’s garbled circuits and homomorphic encryption. Meanwhile, we design a set of sub-protocols to support secure arithmetic operations, including secure division protocol and secure selection protocol. We further analyze the security and effectiveness of the system theoretically and prove that it can ensure sufficient and strong privacy protection under the semi-honest adversary model. Based on a large number of experiments, these results are consistent with the theoretical analysis.
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: INFOCOM 2017, pp. 1–9. IEEE, Atlanta (2017)
Kao, Y., Krishnamachari, B., Ra, M., Bai, F.: Hermes: latency optimal task assignment for resource-constrained mobile computing. In: INFOCOM 2015, pp. 1894–1902. IEEE, Hong Kong (2015)
Chen, Z., Huang, L., Li, L., Yang, W., Miao, H., Tian, M., Wang, F.: Ps-trust: provably secure solution for truthful double spectrum auctions. In: INFOCOM 2014, pp. 1249–1257. IEEE, Toronto (2014)
Chen, Z., Wei, X., Zhong, H., Cui, J., Xu, Y., Zhang, S.: Secure, efficient and practical double spectrum auction. In: IWQoS 2017, pp. 1–6. IEEE/ACM, Vilanova i la Geltru (2017)
Chen, Z., Chen, L., Huang, L., Zhong, H.: On privacy-preserving cloud auction. In: SRDS 2016, pp. 279–288. IEEE, Budapest (2016)
Wang, Q., Huang, J., Chen, Y., Tian, X., Zhang, Q.: Privacy-preserving and truthful double auction for heterogeneous spectrum. Trans. Networking (TON) 27(2), 848–861 (2019)
Wang, Q., Huang, J., Chen, Y., Wang, C., Xiao, F., Luo, X.: Prost: privacy-preserving and truthful online double auction for spectrum allocation. TIFS 14(2), 374–386 (2018)
Cheng, K., Wang, L., Shen, Y., Liu, Y., Wang, Y., Zheng, L.: A lightweight auction framework for spectrum allocation with strong security guarantees. In: INFOCOM 2020, pp. 1708–1717. IEEE, Toronto (2020)
Cheng, K., Shen, Y., Zhang, Y., Zhu, X., Wang, L., Zhong, H.: Towards efficient privacy-preserving auction mechanism for two-sided cloud markets. In: ICC, 2019, pp. 1–6. IEEE, Shanghai (2019)
Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: EC 1999, pp. 129–130. ACM, Denver Colorado (1999)
Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Robust, Privacy protecting and publicly verifiable sealed-bid auction. In: ICICS 2002, pp. 147–159. Springer (2002)
Suzuki, K., Yokoo, M.: Secure generalized vickrey auction using homomorphic encryption. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 239–249. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45126-6_17
Yokoo, M., Suzuki, K.: Secure generalized vickrey auction without third-party servers. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 132–146. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27809-2_17
Yao, C.-C.: How to generate and exchange secrets. In: SFCS 1986, pp. 162–167. IEEE, Toronto (1986)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT 1999, pp. 223–238. Springer (1999)
Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security 2011
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637–647 (1985)
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
Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 486–498. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70583-3_40
Lindell, Y., Pinkas, B.: A proof of security of Yao’s protocol for two-party computation. J. Cryptol. 22(2), 161–188 (2009)
Acknowledgment
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
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Jiang, X., Pei, X., Tian, D., Li, L. (2021). Privacy-Preserving Auction for Heterogeneous Task Assignment in Mobile Device Clouds. In: Liu, Z., Wu, F., Das, S.K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2021. Lecture Notes in Computer Science(), vol 12939. Springer, Cham. https://doi.org/10.1007/978-3-030-86137-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-86137-7_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86136-0
Online ISBN: 978-3-030-86137-7
eBook Packages: Computer ScienceComputer Science (R0)