{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:44:05Z","timestamp":1740149045106,"version":"3.37.3"},"reference-count":24,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100012542","name":"Sichuan Province Science and Technology Support Program","doi-asserted-by":"publisher","award":["2020YFG0076","KJ1601401","KY201725C"],"award-info":[{"award-number":["2020YFG0076","KJ1601401","KY201725C"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["2020YFG0076","KJ1601401","KY201725C"],"award-info":[{"award-number":["2020YFG0076","KJ1601401","KY201725C"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009587","name":"Chongqing University of Education","doi-asserted-by":"publisher","award":["2020YFG0076","KJ1601401","KY201725C"],"award-info":[{"award-number":["2020YFG0076","KJ1601401","KY201725C"]}],"id":[{"id":"10.13039\/501100009587","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chongqing Electronics Engineering Technology Research Center for Interactive Learning","award":["2020YFG0076","KJ1601401","KY201725C"],"award-info":[{"award-number":["2020YFG0076","KJ1601401","KY201725C"]}]},{"name":"Chongqing Big Data Engineering Laboratory for Children","award":["2020YFG0076","KJ1601401","KY201725C"],"award-info":[{"award-number":["2020YFG0076","KJ1601401","KY201725C"]}]},{"name":"Innovative Research Group of Higher Institutions in Chongqing","award":["2020YFG0076","KJ1601401","KY201725C"],"award-info":[{"award-number":["2020YFG0076","KJ1601401","KY201725C"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,8,25]]},"abstract":"<jats:p>Over the past decades, there have existed extensive research works on the designs of the closest pre-tender procurement bidding. However, most solutions for the closest pre-tender only target at economic benefits while omitting the problem of bid privacy leakage. Moreover, existing works fail to provide approaches with adequate security and high efficiency. In this paper, for the first time, we propose SPCTR, a sealed-price auction-based procurement bidding system for the closest pre-tender with range validation. SPCTR allows a range validation for a supplier\u2019s bid without leaking the secret bid. Besides, SPCTR achieves a sealed-price comparison with the pre-tender to find the closest pre-tender bid. Compared with previous works, SPCTR provides strong privacy protection for the bids of suppliers without sacrificing high efficiency. SPCTR is constructed based on carefully designed cryptographic tools with generality and simplicity which enable various operations on the encrypted values, and these tools can be easily applied to other contexts. We not only formally prove that SPCTR is secure against semihonest adversaries but also comprehensively analyze the efficiency. Experimental results validate that SPCTR achieves procurement bidding with light computation time and communication cost in practice.<\/jats:p>","DOI":"10.1155\/2020\/8872617","type":"journal-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T23:32:55Z","timestamp":1598398375000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["SPCTR: Sealed Auction-Based Procurement for Closest Pre-Tender with Range Validation"],"prefix":"10.1155","volume":"2020","author":[{"given":"Li","family":"Li","sequence":"first","affiliation":[{"name":"College of Cybersecurity, Sichuan University, Chengdu, Sichuan, China"},{"name":"School of Mathematics and Information Engineering, Chongqing University of Education, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3021-3771","authenticated-orcid":true,"given":"Jiayong","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Cybersecurity, Sichuan University, Chengdu, Sichuan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0455-8779","authenticated-orcid":true,"given":"Peng","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Cybersecurity, Sichuan University, Chengdu, Sichuan, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.5130\/ajceb.v17i4.5793"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1108\/ecam-09-2016-0215"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2015.2434217"},{"first-page":"87","volume-title":"Strain: a secure auction for blockchains","year":"2018","key":"4"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2019.2903879"},{"year":"2007","key":"7"},{"first-page":"234","volume-title":"Efficient protocols for set membership and range proofs","year":"2008","key":"8"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2019.01.009"},{"first-page":"336","volume-title":"Additive combinatorics and discrete logarithm based range protocols","year":"2010","key":"10"},{"year":"2009","key":"11"},{"year":"2007","key":"12"},{"year":"2017","key":"13"},{"first-page":"223","volume-title":"Public-key cryptosystems based on composite degree residuosity classes","year":"1999","key":"14"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0102-6"},{"first-page":"234","volume-title":"All-or-nothing disclosure of secrets","year":"1986","key":"16"},{"first-page":"1","volume-title":"Improved garbled circuit building blocks and applications to auctions and computing minima","year":"2009","key":"19"},{"year":"2010","key":"20"},{"first-page":"255","volume-title":"Practical range proof for cryptocurrency monero with provable security","year":"2018","key":"22"},{"first-page":"47","volume-title":"New results for the practical use of range proofs","year":"2014","key":"24"},{"first-page":"525","volume-title":"k-times anonymous authentication with a constant proving cost","year":"2006","key":"26"},{"first-page":"613","volume-title":"Fast secure two-party ecdsa signing","year":"2017","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2013.2288131"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2016.2573770"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2016.2536601"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8872617.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8872617.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8872617.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T23:33:02Z","timestamp":1598398382000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/8872617\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,25]]},"references-count":24,"alternative-id":["8872617","8872617"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8872617","relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2020,8,25]]}}}