{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:13:27Z","timestamp":1743038007922,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030861360"},{"type":"electronic","value":"9783030861377"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86137-7_38","type":"book-chapter","created":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T12:12:16Z","timestamp":1631103136000},"page":"345-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving Auction for Heterogeneous Task Assignment in Mobile Device Clouds"],"prefix":"10.1007","author":[{"given":"Xufeng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuhao","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawei","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Wang, X., Chen, X., Wu, W.: Towards truthful auction mechanisms for task assignment in mobile device clouds. In: INFOCOM 2017, pp. 1\u20139. IEEE, Atlanta (2017)","DOI":"10.1109\/INFOCOM.2017.8057198"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Kao, Y., Krishnamachari, B., Ra, M., Bai, F.: Hermes: latency optimal task assignment for resource-constrained mobile computing. In: INFOCOM 2015, pp. 1894\u20131902. IEEE, Hong Kong (2015)","DOI":"10.1109\/INFOCOM.2015.7218572"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"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\u20131257. IEEE, Toronto (2014)","DOI":"10.1109\/INFOCOM.2014.6848057"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Z., Wei, X., Zhong, H., Cui, J., Xu, Y., Zhang, S.: Secure, efficient and practical double spectrum auction. In: IWQoS 2017, pp. 1\u20136. IEEE\/ACM, Vilanova i la Geltru (2017)","DOI":"10.1109\/IWQoS.2017.7969153"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Z., Chen, L., Huang, L., Zhong, H.: On privacy-preserving cloud auction. In: SRDS 2016, pp. 279\u2013288. IEEE, Budapest (2016)","DOI":"10.1109\/SRDS.2016.045"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013861 (2019)","DOI":"10.1109\/TNET.2019.2903879"},{"issue":"2","key":"38_CR7","first-page":"374","volume":"14","author":"Q Wang","year":"2018","unstructured":"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\u2013386 (2018)","journal-title":"TIFS"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"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\u20131717. IEEE, Toronto (2020)","DOI":"10.1109\/INFOCOM41043.2020.9155279"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"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\u20136. IEEE, Shanghai (2019)","DOI":"10.1109\/ICC.2019.8761693"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: EC 1999, pp. 129\u2013130. ACM, Denver Colorado (1999)","DOI":"10.1145\/336992.337028"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Robust, Privacy protecting and publicly verifiable sealed-bid auction. In: ICICS 2002, pp. 147\u2013159. Springer (2002)","DOI":"10.1007\/3-540-36159-6_13"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-45126-6_17","volume-title":"Financial Cryptography","author":"K Suzuki","year":"2003","unstructured":"Suzuki, K., Yokoo, M.: Secure generalized vickrey auction using homomorphic encryption. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 239\u2013249. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45126-6_17"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-27809-2_17","volume-title":"Financial Cryptography","author":"M Yokoo","year":"2004","unstructured":"Yokoo, M., Suzuki, K.: Secure generalized vickrey auction without third-party servers. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 132\u2013146. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27809-2_17"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Yao, C.-C.: How to generate and exchange secrets. In: SFCS 1986, pp. 162\u2013167. IEEE, Toronto (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT 1999, pp. 223\u2013238. Springer (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security 2011","DOI":"10.1007\/978-3-642-25560-1_2"},{"issue":"6","key":"38_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"38_CR18","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":"38_CR19","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., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 486\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40"},{"issue":"2","key":"38_CR20","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."}],"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-030-86137-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T16:10:26Z","timestamp":1639671026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86137-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030861360","9783030861377"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86137-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","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":"Nanjing","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"315","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":"103","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":"57","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":"33% - 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":"3","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":"6","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)"}}]}}