{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:05:46Z","timestamp":1775912746879,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T00:00:00Z","timestamp":1729900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T00:00:00Z","timestamp":1729900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972309;62272369"],"award-info":[{"award-number":["61972309;62272369"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CCF-Huawei Database System Innovation Research Plan","award":["2020010B"],"award-info":[{"award-number":["2020010B"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>This study introduces an innovative framework named <jats:sc>scale<\/jats:sc> for processing <jats:italic>dynamic skyline queries<\/jats:italic> securely in cloud environments. Unlike previous approaches that require complex operations on encrypted data, <jats:sc>scale<\/jats:sc> simplifies dynamic skyline domination to mere comparisons, significantly improving query efficiency. Through empirical evaluations over four datasets, we show that <jats:sc>scale<\/jats:sc> accelerates query processing nearly 1000-fold compared to existing state-of-the-art methods. Specifically, <jats:sc>scale<\/jats:sc> shows significant efficiency improvements by simplifying query interactions to a single round between the user and the cloud, which is validated through empirical studies on multiple datasets. Moreover, we introduce two distributed versions of <jats:sc>scale<\/jats:sc>, <jats:sc>dist-scale-s<\/jats:sc> and <jats:sc>dist-scale-e<\/jats:sc>, which further optimize performance by facilitating parallel processing. This adaptation showcases a substantial reduction in response times and computational overhead, underpinning the scalability and effectiveness of our framework in handling large-scale, secure cloud-based queries.<\/jats:p>","DOI":"10.1007\/s41019-024-00261-y","type":"journal-article","created":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T07:01:45Z","timestamp":1729926105000},"page":"54-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Framework for Secure Dynamic Skyline Query Processing in the Cloud"],"prefix":"10.1007","volume":"10","author":[{"given":"Peng","family":"Chen","sequence":"first","affiliation":[]},{"given":"Baochao","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2382-6289","authenticated-orcid":false,"given":"Hui","family":"Li","sequence":"additional","affiliation":[]},{"given":"Weiguo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yanguo","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jiangtao","family":"Cui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,26]]},"reference":[{"issue":"2","key":"261_CR1","first-page":"263","volume":"146","author":"GM Adel\u2019Son-Vel\u2019Skii","year":"1962","unstructured":"Adel\u2019Son-Vel\u2019Skii GM, Landis EM (1962) An algorithm for the organization of information. Dokl Akad Nauk SSSR 146(2):263\u2013266","journal-title":"Dokl Akad Nauk SSSR"},{"key":"261_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Kiernan J, Srikant R, Xu Y (2004) Order preserving encryption for numeric data. In: SIGMOD. ACM, pp 563\u2013574","DOI":"10.1145\/1007568.1007632"},{"key":"261_CR3","doi-asserted-by":"crossref","unstructured":"Boldyreva A, Chenette N, Lee Y, O\u2019Neill A (2009) Order-preserving symmetric encryption. In: EUROCRYPT, pp 224\u2013241","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"261_CR4","doi-asserted-by":"crossref","unstructured":"Boldyreva A, Chenette N, O\u2019Neill A (2011) Order-preserving encryption revisited: improved security analysis and alternative solutions. In: CRYPTO, pp 578\u2013595","DOI":"10.1007\/978-3-642-22792-9_33"},{"key":"261_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D, Lewi K, Raykova M, Sahai A, Zhandry M, Zimmerman J (2015) Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: EUROCRYPT, pp 563\u2013594","DOI":"10.1007\/978-3-662-46803-6_19"},{"key":"261_CR6","unstructured":"B\u00f6rzs\u00f6nyi S, Kossmann D, Stocker K (2001) The skyline operator. In: ICDE, pp 421\u2013430"},{"key":"261_CR7","doi-asserted-by":"crossref","unstructured":"Bothe S, Cuzzocrea A, Karras P, Vlachou A (2014) Skyline query processing over encrypted data: An attribute-order-preserving-free approach. In: PSBD@CIKM, pp 37\u201343","DOI":"10.1145\/2663715.2669613"},{"key":"261_CR8","doi-asserted-by":"crossref","unstructured":"Chatterjee S, Das MPL (2015) Property preserving symmetric encryption revisited. In: ASIACRYPT, pp 658\u2013682","DOI":"10.1007\/978-3-662-48800-3_27"},{"key":"261_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Liu M, Zhang R, Zhang Y, Liu S (2016) Secure outsourced skyline query processing via untrusted cloud service providers. In: INFOCOM, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524509"},{"key":"261_CR10","doi-asserted-by":"crossref","unstructured":"Chenette N, Lewi K, Weis SA, Wu DJ (2016) Practical order-revealing encryption with limited leakage. In: FSE, pp 474\u2013493","DOI":"10.1007\/978-3-662-52993-5_24"},{"key":"261_CR11","doi-asserted-by":"crossref","unstructured":"Chomicki J, Godfrey P, Gryz J, Liang D (2003) Skyline with presorting. In: ICDE, pp 717\u2013719","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"261_CR12","unstructured":"Dellis E, Seeger B (2007) Efficient computation of reverse skyline queries. In: VLDB, pp 291\u2013302"},{"key":"261_CR13","doi-asserted-by":"publisher","first-page":"4589","DOI":"10.1109\/TIFS.2021.3109459","volume":"16","author":"X Ding","year":"2021","unstructured":"Ding X, Wang Z, Zhou P, Choo KKR, Jin H (2021) Efficient and privacy-preserving multi-party skyline queries over encrypted data. IEEE Trans Inf Forensics Secur 16:4589\u20134604. https:\/\/doi.org\/10.1109\/TIFS.2021.3109459","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"261_CR14","volume-title":"A fully homomorphic encryption scheme","author":"C Gentry","year":"2009","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. Stanford University, Stanford"},{"issue":"2","key":"261_CR15","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s41019-022-00183-7","volume":"7","author":"J He","year":"2022","unstructured":"He J, Han X (2022) Efficient skyline computation on massive incomplete data. Data Sci Eng 7(2):102\u2013119","journal-title":"Data Sci Eng"},{"key":"261_CR16","doi-asserted-by":"crossref","unstructured":"Kerschbaum F (2015) Frequency-hiding order-preserving encryption. In: CCS. ACM, pp 656\u2013667","DOI":"10.1145\/2810103.2813629"},{"key":"261_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s41019-018-0081-5","volume":"3","author":"M Kesarwani","year":"2018","unstructured":"Kesarwani M, Kaul A, Singh G, Deshpande PM, Haritsa JR (2018) Collusion-resistant processing of sql range predicates. Data Sci Eng 3:323\u2013340","journal-title":"Data Sci Eng"},{"key":"261_CR18","doi-asserted-by":"crossref","unstructured":"Kossmann D, Ramsak F, Rost S (2002) Shooting stars in the sky: an online algorithm for skyline queries. In: VLDB, pp 275\u2013286","DOI":"10.1016\/B978-155860869-6\/50032-9"},{"key":"261_CR19","doi-asserted-by":"crossref","unstructured":"Kriegel H, Renz v, Schubert M (2010) Route skyline queries: a multi-preference path planning approach. In: ICDE, pp 261\u2013272","DOI":"10.1109\/ICDE.2010.5447845"},{"issue":"4","key":"261_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"HT Kung","year":"1975","unstructured":"Kung HT, Luccio F, Preparata FP (1975) On finding the maxima of a set of vectors. J ACM 22(4):469\u2013476","journal-title":"J ACM"},{"key":"261_CR21","doi-asserted-by":"crossref","unstructured":"Lewi K, Wu DJ (2016) Order-revealing encryption: new constructions, applications, and lower bounds. In: CCS, pp 1167\u20131178","DOI":"10.1145\/2976749.2978376"},{"key":"261_CR22","doi-asserted-by":"crossref","unstructured":"Liu J, Yang J, Xiong L, Pei J (2017) Secure skyline queries on cloud platform. In: ICDE, pp 633\u2013644","DOI":"10.1109\/ICDE.2017.117"},{"issue":"7","key":"261_CR23","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1109\/TKDE.2018.2857471","volume":"31","author":"J Liu","year":"2018","unstructured":"Liu J, Yang J, Xiong L, Pei J (2018) Secure and efficient skyline queries on encrypted data. IEEE Trans Knowl Data Eng 31(7):1397\u20131411","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"261_CR24","doi-asserted-by":"crossref","unstructured":"Liu X, Choo KKR, Deng RH, Yang Y, Zhang Y (2018) Pusc: Privacy-preserving user-centric skyline computation over multiple encrypted domains. In: 2018 17th IEEE International conference on trust, security and privacy in computing and communications\/ 12th IEEE International conference on big data science and engineering (TrustCom\/BigDataSE), pp 958\u2013963","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00135"},{"key":"261_CR25","unstructured":"Mullesgaard K, Pederseny JL, Lu H, Zhou Y (2014) Efficient skyline computation in Mapreduce. In: EDBT, pp 37\u201348"},{"issue":"4","key":"261_CR26","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s41019-020-00136-y","volume":"5","author":"M Padhya","year":"2020","unstructured":"Padhya M, Jinwala DC (2020) R-oo-kase: revocable online\/offline key aggregate searchable encryption. Data Sci Eng 5(4):391\u2013418","journal-title":"Data Sci Eng"},{"key":"261_CR27","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"261_CR28","doi-asserted-by":"crossref","unstructured":"Pandey O, Rouselakis Y (2012) Property preserving symmetric encryption. In: EUROCRYPT, pp 375\u2013391","DOI":"10.1007\/978-3-642-29011-4_23"},{"key":"261_CR29","doi-asserted-by":"crossref","unstructured":"Papadias D, Tao Y, Fu G, Seeger B (2003) An optimal and progressive algorithm for skyline queries. In: SIGMOD, pp 467\u2013478","DOI":"10.1145\/872757.872814"},{"issue":"1","key":"261_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1061318.1061320","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y, Fu G, Seeger B (2005) Progressive skyline computation in database systems. ACM Trans Database Syst 30(1):41\u201382","journal-title":"ACM Trans Database Syst"},{"issue":"5","key":"261_CR31","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/TKDE.2017.2654459","volume":"29","author":"Y Park","year":"2017","unstructured":"Park Y, Min J, Shim K (2017) Efficient processing of skyline queries using Mapreduce. IEEE Trans Knowl Data Eng 29(5):1031\u20131044","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"261_CR32","doi-asserted-by":"crossref","unstructured":"Popa RA, Li FH, Zeldovich N (2013) An ideal-security protocol for order-preserving encoding. In: SP, pp 463\u2013477","DOI":"10.1109\/SP.2013.38"},{"key":"261_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry\u2014an introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata FP, Shamos MI (1985) Computational geometry\u2014an introduction. Springer, Berlin"},{"key":"261_CR34","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3264627","author":"L Purohit","year":"2023","unstructured":"Purohit L, Rathore SS, Kumar S (2023) A qos-aware clustering based multi-layer model for web service selection. IEEE Trans Serv Comput. https:\/\/doi.org\/10.1109\/TSC.2023.3264627","journal-title":"IEEE Trans Serv Comput"},{"key":"261_CR35","doi-asserted-by":"publisher","unstructured":"Shu Y, Zhang J, Zhang WE, Zuo D, Sheng QZ (2022) Iqsrec: An efficient and diversified skyline services recommendation on incomplete qos. IEEE Transactions on Services Computing 1\u201314. https:\/\/doi.org\/10.1109\/TSC.2022.3189503","DOI":"10.1109\/TSC.2022.3189503"},{"key":"261_CR36","volume-title":"Operating system concepts","author":"A Silberschatz","year":"2012","unstructured":"Silberschatz A, Galvin PB, Gagne G (2012) Operating system concepts, 9th edn. Wiley Publishing","edition":"9"},{"key":"261_CR37","first-page":"280","volume":"2013","author":"E Stefanov","year":"2013","unstructured":"Stefanov E, van Dijk M, Shi E, Fletcher CW, Ren L, Yu X, Devadas S (2013) Path ORAM: an extremely simple oblivious RAM protocol. IACR Cryptol ePrint Arch 2013:280","journal-title":"IACR Cryptol ePrint Arch"},{"key":"261_CR38","doi-asserted-by":"crossref","unstructured":"Teng Y, Sun Y, Shi Z, Jiang D, Zhao L, Fan C (2021) Secure skyline groups queries on encrypted data on cloud platform. In: 2021 IEEE 23rd Int conf on high performance computing & communications; 7th int conf on data science & systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC\/DSS\/SmartCity\/DependSys), pp 551\u2013560","DOI":"10.1109\/HPCC-DSS-SmartCity-DependSys53884.2021.00096"},{"key":"261_CR39","doi-asserted-by":"crossref","unstructured":"Wang W, Li H, Peng Y, Bhowmick SS, Chen P, Chen X, Cui J (2020) SCALE: an efficient framework for secure dynamic skyline query processing in the cloud. In: DASFAA, Volume 12114 of Lecture Notes in Computer Science. Springer, pp 288\u2013305","DOI":"10.1007\/978-3-030-59419-0_18"},{"issue":"12","key":"261_CR40","doi-asserted-by":"publisher","first-page":"9973","DOI":"10.1109\/JIOT.2021.3117933","volume":"9","author":"S Zhang","year":"2022","unstructured":"Zhang S, Ray S, Lu R, Zheng Y, Guan Y, Shao J (2022) Achieving efficient and privacy-preserving dynamic skyline query in online medical diagnosis. IEEE Internet Things J 9(12):9973\u20139986. https:\/\/doi.org\/10.1109\/JIOT.2021.3117933","journal-title":"IEEE Internet Things J"},{"issue":"2","key":"261_CR41","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TDSC.2022.3153759","volume":"20","author":"S Zhang","year":"2023","unstructured":"Zhang S, Ray S, Lu R, Zheng Y, Guan Y, Shao J (2023) Towards efficient and privacy-preserving interval skyline queries over time series data. IEEE Trans Dependable Secure Comput 20(2):1348\u20131363. https:\/\/doi.org\/10.1109\/TDSC.2022.3153759","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"9","key":"261_CR42","doi-asserted-by":"publisher","first-page":"8955","DOI":"10.1109\/TKDE.2022.3220595","volume":"35","author":"Y Zheng","year":"2023","unstructured":"Zheng Y, Wang W, Wang S, Jia X, Huang H, Wang C (2023) Secskyline: fast privacy-preserving skyline queries over encrypted cloud databases. IEEE Trans Knowl Data Eng 35(9):8955\u20138967. https:\/\/doi.org\/10.1109\/TKDE.2022.3220595","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"261_CR43","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TKDE.2015.2475764","volume":"28","author":"X Zhou","year":"2016","unstructured":"Zhou X, Li K, Zhou Y, Li K (2016) Adaptive processing for distributed skyline queries over uncertain data. IEEE Trans Knowl Data Eng 28(2):371\u2013384","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00261-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-024-00261-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00261-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T04:17:30Z","timestamp":1740802650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-024-00261-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,26]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["261"],"URL":"https:\/\/doi.org\/10.1007\/s41019-024-00261-y","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,26]]},"assertion":[{"value":"4 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}