{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T13:10:33Z","timestamp":1719148233210},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T00:00:00Z","timestamp":1702857600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,22]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The $k$th min threshold is to judge whether the $k$th smallest element of an attribute set along with a confidential file is greater than a predefined threshold, which is a fundamental, primitive operation in data evaluation, such as risk evaluation in business investment. However, it will compromise the privacy of the confidential files when proceeding with such a data evaluation because there is often a large amount of sensitive information involved in them, which the organizations\/individuals are reluctant to expose due to the risk of losing a competitive advantage. Motivated by the issue how to preserve the privacy of the confidential files during data evaluation, in this research, we first present a new encryption notion called $k$th min threshold encryption (KTE) for serving privacy-preserving data evaluation. In this notion, the confidential file will be encrypted under an attribute set for its privacy protection prior to being sent to a receiver, and a decryption key is generated from a threshold $d$ and a rank $k$ of element, both selected by the receiver. The decryption will be successful if and only if the $k$th smallest element of the attribute set is greater than $d$. We then describe a concrete construction of KTE in the public-key setting. In particular, our construction features optimally short private keys, which only consists of one group element. By virtue of this advantage, it is quite practical because of only two pairing operations for decryption computation.<\/jats:p>","DOI":"10.1093\/comjnl\/bxad113","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:34:14Z","timestamp":1703136854000},"page":"1941-1950","source":"Crossref","is-referenced-by-count":0,"title":["<i>K<\/i>th min Threshold Encryption for Privacy-preserving Data Evaluation"],"prefix":"10.1093","volume":"67","author":[{"given":"Zhenhua","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Xi\u2019an University of Science and Technology , Xi\u2019an, 710054 , China"},{"name":"Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology , Guilin 541004 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Xi\u2019an University of Science and Technology , Xi\u2019an, 710054 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junrui","family":"Xie","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Xi\u2019an University of Science and Technology , Xi\u2019an, 710054 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ni","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Xi\u2019an University of Science and Technology , Xi\u2019an, 710054 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Nie","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Xi\u2019an University of Science and Technology , Xi\u2019an, 710054 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"issue":"3","key":"2024062312373753100_ref1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1049\/cit2.12003","article-title":"SDN-based intrusion detection system for IoT using deep learning classifier","volume":"6","author":"Wani","year":"2021","journal-title":"CAAI Trans. Intell. Technol. J."},{"issue":"3","key":"2024062312373753100_ref2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.47852\/bonviewJCCE149145205514","article-title":"Research on internet security situation awareness prediction technology based on improved RBF neural network algorithm","volume":"1","author":"Chen","year":"2022","journal-title":"J. Comput. Cognit. Eng. J."},{"issue":"2","key":"2024062312373753100_ref3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/MCE.2021.3140048","article-title":"Blockchain-based medical certificate generation and verification for IoT-based healthcare systems","volume":"12","author":"Namasudra","year":"2022","journal-title":"IEEE Consumer Electr. Mag. J."},{"key":"2024062312373753100_ref4","doi-asserted-by":"crossref","first-page":"108048","DOI":"10.1016\/j.compeleceng.2022.108048","article-title":"Introduction to the special section on advances of machine learning in cybersecurity","volume":"100","author":"Namasudra","year":"2022","journal-title":"Comput. Electr. Eng. J."},{"key":"2024062312373753100_ref5","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1201\/9781351011419-7","article-title":"Security, privacy, trust, and anonymity","volume":"1","author":"Namasudra","year":"2018","journal-title":"Adv. DNA Comput. Cryptogr. J."},{"key":"2024062312373753100_ref6","doi-asserted-by":"crossref","DOI":"10.47852\/bonviewJCCE2202261","article-title":"Revisiting shift cipher technique for amplified data security","author":"Verma","year":"2022","journal-title":"J. Comput. Cognit. Eng."},{"issue":"2","key":"2024062312373753100_ref7","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1049\/cit2.12093","article-title":"Boosting image watermarking authenticity spreading secrecy from counting-based secret-sharing","volume":"8","author":"Gutub","year":"2022","journal-title":"CAAI Trans. Intell. Technol. J."},{"issue":"6","key":"2024062312373753100_ref8","first-page":"750","article-title":"Secure vector computation based on threshold","volume":"7","author":"Wang","year":"2020","journal-title":"J. Cryptologic Res."},{"key":"2024062312373753100_ref9","first-page":"457","article-title":"Fuzzy identity-based encryption","volume-title":"Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. Aarhus, Denmark, 22\u201326 May","author":"Sahai","year":"2005"},{"issue":"2","key":"2024062312373753100_ref10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/TIFS.2015.2489179","article-title":"Distance-based encryption: how to embed fuzziness in biometric-based encryption","volume":"11","author":"Guo","year":"2015","journal-title":"IEEE Trans. Inf. Foren. Sec."},{"issue":"1","key":"2024062312373753100_ref11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10623-015-0068-4","article-title":"Generalized closest substring encryption","volume":"80","author":"Guo","year":"2016","journal-title":"Desig. Codes Cryptogr."},{"issue":"7","key":"2024062312373753100_ref12","doi-asserted-by":"crossref","first-page":"7161","DOI":"10.1109\/TVT.2021.3088869","article-title":"Privacy-preserving task matching with threshold similarity search via vehicular crowdsourcing","volume":"70","author":"Song","year":"2021","journal-title":"IEEE Trans. Vehic. Technol."},{"key":"2024062312373753100_ref13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FAIA220511","article-title":"Attack and improvement of a hidden vector encryption scheme","volume-title":"Proceedings of CECNet 2022. Xiamen, China, 4\u20137 November","author":"Wang","year":"2022"},{"key":"2024062312373753100_ref14","first-page":"135","article-title":"Computationally efficient fine-grain cube CP-ABE scheme with partially hidden access structure","volume-title":"Big Data and Security: First International Conference. Nanjing, China, 20\u201322 December","author":"Murad","year":"2019"},{"key":"2024062312373753100_ref15","first-page":"40","article-title":"Secure computation of the k th-ranked element","volume-title":"Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. Interlaken, Switzerland, 2\u20136 May","author":"Aggarwal","year":"2004"},{"key":"2024062312373753100_ref16","first-page":"1","article-title":"Privacy-preserving min and k-th min computations with fully homomorphic encryption","volume-title":"Proceedings of the 2015 IEEE 34th International Performance Computing and Communications Conference (IPCCC). Nanjing, China, 14\u201316 December","author":"Jiang","year":"2015"},{"key":"2024062312373753100_ref17","article-title":"Secure computation of the kth-ranked element in a star network","author":"Tueno","year":"2019"},{"key":"2024062312373753100_ref18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.5220\/0011144100003283","article-title":"Comparison-based MPC in Star Topology","volume-title":"Proceedings of the 19th International Conference on Security and Cryptography, Lisbon, Portugal, 11\u201313 July","author":"Chandran","year":"2022"},{"issue":"11","key":"2024062312373753100_ref19","first-page":"2256","article-title":"K-min security multi-party computing solution and application","volume":"49","author":"Yu-lin","year":"2021","journal-title":"Acta Electon. Sin"},{"key":"2024062312373753100_ref20","first-page":"213","article-title":"Identity-based encryption from the weil pairing","volume-title":"Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology. Santa Barbara, California, USA, 19\u201323 August","author":"Boneh","year":"2001"},{"key":"2024062312373753100_ref21","first-page":"255","article-title":"A forward-secure public-key encryption scheme","volume-title":"Proceedings of the 22nd International Conference on Theory and Applications of Cryptographic Techniques. Hanoi, Vietnam, 4\u20138 December","author":"Canetti","year":"2003"},{"key":"2024062312373753100_ref22","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/978-3-642-03356-8_36","article-title":"Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions.","volume-title":"Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology Conference. Santa Barbara, CA, USA, 16\u201320 August","author":"Waters","year":"2009"},{"issue":"2","key":"2024062312373753100_ref23","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","article-title":"Universal codeword sets and representations of the integers","volume":"21","author":"Elias","year":"1975","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2024062312373753100_ref24","first-page":"137","article-title":"The advanced encryption standard","volume":"26","author":"Daemen","year":"2001","journal-title":"Dr. Dobb\u2019s J."},{"key":"2024062312373753100_ref25","article-title":"The pairing-based cryptography library","author":"Lynn","year":"2006"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/5\/1941\/58308177\/bxad113.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/5\/1941\/58308177\/bxad113.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T12:39:41Z","timestamp":1719146381000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/5\/1941\/7477782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,18]]},"references-count":25,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,12,18]]},"published-print":{"date-parts":[[2024,6,22]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxad113","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,5]]},"published":{"date-parts":[[2023,12,18]]}}}