{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:59Z","timestamp":1750306679499,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T00:00:00Z","timestamp":1407715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,11]]},"DOI":"10.1145\/2632951.2632974","type":"proceedings-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T20:13:39Z","timestamp":1406924019000},"page":"185-194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Differentially private spectrum auction with approximate revenue maximization"],"prefix":"10.1145","author":[{"given":"Ruihao","family":"Zhu","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, Ann Arbor, USA"}]},{"given":"Zhijing","family":"Li","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Fan","family":"Wu","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Kang","family":"Shin","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, Ann Arbor, USA"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2014,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.05.001"},{"key":"e_1_3_2_1_2_1","first-page":"02","article-title":"Spectrum policy task force report","author":"Spectrum Policy Task Force","year":"2002","unstructured":"Spectrum Policy Task Force , \" Spectrum policy task force report ,\" Federal Communications Commission ET docket , 02 - 135 , 2002 . Spectrum Policy Task Force, \"Spectrum policy task force report,\" Federal Communications Commission ET docket, 02-135, 2002.","journal-title":"Federal Communications Commission ET docket"},{"key":"e_1_3_2_1_3_1","unstructured":"Spectrum Bridge Inc. http:\/\/www.spectrumbridge.com  Spectrum Bridge Inc. http:\/\/www.spectrumbridge.com"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2007.358854"},{"key":"e_1_3_2_1_5_1","volume-title":"TRUST: A general framework for truthful double spectrum auctions,\" in INFOCOM'09","author":"Zhou X.","year":"2009","unstructured":"X. Zhou and H. Zheng , \" TRUST: A general framework for truthful double spectrum auctions,\" in INFOCOM'09 , 2009 . X. Zhou and H. Zheng, \"TRUST: A general framework for truthful double spectrum auctions,\" in INFOCOM'09, 2009."},{"key":"e_1_3_2_1_6_1","volume-title":"SMALL: A strategy-proof mechanism for radio spectrum allocation,\" in INFOCOM'11","author":"Wu F.","year":"2011","unstructured":"F. Wu and N. Vaidya , \" SMALL: A strategy-proof mechanism for radio spectrum allocation,\" in INFOCOM'11 , 2011 . F. Wu and N. Vaidya, \"SMALL: A strategy-proof mechanism for radio spectrum allocation,\" in INFOCOM'11, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2005.1391490"},{"key":"e_1_3_2_1_8_1","volume-title":"A general framework for wireless spectrum auctions,\" in DySPAN'07","author":"Gandhi S.","year":"2007","unstructured":"S. Gandhi , C. Buragohain , L. Cao , H. Zheng , and S. Suri , \" A general framework for wireless spectrum auctions,\" in DySPAN'07 , 2007 . S. Gandhi, C. Buragohain, L. Cao, H. Zheng, and S. Suri, \"A general framework for wireless spectrum auctions,\" in DySPAN'07, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2007758"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530751"},{"key":"e_1_3_2_1_11_1","volume-title":"Truthful spectrum auctions with approximate revenue,\" in INFOCOM'11","author":"Al-Ayyoub M.","year":"2011","unstructured":"M. Al-Ayyoub and H. Gupta , \" Truthful spectrum auctions with approximate revenue,\" in INFOCOM'11 , 2011 . M. Al-Ayyoub and H. Gupta, \"Truthful spectrum auctions with approximate revenue,\" in INFOCOM'11, 2011."},{"key":"e_1_3_2_1_12_1","volume-title":"Near-optimal dynamic spectrum allocation in cellular networks,\" in DySPAN'08","author":"Subramanian A P.","year":"2008","unstructured":"A P. Subramanian , M. Al-Ayyoub , H. Gupta , \" Near-optimal dynamic spectrum allocation in cellular networks,\" in DySPAN'08 , 2008 . A P. Subramanian, M. Al-Ayyoub, H. Gupta, et al. \"Near-optimal dynamic spectrum allocation in cellular networks,\" in DySPAN'08, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_14_1","volume-title":"SPRING: A strategy-proof and privacy preserving spectrum auction mechanism,\" in INFOCOM'13","author":"Huang Q.","year":"2013","unstructured":"Q. Huang , Y. Tao , and F. Wu , \" SPRING: A strategy-proof and privacy preserving spectrum auction mechanism,\" in INFOCOM'13 , 2013 . Q. Huang, Y. Tao, and F. Wu, \"SPRING: A strategy-proof and privacy preserving spectrum auction mechanism,\" in INFOCOM'13, 2013."},{"key":"e_1_3_2_1_15_1","volume-title":"Mix and match: Secure function evaluation via ciphertexts,\" in ASIACRYPT'00","author":"Jakobsson M.","year":"2000","unstructured":"M. Jakobsson and A. Juels , \" Mix and match: Secure function evaluation via ciphertexts,\" in ASIACRYPT'00 , 2000 . M. Jakobsson and A. Juels, \"Mix and match: Secure function evaluation via ciphertexts,\" in ASIACRYPT'00, 2000."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"K. Sako \"An auction protocol which hides bids of losers \" in PKC'00 2000.   K. Sako \"An auction protocol which hides bids of losers \" in PKC'00 2000.","DOI":"10.1007\/978-3-540-46588-1_28"},{"key":"e_1_3_2_1_17_1","volume-title":"Robust, privacy protecting and publicly verifiable sealed-bid auction,\" in ICICS'02","author":"Peng K.","year":"2002","unstructured":"K. Peng , C. Boyd , E. Dawson , and K. Viswanathan , \" Robust, privacy protecting and publicly verifiable sealed-bid auction,\" in ICICS'02 , 2002 . K. Peng, C. Boyd, E. Dawson, and K. Viswanathan, \"Robust, privacy protecting and publicly verifiable sealed-bid auction,\" in ICICS'02, 2002."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2007.03.029"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186810.1186813"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/570810.570812"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.41"},{"key":"e_1_3_2_1_23_1","volume-title":"Differentially private combinatorial optimization,\" in SODA'10","author":"Gupta A.","year":"2010","unstructured":"A. Gupta , K. Ligett , F. McSherry , A. Roth and K. Talwar . \" Differentially private combinatorial optimization,\" in SODA'10 , 2010 . A. Gupta, K. Ligett, F. McSherry, A. Roth and K. Talwar. \"Differentially private combinatorial optimization,\" in SODA'10, 2010."},{"key":"e_1_3_2_1_24_1","volume-title":"A prior-free revenue maximizing auction for secondary spectrum access,\" in INFOCOM'11","author":"Gopinathan A.","year":"2011","unstructured":"A. Gopinathan and Z. Li , \" A prior-free revenue maximizing auction for secondary spectrum access,\" in INFOCOM'11 , 2011 . A. Gopinathan and Z. Li, \"A prior-free revenue maximizing auction for secondary spectrum access,\" in INFOCOM'11, 2011."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2004.08.009"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2007.12.009"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090254"},{"key":"e_1_3_2_1_28_1","volume-title":"A survey of results,\" in TAMC'08","author":"Dwork C.","year":"2008","unstructured":"C. Dwork , \"Differential privacy : A survey of results,\" in TAMC'08 , 2008 . C. Dwork, \"Differential privacy: A survey of results,\" in TAMC'08, 2008."},{"key":"e_1_3_2_1_29_1","unstructured":"V. Krishna \"Auction theory \" Academic Press 2002.  V. Krishna \"Auction theory \" Academic Press 2002."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"N. Nisan \"Algorithmic game theory \" Cambridge University Press 2007.   N. Nisan \"Algorithmic game theory \" Cambridge University Press 2007.","DOI":"10.1017\/CBO9780511800481"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"H. Lipmaa N. Asokan V. Niemi \"Secure Vickrey auctions without threshold trust \" in FC'03 2003.   H. Lipmaa N. Asokan V. Niemi \"Secure Vickrey auctions without threshold trust \" in FC'03 2003.","DOI":"10.1007\/3-540-36504-4_7"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2003.08.002"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.938993"},{"key":"e_1_3_2_1_36_1","volume-title":"PPS: Privacy-Preserving Strategyproof Social-Efficient Spectrum Auction Mechanisms,\" in http:\/\/arxiv.org\/pdf\/1307.7792v1.pdf","author":"Huang H.","year":"2013","unstructured":"H. Huang , X. Li , Y. Sun , H. Xu , and L. Huang , \" PPS: Privacy-Preserving Strategyproof Social-Efficient Spectrum Auction Mechanisms,\" in http:\/\/arxiv.org\/pdf\/1307.7792v1.pdf , 2013 . H. Huang, X. Li, Y. Sun, H. Xu, and L. Huang, \"PPS: Privacy-Preserving Strategyproof Social-Efficient Spectrum Auction Mechanisms,\" in http:\/\/arxiv.org\/pdf\/1307.7792v1.pdf, 2013."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2012.55"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.36"}],"event":{"name":"MobiHoc'14: The Fifteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Philadelphia Pennsylvania USA","acronym":"MobiHoc'14"},"container-title":["Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632951.2632974","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2632951.2632974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:08Z","timestamp":1750230068000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632951.2632974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,11]]},"references-count":38,"alternative-id":["10.1145\/2632951.2632974","10.1145\/2632951"],"URL":"https:\/\/doi.org\/10.1145\/2632951.2632974","relation":{},"subject":[],"published":{"date-parts":[[2014,8,11]]},"assertion":[{"value":"2014-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}