{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:15:11Z","timestamp":1776784511162,"version":"3.51.2"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031192074","type":"print"},{"value":"9783031192081","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19208-1_24","type":"book-chapter","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:03:45Z","timestamp":1668643425000},"page":"283-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving and\u00a0Truthful Auction for\u00a0Task Assignment in\u00a0Outsourced Cloud Environments"],"prefix":"10.1007","author":[{"given":"Xufeng","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Lu","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"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\u20139. IEEE, Atlanta (2017)","DOI":"10.1109\/INFOCOM.2017.8057198"},{"issue":"1","key":"24_CR2","first-page":"1","volume":"6","author":"A-L Jin","year":"2015","unstructured":"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\u201312 (2015)","journal-title":"Trans. Emerg. Top. Comput."},{"issue":"6","key":"24_CR3","first-page":"1","volume":"9","author":"A-L Wang","year":"2015","unstructured":"Wang, A.-L., et al.: Auction mechanisms toward efficient resource sharing for cloudlets in mobile cloud computing. Trans. Serv. Comput. 9(6), 1\u201314 (2015)","journal-title":"Trans. Serv. Comput."},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Shi, J., Yang, Z., Zhu, J.: An auction-based rescue task allocation approach for heterogeneous multi-robot system. Multimed. Tools App. 79, 14529\u201314538 (2018). https:\/\/doi.org\/10.1007\/s11042-018-7080-4","DOI":"10.1007\/s11042-018-7080-4"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Z., et al.: On privacy-preserving cloud auction. In: Symposium on Reliable Distributed Systems, pp. 279\u2013288. IEEE, Budapest (2016)","DOI":"10.1109\/SRDS.2016.045"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, K., et al.: Towards efficient privacy-preserving auction mechanism for two-sided cloud markets. In: ICC, pp. 1\u20136. IEEE (2019)","DOI":"10.1109\/ICC.2019.8761693"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-030-86137-7_38","volume-title":"Wireless Algorithms, Systems, and Applications","author":"X Jiang","year":"2021","unstructured":"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\u2013358. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86137-7_38"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Z., et al.: PS-TRUST: provably secure solution for truthful double spectrum auctions. In: INFOCOM, pp. 1249\u20131257. IEEE, Toronto (2014)","DOI":"10.1109\/INFOCOM.2014.6848057"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., et al.: Secure, efficient and practical double spectrum auction. In: IWQoS, pp. 1\u20136. IEEE, Vilanova (2017)","DOI":"10.1109\/IWQoS.2017.7969153"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.dcan.2020.06.004","volume":"7","author":"J Wang","year":"2021","unstructured":"Wang, J., et al.: A secure spectrum auction scheme without the trusted party based on the smart contract. Dig. Commun. Netw. 7(2), 223\u2013234 (2021)","journal-title":"Dig. Commun. Netw."},{"issue":"2","key":"24_CR11","first-page":"848","volume":"27","author":"Q Wang","year":"2019","unstructured":"Wang, Q., et al.: Privacy-preserving and truthful double auction for heterogeneous spectrum. TON 27(2), 848\u2013861 (2019)","journal-title":"TON"},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TIFS.2018.2850330","volume":"14","author":"Q Wang","year":"2019","unstructured":"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\u2013386 (2019)","journal-title":"Trans. Inf. Forensics Secur."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Cheng, K., et al.: A lightweight auction framework for spectrum allocation with strong security guarantees. In: INFOCOM, pp. 1708\u20131717. IEEE, Toronto (2020)","DOI":"10.1109\/INFOCOM41043.2020.9155279"},{"key":"24_CR14","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 2, Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Liu, A., et al.: Efficient secure similarity computation on encrypted trajectory data. In: ICDE, pp. 66\u201377. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113273"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10433-6_1","volume-title":"Cryptology and Network Security","author":"V Kolesnikov","year":"2009","unstructured":"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\u201320. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10433-6_1"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Cui, N., et al.: SVKNN: efficient secure and verifiable k-nearest neighbor query on the cloud platform. In: ICDE, pp. 253\u2013264. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00029"},{"key":"24_CR21","unstructured":"Huang, Y., et al.: Faster secure two-party computation using garbled circuits. In: USENIX Security, San Francisco (2011)"},{"issue":"2","key":"24_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V Kolesnikov","year":"2008","unstructured":"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\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19208-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:32:40Z","timestamp":1668645160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19208-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031192074","9783031192081"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19208-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"265","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}