{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:22:51Z","timestamp":1777702971106,"version":"3.51.4"},"reference-count":49,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T00:00:00Z","timestamp":1553731200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,5,14]]},"abstract":"<jats:p>\u00a0In recent years, a large number of spectrum mechanisms have been proposed, but these mechanisms ignore the security issues that arise during the design of the mechanism. In this paper, two secure models for sealed-bid spectrum auction are given based on Wang\u2019s generic spectrum auction mechanism. One is the basic model and another improved model based on the basic model is proposed, which maximizes Social welfare while it is a Privacy-preserving Spectrum auction mechanism with public Verification namely SPSV. The SPSV scheme achieves the properties of maximizing the social welfare but also, by using the double paillier cryptosystem, it is privacy-preserving for bidders\u2019 bids without revealing any sensitive information to auctioneer or agent during the entire spectrum auction. Oblivious transfer is applied to ensure the anonymity of bidders. Furthermore, the use of inequality comparison proof also provides the public verification of winner group to verify the comparison relationship between winner groups and losing groups. At last, the performance analysis are given.<\/jats:p>","DOI":"10.3233\/jifs-169979","type":"journal-article","created":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T12:24:12Z","timestamp":1553862252000},"page":"4215-4226","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["A privacy-preserving spectrum auction scheme using paillier cryptosystem with public verification"],"prefix":"10.1177","volume":"36","author":[{"given":"Jiaqi","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marimuthu","family":"Karuppiah","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, VIT University, Vellore, Tamilnadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saru","family":"Kumari","sequence":"additional","affiliation":[{"name":"Department of Mathematics Chaudhary Charan Singh University Meerut, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyin","family":"Kong","sequence":"additional","affiliation":[{"name":"Science and Technology on Information Assurance Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbo","family":"Shi","sequence":"additional","affiliation":[{"name":"School of computer and Communication Engineering, Northeastern University At Qinhuangdao, Qinhuangdao, Hebei \u2013 P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,3,28]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"1","article-title":"Survey on spectrum utilization in Europe: Measurements, analyses and observations[C]\/\/, Cognitive Radio Oriented Wireless Networks & Communications (CROWNCOM)","author":"Valenta V.","year":"2010","unstructured":"V.Valenta, R.Mar\u0161\u00e1lek, G.Baudoin, et al., Survey on spectrum utilization in Europe: Measurements, analyses and observations[C]\/\/, Cognitive Radio Oriented Wireless Networks & Communications (CROWNCOM), 2010 Proceedings of the Fifth International Conference on IEEE, 2010, pp. 1\u20135.","journal-title":"2010 Proceedings of the Fifth International Conference on IEEE"},{"key":"e_1_3_2_3_2","unstructured":"Sepctrum Bridge Inc http:\/\/www.spectrumbridge.com"},{"key":"e_1_3_2_4_2","first-page":"22","article-title":"A general framework for wireless spectrum auctions[C], New Frontiers in Dynamic Spectrum Access Networks","author":"Gandhi S.","year":"2007","unstructured":"S.Gandhi, C.Buragohain, L.Cao, et al., A general framework for wireless spectrum auctions[C], New Frontiers in Dynamic Spectrum Access Networks, 2007 DySPAN 2007 2nd IEEE International Symposium on IEEE, 2007, pp. 22\u201333.","journal-title":"2007 DySPAN 2007 2nd IEEE International Symposium on IEEE"},{"key":"e_1_3_2_5_2","first-page":"1","article-title":"A multi-winner cognitive spectrum auction framework with collusion-resistant mechanisms[C], New Frontiers in Dynamic Spectrum Access Networks","author":"Wu Y.","year":"2008","unstructured":"Y.Wu, B.Wang, K.J.R.Liu, et al., A multi-winner cognitive spectrum auction framework with collusion-resistant mechanisms[C], New Frontiers in Dynamic Spectrum Access Networks, 2008 DySPAN 2008 3rd IEEE Symposium on IEEE, 2008, pp. 1\u20139.","journal-title":"2008 DySPAN 2008 3rd IEEE Symposium on IEEE"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1409944.1409947"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2051453"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11151-013-9376-x"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2007758"},{"key":"e_1_3_2_10_2","first-page":"1","article-title":"Fair profit allocation in the spectrum auction using the shapley value[C]","author":"Pan M.","year":"2009","unstructured":"M.Pan, F.Chen, X.Yin, et al., Fair profit allocation in the spectrum auction using the shapley value[C], Global Telecommunications Conference, 2009 GLOBECOM 2009 IEEE IEEE, 2009, pp. 1\u20136.","journal-title":"Global Telecommunications Conference, 2009 GLOBECOM 2009 IEEE IEEE"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530753"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062011"},{"key":"e_1_3_2_13_2","first-page":"1","article-title":"A Privacy Preserving Truthful Spectrum Auction Scheme Using Homomorphic Encryption[C]","author":"Wang X.","year":"2015","unstructured":"X.Wang, Y.Ji, H.Zhou, et al., A Privacy Preserving Truthful Spectrum Auction Scheme Using Homomorphic Encryption[C], Global Communications Conference (GLOBECOM), 2015 IEEE IEEE, 2015, pp. 1\u20136.","journal-title":"Global Communications Conference (GLOBECOM), 2015 IEEE IEEE"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.05.001"},{"key":"e_1_3_2_15_2","article-title":"Truthful spectrum auctions with approximate revenue","author":"Al-Ayyoub M.","year":"2011","unstructured":"M.Al-Ayyoub and H.Gupta, Truthful spectrum auctions with approximate revenue, in INFOCOM\u201911, 2011.","journal-title":"in INFOCOM\u201911"},{"key":"e_1_3_2_16_2","article-title":"To preempt or not: Tackling bid and time-based cheating in online spectrum auctions","author":"Deek L.B.","year":"2011","unstructured":"L.B.Deek, X.Zhou, K.C.Almeroth and H.Zheng, To preempt or not: Tackling bid and time-based cheating in online spectrum auctions, in INFOCOM\u201911, 2011.","journal-title":"in INFOCOM\u201911"},{"key":"e_1_3_2_17_2","article-title":"Combinatorial auction with time-frequency flexibility in cognitive radio networks","volume":"12","author":"Dong M.","year":"2012","unstructured":"M.Dong, G.Sun, X.Wang and Q.Zhang, Combinatorial auction with time-frequency flexibility in cognitive radio networks, in INFOCOM\u201912, 2012.","journal-title":"in INFOCOM\u2019"},{"key":"e_1_3_2_18_2","article-title":"TAHES: Truthful double auction for heterogeneous spectrums","author":"Feng X.","year":"2012","unstructured":"X.Feng, Y.Chen, J.Zhang, Q.Zhang and B.Li, TAHES: Truthful double auction for heterogeneous spectrums, in INFOCOM\u201912, 2012.","journal-title":"in INFOCOM\u201912"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2034630"},{"key":"e_1_3_2_20_2","article-title":"SMALL: A strategy-proof mechanism for radio spectrum allocation","author":"Wu F.","year":"2011","unstructured":"F.Wu and N.Vaidya, SMALL: A strategy-proof mechanism for radio spectrum allocation, in INFOCOM\u201911, 2011.","journal-title":"in INFOCOM\u201911"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.241"},{"key":"e_1_3_2_22_2","article-title":"Truthful online spectrum allocation and auction in multi-channel wireless networks","author":"Xu P.","year":"2011","unstructured":"P.Xu, X.Xu, S.Tang and X.-Y.Li, Truthful online spectrum allocation and auction in multi-channel wireless networks, in INFOCOM\u201911, 2011.","journal-title":"in INFOCOM\u201911"},{"key":"e_1_3_2_23_2","article-title":"TRUST: A general framework for truthful double spectrum auctions","author":"Zhou X.","year":"2009","unstructured":"X.Zhou and H.Zheng, TRUST: A general framework for truthful double spectrum auctions, in INFOCOM\u201909, 2009.","journal-title":"in INFOCOM\u201909"},{"key":"e_1_3_2_24_2","first-page":"94","article-title":"Mechanism design via differential privacy[C], Foundations of Computer Science","author":"McSherry F.","year":"2007","unstructured":"F.McSherry and K.Talwar, Mechanism design via differential privacy[C], Foundations of Computer Science, 2007 FOCS\u201907 48th Annual IEEE Symposium on IEEE, 2007, pp. 94\u2013103.","journal-title":"2007 FOCS\u201907 48th Annual IEEE Symposium on IEEE"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110417"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_27_2","author":"Xu Y.","unstructured":"Y.Xu, J.C.Lui and D.-M,Chiu, On oligopoly spectrum allocation game in cognitive radio networks with capacity constraints.","journal-title":"On oligopoly spectrum allocation game in cognitive radio networks with capacity constraints"},{"key":"e_1_3_2_28_2","first-page":"1","article-title":"Strategyproof wireless spectrum auctions with interference","author":"Gopinathan A.","year":"2010","unstructured":"A.Gopinathan and Z.Li, Strategyproof wireless spectrum auctions with interference, In IEEE GLOBECOM, 2010, pp. 1\u20135.","journal-title":"In IEEE GLOBECOM"},{"key":"e_1_3_2_29_2","article-title":"Near-optimal truthful spectrum auction mechanisms with spatial and temporal reuse in wireless networks","author":"Huang H.","year":"2013","unstructured":"H.Huang, Y.-E.Sun, X.-Y.Li, Z.Chen, W.Yang and H.Xu, Near-optimal truthful spectrum auction mechanisms with spatial and temporal reuse in wireless networks, In ACM MOBIHOC, 2013.","journal-title":"In ACM MOBIHOC"},{"key":"e_1_3_2_30_2","first-page":"873","article-title":"Truthful spectrum auction design for secondary networks","author":"Zhu Y.","year":"2012","unstructured":"Y.Zhu, B.Li and Z.Li, Truthful spectrum auction design for secondary networks, In IEEE INFOCOM, 2012, pp. 873\u2013881.","journal-title":"In IEEE INFOCOM"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566870"},{"key":"e_1_3_2_32_2","first-page":"185","article-title":"Differentially private spectrum auction with approximate revenue maximization[C]","author":"Zhu R.","year":"2014","unstructured":"R.Zhu, Z.Li, F.Wu, et al., Differentially private spectrum auction with approximate revenue maximization[C], Proceedings of the 15th ACM International Symposium on Mobile ad hoc Networking and Computing ACM, 2014, pp. 185\u2013194.","journal-title":"Proceedings of the 15th ACM International Symposium on Mobile ad hoc Networking and Computing ACM"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848057"},{"key":"e_1_3_2_34_2","first-page":"909","article-title":"PPER: Privacy-preserving economic-robust spectrum auction in wireless networks[C], Computer Communications (INFOCOM)","author":"Li M.","year":"2015","unstructured":"M.Li, P.Li, L.Guo, et al., PPER: Privacy-preserving economic-robust spectrum auction in wireless networks[C], Computer Communications (INFOCOM), 2015 IEEE Conference on IEEE, 2015, pp. 909\u2013917.","journal-title":"2015 IEEE Conference on IEEE"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2315200"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2322104"},{"key":"e_1_3_2_37_2","first-page":"361","article-title":"Towards secure spectrum auction: Both bids and bidder locations matter: Poster[C]","author":"Chen Z.","year":"2016","unstructured":"Z.Chen, L.Chen, L.Huang, et al., Towards secure spectrum auction: Both bids and bidder locations matter: Poster[C], Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing ACM, 2016, pp. 361\u2013362.","journal-title":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing ACM"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2015.2488618"},{"key":"e_1_3_2_39_2","first-page":"1","article-title":"An Efficient, Privacy-Preserving, and Verifiable Online Auction Mechanism for Ad Exchanges[C]","author":"Zhou M.","year":"2015","unstructured":"M.Zhou, C.Niu, Z.Zheng, et al., An Efficient, Privacy-Preserving, and Verifiable Online Auction Mechanism for Ad Exchanges[C], Global Communications Conference (GLOBECOM), 2015 IEEE IEEE, 2015, pp. 1\u20136.","journal-title":"Global Communications Conference (GLOBECOM), 2015 IEEE IEEE"},{"key":"e_1_3_2_40_2","author":"Feng X.","unstructured":"X.Feng, Y.Chen, J.Zhang, Q.Zhang and B.Li, TAHES: A truthful double auction mechanism for heterogeneous spectrums.","journal-title":"TAHES: A truthful double auction mechanism for heterogeneous spectrums"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"e_1_3_2_42_2","first-page":"66","article-title":"Impact of interference on multi-hop wireless network performance","author":"Jain K.","year":"2003","unstructured":"K.Jain, J.Padhye, V.N.Padmanabhan and L.Qiu, Impact of interference on multi-hop wireless network performance, in Proc ACMMOBICOM, 2003, PP. 66\u201380.","journal-title":"in Proc ACMMOBICOM"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/2632951.2632964"},{"key":"e_1_3_2_44_2","volume-title":"Algorithmic Game Theory","author":"Nian N.","year":"2007","unstructured":"N.Nian, T.Roughgarden, E.Tardos and V.V.Vazirani, Algorithmic Game Theory, Cambridge, U.K.: Cambridge Univ Press, 2007."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2345418"},{"key":"e_1_3_2_46_2","first-page":"223","volume-title":"In: International Conference on the Theory and Applications of Cryptographic Techniques","author":"Paillier P.","year":"1999","unstructured":"P.Paillier, Public-key cryptosystems based on composite degree residuosity classes, In: International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 1999, pp. 223\u2013238."},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2008.04.006"},{"key":"e_1_3_2_48_2","first-page":"223","volume-title":"In: International Conference on the Theory and Applications of Cryptographic Techniques","author":"Paillier P.","year":"1999","unstructured":"P.Paillier, Public-key cryptosystems based on composite degree residuosity classes, In: International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 1999, pp. 223\u2013238."},{"key":"e_1_3_2_49_2","first-page":"187","article-title":"How to exchange secrets with oblivious transfer[J]","author":"Rabin M.O.","year":"2005","unstructured":"M.O.Rabin, How to exchange secrets with oblivious transfer[J], IACR Cryptology ePrint Archive 2005 (2005), 187.","journal-title":"IACR Cryptology ePrint Archive 2005"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1261831"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169979","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-169979","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:37:29Z","timestamp":1777455449000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-169979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,28]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5,14]]}},"alternative-id":["10.3233\/JIFS-169979"],"URL":"https:\/\/doi.org\/10.3233\/jifs-169979","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,28]]}}}