{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:07:01Z","timestamp":1770916021545,"version":"3.50.1"},"reference-count":280,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T00:00:00Z","timestamp":1663891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T00:00:00Z","timestamp":1663891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s11432-021-3393-x","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T19:12:25Z","timestamp":1664305945000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["A survey on cryptographic techniques for protecting big data security: present and forthcoming"],"prefix":"10.1007","volume":"65","author":[{"given":"Siqi","family":"Lu","sequence":"first","affiliation":[]},{"given":"Jianhua","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Yongjuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chunxiang","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"key":"3393_CR1","doi-asserted-by":"publisher","first-page":"131101","DOI":"10.1007\/s11432-018-9929-x","volume":"63","author":"L Jiao","year":"2020","unstructured":"Jiao L, Hao Y L, Feng D G. Stream cipher designs: a review. Sci China Inf Sci, 2020, 63: 131101","journal-title":"Sci China Inf Sci"},{"key":"3393_CR2","doi-asserted-by":"publisher","first-page":"220301","DOI":"10.1007\/s11432-019-2907-4","volume":"63","author":"J Yang","year":"2020","unstructured":"Yang J, Johansson T. An overview of cryptographic primitives for possible use in 5G and beyond. Sci China Inf Sci, 2020, 63: 220301","journal-title":"Sci China Inf Sci"},{"key":"3393_CR3","unstructured":"Dobraunig C, Eichlseder M, Mendel F, et al. 2016. Ascon-submission to the CAESAR competition. http:\/\/ascon.iaik.tugraz.at"},{"key":"3393_CR4","unstructured":"Wu H, Preneel B. AEGIS: a fast authenticated encryption algorithm (v1.1). http:\/\/competitions.cr.yp.to\/round3\/aegisv11.pdf.2016"},{"key":"3393_CR5","unstructured":"Jean J, Nikolic I, Peyrin T, et al. Deoxys v1.41. http:\/\/competitions.cr.yp.to\/round3\/deoxysv141.pdf. 2016"},{"key":"3393_CR6","unstructured":"Wu H. ACORN: A lightweight authenticated cipher (v3). http:\/\/competitions.cr.yp.to\/round3\/acornv3.pdf. 2016"},{"key":"3393_CR7","unstructured":"Ted K, Rogaway P. OCB(v1.1). https:\/\/competitions.cr.yp.to\/round3\/ocbv11.pdf. 2016"},{"key":"3393_CR8","unstructured":"Elena A, Andrey B, Nilanjan D, et al. COLM v1. http:\/\/competitions.cr.yp.to\/round3\/colmv1.pdf. 2016"},{"key":"3393_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.46586\/tosc.v2017.i2.143-161","volume":"2017","author":"N Datta","year":"2017","unstructured":"Datta N, Luykx A, Mennink B, et al. Understanding RUP integrity of COLM. IACR Trans Symmetric Cryptol, 2017, 2017: 143\u2013161","journal-title":"IACR Trans Symmetric Cryptol"},{"key":"3393_CR10","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00145-008-9024-z","volume":"21","author":"C S Jutla","year":"2008","unstructured":"Jutla C S. Encryption modes with almost free message integrity. J Cryptol, 2008, 21: 547\u2013578","journal-title":"J Cryptol"},{"key":"3393_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-52993-5_2","volume-title":"Fast Software Encryption","author":"F Abed","year":"2016","unstructured":"Abed F, Forler C, List E, et al. RIV for robust authenticated encryption. In: Fast Software Encryption. Berlin: Springer, 2016. 23\u201342"},{"key":"3393_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11761679_23","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2006","author":"P Rogaway","year":"2006","unstructured":"Rogaway P, Shrimpton T. A provable-security treatment of the key-wrap problem. In: Advances in Cryptology\u2014EUROCRYPT 2006. Berlin: Springer, 2006. 373\u2013390"},{"key":"3393_CR13","first-page":"647","volume-title":"Data Engineering and Intelligent Computing","author":"R Neethu","year":"2016","unstructured":"Neethu R, Sindhu M, Srinivasan C. XUBA: an authenticated encryption scheme. In: Data Engineering and Intelligent Computing. Singapore: Springer, 2016. 647\u2013655"},{"key":"3393_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63697-9_1","volume-title":"Advances in Cryptology\u2014CRYPTO 2017","author":"T Ashur","year":"2017","unstructured":"Ashur T, Dunkelman O, Luykx A. Boosting authenticated encryption robustness with minimal modifications. In: Advances in Cryptology\u2014CRYPTO 2017. Berlin: Springer, 2017. 3\u201333"},{"key":"3393_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2017.i2.1-26","volume":"2017","author":"Y Naito","year":"2017","unstructured":"Naito Y. Tweakable blockciphers for efficient authenticated encryptions with beyond the birthday-bound security. IACR Trans Symmetric Cryptol, 2017, 2017: 1\u201326","journal-title":"IACR Trans Symmetric Cryptol"},{"key":"3393_CR16","first-page":"330","volume-title":"TriviA: a fast and secure authenticated encryption scheme","author":"A Chakraborti","year":"2015","unstructured":"Chakraborti A, Chattopadhyay A, Hassan M, et al. TriviA: a fast and secure authenticated encryption scheme. In: Proceedings of International Workshop on Cryptographic Hardware and Embedded Systems. Berlin: Springer, 2015. 330\u2013353"},{"key":"3393_CR17","first-page":"411","volume-title":"Boosting OMD for almost free authentication of associated data","author":"R Reyhanitabar","year":"2015","unstructured":"Reyhanitabar R, Vaudenay S, Viz\u00e1r D. Boosting OMD for almost free authentication of associated data. In: Proceedings of International Workshop on Fast Software Encryption. Berlin: Springer, 2015. 411\u2013427"},{"key":"3393_CR18","unstructured":"Cogliani S, Maimut D, Naccache D, et al. Offset Merkle-Damg\u00e5rd (OMD) version 1.0. 2016. http:\/\/competitions.cr.yp.to\/round1\/omdv10.pdf"},{"key":"3393_CR19","first-page":"33","volume-title":"Counter-in-tweak: authenticated encryption modes for tweakable block ciphers","author":"P Thomas","year":"2016","unstructured":"Thomas P, Yannick S. Counter-in-tweak: authenticated encryption modes for tweakable block ciphers. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2016. 33\u201363"},{"key":"3393_CR20","first-page":"247","volume-title":"The multi-user security of authenticated encryption: AES-GCM in TLS 1.3","author":"M Bellare","year":"2016","unstructured":"Bellare M, Tackmann B. The multi-user security of authenticated encryption: AES-GCM in TLS 1.3. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2016. 247\u2013276"},{"key":"3393_CR21","first-page":"396","volume-title":"Authenticated encryption with variable stretch","author":"R Reyhanitabar","year":"2016","unstructured":"Reyhanitabar R, Vaudenay S, Vizar D. Authenticated encryption with variable stretch. In: Advances in Cryptology\u2014ASIACRYPT 2016. Berlin: Springer, 2016. 396\u2013425"},{"key":"3393_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-46800-5_2","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2015","author":"V Hoang","year":"2015","unstructured":"Hoang V, Krovetz T, Rogaway P. Robust authenticated-encryption AEZ and the problem that it solves. In: Advances in Cryptology\u2014EUROCRYPT 2015. Berlin: Springer, 2015. 15\u201344"},{"key":"3393_CR23","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-319-70694-8_24","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2017","author":"G Barwell","year":"2017","unstructured":"Barwell G, Martin D P, Oswald E, et al. Authenticated encryption in the face of protocol and side channel leakage. In: Advances in Cryptology\u2014ASIACRYPT 2017. Berlin: Springer, 2017. 693\u2013732"},{"key":"3393_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-96884-1_7","volume-title":"Advances in Cryptology\u2014CRYPTO 2018","author":"M Barbosa","year":"2018","unstructured":"Barbosa M, Farshim P. Indifferentiable authenticated encryption. In: Advances in Cryptology\u2014CRYPTO 2018. Cham: Springer, 2018. 187\u2013220"},{"key":"3393_CR25","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-030-45721-1_21","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2020","author":"T Simon","year":"2020","unstructured":"Simon T, Batina L, Daemen J, et al. Friet: an authenticated encryption scheme with built-in fault detection. In: Advances in Cryptology\u2014EUROCRYPT 2020. Berlin: Springer, 2020. 581\u2013611"},{"key":"3393_CR26","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-662-52993-5_18","volume-title":"Fast Software Encryption","author":"Y Todo","year":"2016","unstructured":"Todo Y, Morii M. Bit-based division property and application to simon family. In: Fast Software Encryption. Berlin: Springer, 2016. 357\u2013377"},{"key":"3393_CR27","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-63697-9_9","volume-title":"Advances in Cryptology\u2014CRYPTO 2017","author":"Y Todo","year":"2017","unstructured":"Todo Y, Isobe T, Hao Y, et al. Cube attacks on non-blackbox polynomials based on division property. In: Advances in Cryptology\u2014CRYPTO 2017. Berlin: Springer, 2017. 250\u2013279"},{"key":"3393_CR28","first-page":"155","volume":"45","author":"P Zhang","year":"2015","unstructured":"Zhang P, Guan J, Li J, et al. Research on the confusion and diffusion properties of the initialization of MORUS. J Cryptol Res, 2015, 45: 155\u2013187","journal-title":"J Cryptol Res"},{"key":"3393_CR29","unstructured":"Dwiedi A D, Morawiecki P, W\u00f3jtowicz S. Differential and rotational cryptanalysis of round-reduced MORUS. In: Proceedings of International Conference on Security and Cryptography, 2017. 23\u201356"},{"key":"3393_CR30","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-16715-2_20","volume-title":"Topics in Cryptology\u2014CT-RSA 2015","author":"C Dobraunig","year":"2015","unstructured":"Dobraunig C, Eichlseder M, Mendel F, et al. Cryptanalysis of ascon. In: Topics in Cryptology\u2014CT-RSA 2015. Berlin: Springer, 2015. 371\u2013387"},{"key":"3393_CR31","unstructured":"Morawiecki P, Pieprzyk J, Straus M, et al. Applications of key recovery cube-attack-like. IACR Cryptology ePrint Archive, 2015. https:\/\/eprint.iacr.org\/2015\/1009"},{"key":"3393_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63697-9_1","volume-title":"Advances in Cryptology\u2014CRYPTO 2017","author":"T Ashur","year":"2017","unstructured":"Ashur T, Dunkelman O, Luykx A. Boosting authenticated encryption robustness with minimal modifications. In: Advances in Cryptology\u2014CRYPTO 2017. Berlin: Springer, 2017. 3\u201333"},{"key":"3393_CR33","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-53887-6_12","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2016","author":"R Bost","year":"2016","unstructured":"Bost R, Sanders O. Trick or tweak, on the (In)security of OTR\u2019s tweaks. In: Advances in Cryptology\u2014ASIACRYPT 2016. Berlin: Springer, 2016. 333\u2013353"},{"key":"3393_CR34","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-662-53887-6_13","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2016","author":"A Bay","year":"2016","unstructured":"Bay A, Ersoy O, Karakoc F. Universal forgery and key recovery attacks on ELmD authenticated encryption algorithm. In: Advances in Cryptology\u2014ASIACRYPT 2016. Berlin: Springer, 2016. 354\u2013368"},{"key":"3393_CR35","first-page":"155","volume-title":"Proceedings of Annual International Cryptology Conference","author":"Y Dodis","year":"2018","unstructured":"Dodis Y, Grubbs P, Ristenpart T, et al. Fast message franking: from invisible salamanders to encryptment. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2018. 155\u2013186"},{"key":"3393_CR36","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-63697-9_3","volume-title":"Advances in Cryptology\u2014CRYPTO 2017","author":"P Grubbs","year":"2017","unstructured":"Grubbs P, Lu J, Ristenpart T. Message franking via committing authenticated encryption. In: Advances in Cryptology\u2014CRYPTO 2017. Berlin: Springer, 2017. 66\u201397"},{"key":"3393_CR37","doi-asserted-by":"crossref","unstructured":"Ateniese G, Burns R C, Curtmola A R, et al. Provable data possession at untrusted stores. In: Proceedings of the ACM Conference on Computer and Communications Security, 2007. 598\u2013609","DOI":"10.1145\/1315245.1315318"},{"key":"3393_CR38","doi-asserted-by":"crossref","unstructured":"Juels A, Kaliski J B S. PORs: proofs of retrievability for large files. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, 2007. 584\u2013597","DOI":"10.1145\/1315245.1315317"},{"key":"3393_CR39","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","volume-title":"Advances in Cryptology\u2014CRYPTO 2008","author":"H Shacham","year":"2008","unstructured":"Shacham H, Waters B. Compact proofs of retrievability. In: Advances in Cryptology\u2014CRYPTO 2008. Berlin: Springer, 2008. 90\u2013107"},{"key":"3393_CR40","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/MNET.2010.5510914","volume":"24","author":"C Wang","year":"2010","unstructured":"Wang C, Ren K, Lou W, et al. Toward publicly auditable secure cloud data storage services. IEEE Network, 2010, 24: 19\u201324","journal-title":"IEEE Network"},{"key":"3393_CR41","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-34041-3_59","volume-title":"Information Computing and Applications","author":"C X Xu","year":"2012","unstructured":"Xu C X, He X H, Abraha D. Cryptanalysis of Wang\u2019s auditing protocol for data storage security in cloud computing. In: Information Computing and Applications. Berlin: Springer, 2012. 422\u2013428"},{"key":"3393_CR42","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1016\/j.compeleceng.2013.10.004","volume":"40","author":"S G Worku","year":"2014","unstructured":"Worku S G, Xu C X, Zhao J, et al. Secure and efficient privacy-preserving public auditing scheme for cloud storage. Comput Electrical Eng, 2014, 40: 1703\u20131713","journal-title":"Comput Electrical Eng"},{"key":"3393_CR43","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1049\/iet-ifs.2013.0322","volume":"9","author":"H Cui","year":"2015","unstructured":"Cui H, Mu Y, Au M H. Proof of retrievability with public verifiability resilient against related-key attacks. IET Inf Security, 2015, 9: 43\u201349","journal-title":"IET Inf Security"},{"key":"3393_CR44","first-page":"473","volume":"21","author":"H Liu","year":"2015","unstructured":"Liu H, Chen L, Davar Z, et al. Insecurity of an efficient privacy-preserving public auditing scheme for cloud data storage. J Univers Comput Sci, 2015, 21: 473\u2013482","journal-title":"J Univers Comput Sci"},{"key":"3393_CR45","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TIFS.2015.2400425","volume":"10","author":"J Yu","year":"2015","unstructured":"Yu J, Ren K, Wang C, et al. Enabling cloud storage auditing with key-exposure resistance. IEEE Trans Inform Forensic Secur, 2015, 10: 1167\u20131179","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR46","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1109\/TIFS.2016.2528500","volume":"11","author":"J Yu","year":"2016","unstructured":"Yu J, Ren K, Wang C. Enabling cloud storage auditing with verifiable outsourcing of key updates. IEEE Trans Inform Forensic Secur, 2016, 11: 1362\u20131375","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR47","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TCC.2014.2299807","volume":"2","author":"B Y Wang","year":"2014","unstructured":"Wang B Y, Li B C, Li H. Oruta: privacy-preserving public auditing for shared data in the cloud. IEEE Trans Cloud Comput, 2014, 2: 43\u201356","journal-title":"IEEE Trans Cloud Comput"},{"key":"3393_CR48","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10207-014-0263-8","volume":"14","author":"Y Yu","year":"2015","unstructured":"Yu Y, Au M H, Mu Y, et al. Enhanced privacy of a remote data integrity-checking protocol for secure cloud storage. Int J Inf Secur, 2015, 14: 307\u2013318","journal-title":"Int J Inf Secur"},{"key":"3393_CR49","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1109\/TIFS.2015.2416688","volume":"10","author":"J Liu","year":"2015","unstructured":"Liu J, Huang K, Rong H, et al. Privacy-preserving public auditing for regenerating-code-based cloud storage. IEEE Trans Inform Forensic Secur, 2015, 10: 1513\u20131528","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR50","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TSC.2013.2295611","volume":"8","author":"B Wang","year":"2015","unstructured":"Wang B, Li B, Li H. Panda: public auditing for shared data with efficient user revocation in the cloud. IEEE Trans Serv Comput, 2015, 8: 92\u2013106","journal-title":"IEEE Trans Serv Comput"},{"key":"3393_CR51","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jss.2015.11.044","volume":"113","author":"G Yang","year":"2016","unstructured":"Yang G, Yu J, Shen W, et al. Enabling public auditing for shared data in cloud storage supporting identity privacy and traceability. J Syst Software, 2016, 113: 130\u2013139","journal-title":"J Syst Software"},{"key":"3393_CR52","unstructured":"Chris E C, Alptekin K, Charalampos P, et al. Dynamic provable data possession. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2009. 213\u2013222"},{"key":"3393_CR53","doi-asserted-by":"publisher","first-page":"2609","DOI":"10.1109\/TC.2014.2375190","volume":"64","author":"C Liu","year":"2015","unstructured":"Liu C, Ranjan R, Yang C, et al. MuR-DPA: top-down levelled multi-replica merkle hash tree based secure public auditing for dynamic big data storage on cloud. IEEE Trans Comput, 2015, 64: 2609\u20132622","journal-title":"IEEE Trans Comput"},{"key":"3393_CR54","doi-asserted-by":"crossref","unstructured":"Chen X, Shang T, Kim I, et al. A remote data integrity checking scheme for big data storage. In: Proceedings of IEEE 2nd International Conference on Data Science in Cyberspace (DSC), 2017. 53\u201359","DOI":"10.1109\/DSC.2017.95"},{"key":"3393_CR55","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1109\/TPDS.2017.2784423","volume":"29","author":"M Sookhak","year":"2018","unstructured":"Sookhak M, Yu F R, Zomaya A Y. Auditing big data storage in cloud computing using divide and conquer tables. IEEE Trans Parallel Distrib Syst, 2018, 29: 999\u20131012","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3393_CR56","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00145-015-9216-2","volume":"30","author":"D Cash","year":"2017","unstructured":"Cash D, K\u00fcp\u00e7\u00fc A, Wichs D. Dynamic proofs of retrievability via oblivious RAM. J Cryptol, 2017, 30: 22\u201357","journal-title":"J Cryptol"},{"key":"3393_CR57","doi-asserted-by":"crossref","unstructured":"Wang B, Li B, Li H, et al. Certificateless public auditing for data integrity in the cloud. In: Proceedings of IEEE Conference on Communications and Network Security (CNS), 2013. 233\u2013239","DOI":"10.1109\/CNS.2013.6682701"},{"key":"3393_CR58","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/JSYST.2015.2428620","volume":"12","author":"D He","year":"2018","unstructured":"He D, Zeadally S, Wu L. Certificateless public auditing scheme for cloud-assisted wireless body area networks. IEEE Syst J, 2018, 12: 64\u201373","journal-title":"IEEE Syst J"},{"key":"3393_CR59","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TDSC.2015.2445752","volume":"14","author":"J Li","year":"2017","unstructured":"Li J, Squicciarini A C, Lin D, et al. MMBcloud-tree: authenticated index for verifiable cloud service selection. IEEE Trans Dependable Secure Comput, 2017, 14: 185\u2013198","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"3393_CR60","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TIFS.2018.2850312","volume":"14","author":"W Shen","year":"2019","unstructured":"Shen W, Qin J, Yu J, et al. Enabling identity-based integrity auditing and data sharing with sensitive information hiding for secure cloud storage. IEEE Trans Inform Forensic Secur, 2019, 14: 331\u2013346","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR61","doi-asserted-by":"crossref","unstructured":"Yang L, Xia L. An efficient and secure public batch auditing protocol for dynamic cloud storage data. In: Proceedings of International Computer Symposium (ICS), 2017. 671\u2013675","DOI":"10.1109\/ICS.2016.0138"},{"key":"3393_CR62","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1002\/cpe.3527","volume":"28","author":"H Bao","year":"2016","unstructured":"Bao H, Chen L. A lightweight privacy-preserving scheme with data integrity for smart grid communications. Concurr Computat-Pract Exper, 2016, 28: 1094\u20131110","journal-title":"Concurr Computat-Pract Exper"},{"key":"3393_CR63","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1016\/j.future.2018.04.018","volume":"108","author":"J Xu","year":"2020","unstructured":"Xu J, Wei L, Wu W, et al. Privacy-preserving data integrity verification by using lightweight streaming authenticated data structures for healthcare cyber-physical system. Future Gener Comput Syst, 2020, 108: 1287\u20131296","journal-title":"Future Gener Comput Syst"},{"key":"3393_CR64","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/978-3-030-64834-3_27","volume-title":"Advances in Cryptology\u2014ACIACRYPT 2020","author":"X Y Liu","year":"2020","unstructured":"Liu X Y, Liu S L, Gu D W, et al. Two-pass authenticated key exchange with explicit authentication and tight security. In: Advances in Cryptology\u2014ACIACRYPT 2020. Berlin: Springer, 2020. 785\u2013814"},{"key":"3393_CR65","first-page":"102713","volume":"57","author":"C J Mitchell","year":"2021","unstructured":"Mitchell C J. Yet another insecure group key distribution scheme using secret sharing. J Inf Secur Appl, 2021, 57: 102713","journal-title":"J Inf Secur Appl"},{"key":"3393_CR66","doi-asserted-by":"publisher","first-page":"01216","DOI":"10.1088\/1742-6596\/1754\/1\/012126","volume":"1754","author":"L Kong","year":"2021","unstructured":"Kong L, Zhai F, Zhao Y J, et al. Lightweight key management scheme for wireless communication system of distribution network. J Phys Conf Ser, 2021, 1754: 01216\u2013012134","journal-title":"J Phys Conf Ser"},{"key":"3393_CR67","doi-asserted-by":"publisher","first-page":"2000131","DOI":"10.1002\/qute.202000131","volume":"4","author":"G J Fan-Yuan","year":"2021","unstructured":"Fan-Yuan G J, Wang Z H, Wang S, et al. Optimizing decoy-state protocols for practical quantum key distribution systems. Adv Quantum Tech, 2021, 4: 2000131","journal-title":"Adv Quantum Tech"},{"key":"3393_CR68","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2021.02.024","volume":"863","author":"K Emura","year":"2021","unstructured":"Emura K, Seo J H, Watanabe Y. Efficient revocable identity-based encryption with short public parameters. Theor Comput Sci, 2021, 863: 127\u2013155","journal-title":"Theor Comput Sci"},{"key":"3393_CR69","first-page":"41","volume-title":"Public-Key Cryptography\u2014PKC 2019","author":"S Katsumata","year":"2019","unstructured":"Katsumata S, Matsuda T, Takayasu A. Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance. In: Public-Key Cryptography\u2014PKC 2019. Berlin: Springer, 2019. 41\u201371"},{"key":"3393_CR70","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0054122","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1998","author":"M Blaze","year":"1998","unstructured":"Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography. In: Advances in Cryptology\u2014EUROCRYPT 1998. Berlin: Springer, 1998. 127\u2013144"},{"key":"3393_CR71","first-page":"219","volume-title":"Public-Key Cryptography\u2014PKC 2018","author":"D David","year":"2018","unstructured":"David D, Stephan K, Thomas L, et al. Revisiting proxy re-encryption: forward secrecy, improved security, and applications. In: Public-Key Cryptography\u2014PKC 2018. Berlin: Springer, 2018. 219\u2013250"},{"key":"3393_CR72","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TDSC.2018.2877601","volume":"18","author":"H Guo","year":"2021","unstructured":"Guo H, Zhang Z F, Xu J, et al. Accountable proxy re-encryption for secure data sharing. IEEE Trans Dependable Secure Comput, 2021, 18: 145\u2013159","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"3393_CR73","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-72738-5_19","volume-title":"Applied Cryptography and Network Security","author":"M Green","year":"2007","unstructured":"Green M, Ateniese G. Identity-based proxy re-encryption. In: Applied Cryptography and Network Security. Berlin: Springer, 2007. 288\u2013306"},{"key":"3393_CR74","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/TC.2015.2417544","volume":"65","author":"P Xu","year":"2016","unstructured":"Xu P, Jiao T, Wu Q, et al. Conditional identity-based broadcast proxy re-encryption and its application to cloud email. IEEE Trans Comput, 2016, 65: 66\u201379","journal-title":"IEEE Trans Comput"},{"key":"3393_CR75","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1007\/s10623-018-0462-9","volume":"86","author":"C Ge","year":"2018","unstructured":"Ge C, Susilo W, Fang L, et al. A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system. Des Codes Cryptogr, 2018, 86: 2587\u20132603","journal-title":"Des Codes Cryptogr"},{"key":"3393_CR76","first-page":"125","volume":"47","author":"Y P Liu","year":"2019","unstructured":"Liu Y P, Ren Y J, Ge C P, et al. A CCA-secure multi-conditional proxy broadcast re-encryption scheme for cloud storage system. J Inf Secur Appl, 2019, 47: 125\u2013131","journal-title":"J Inf Secur Appl"},{"key":"3393_CR77","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1504\/IJES.2019.098296","volume":"11","author":"L M Fang","year":"2019","unstructured":"Fang L M, Wang J D, Ge C P, et al. Conditional proxy broadcast re-encryption with fine grain policy for cloud data sharing. Int J Embedded Syst, 2019, 11: 115\u2013124","journal-title":"Int J Embedded Syst"},{"key":"3393_CR78","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1109\/TDSC.2019.2899300","volume":"18","author":"C Ge","year":"2021","unstructured":"Ge C, Liu Z, Xia J, et al. Revocable identity-based broadcast proxy re-encryption for data sharing in clouds. IEEE Trans Dependable Secure Comput, 2021, 18: 1214\u20131226","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"3393_CR79","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1016\/j.future.2017.05.026","volume":"86","author":"Q Huang","year":"2018","unstructured":"Huang Q, Yang Y, Fu J. PRECISE: identity-based private data sharing with conditional proxy re-encryption in online social networks. Future Gener Comput Syst, 2018, 86: 1523\u20131533","journal-title":"Future Gener Comput Syst"},{"key":"3393_CR80","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.future.2016.10.013","volume":"71","author":"C Borcea","year":"2017","unstructured":"Borcea C, Gupta A B D, Polyakov Y, et al. PICADOR: end-to-end encrypted publish-subscribe information distribution with proxy re-encryption. Future Gener Comput Syst, 2017, 71: 177\u2013191","journal-title":"Future Gener Comput Syst"},{"key":"3393_CR81","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1007\/s11036-018-1060-9","volume":"24","author":"V Vijayakumar","year":"2019","unstructured":"Vijayakumar V, Priyan M K, Ushadevi G, et al. E-health cloud security using timing enabled proxy re-encryption. Mobile Netw Appl, 2019, 24: 1034\u20131045","journal-title":"Mobile Netw Appl"},{"key":"3393_CR82","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai A, Waters B. Fuzzy identity-based encryption. In: Advances in Cryptology\u2014EUROCRYPT 2005. Berlin: Springer, 2005. 457\u2013473"},{"key":"3393_CR83","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2011","unstructured":"Boneh D, Sahai A, Waters B. Functional encryption: definitions and challenges. In: Theory of Cryptography. Berlin: Springer, 2011. 253\u2013273"},{"key":"3393_CR84","first-page":"275","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1994","author":"B Mike","year":"1994","unstructured":"Mike B, Yvo D. A secure and efficient conference key distribution system. In: Advances in Cryptology\u2014EUROCRYPT 1994. Berlin: Springer, 1994. 275\u2013286"},{"key":"3393_CR85","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1049\/cje.2020.02.020","volume":"29","author":"Q K Zhang","year":"2020","unstructured":"Zhang Q K, Wang B L, Zhang X S, et al. Blockchain-based dynamic group key agreement protocol for ad hoc network. Chin J Electron, 2020, 29: 447\u2013454","journal-title":"Chin J Electron"},{"key":"3393_CR86","doi-asserted-by":"publisher","first-page":"4835","DOI":"10.3390\/s20174835","volume":"20","author":"Z S Xu","year":"2020","unstructured":"Xu Z S, Li F, Deng H, et al. A blockchain-based authentication and dynamic group key agreement protocol. Sensors, 2020, 20: 4835\u20134845","journal-title":"Sensors"},{"key":"3393_CR87","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1049\/iet-ifs.2019.0177","volume":"13","author":"J K Teng","year":"2019","unstructured":"Teng J K, Ma H Y. Dynamic asymmetric group key agreement protocol with traitor traceability. IET Inf Secur, 2019, 13: 703\u2013710","journal-title":"IET Inf Secur"},{"key":"3393_CR88","doi-asserted-by":"publisher","first-page":"e4179","DOI":"10.1002\/ett.4179","volume":"32","author":"Y Gan","year":"2021","unstructured":"Gan Y, Wang B, Zhuang Y, et al. An asymmetric group key agreement protocol based on attribute threshold for Internet of Things. Trans Emerging Tel Tech, 2021, 32: e4179","journal-title":"Trans Emerging Tel Tech"},{"key":"3393_CR89","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ins.2018.12.023","volume":"480","author":"Q K Zhang","year":"2019","unstructured":"Zhang Q K, Wang X M, Yuan J L, et al. A hierarchical group key agreement protocol using orientable attributes for cloud computing. Inf Sci, 2019, 480: 55\u201369","journal-title":"Inf Sci"},{"key":"3393_CR90","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10207-016-0339-8","volume":"16","author":"L Zhang","year":"2017","unstructured":"Zhang L, Wu Q H, Qin B, et al. Certificateless and identity-based authenticated asymmetric group key agreement. Int J Inf Secur, 2017, 16: 559\u2013576","journal-title":"Int J Inf Secur"},{"key":"3393_CR91","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3390\/info12030112","volume":"12","author":"Q N Chen","year":"2021","unstructured":"Chen Q N, Wu T, Hu C N, et al. An identity-based cross-domain authenticated asymmetric group key agreement. Information, 2021, 12: 112\u2013121","journal-title":"Information"},{"key":"3393_CR92","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-01001-9_10","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2009","author":"C Gentry","year":"2009","unstructured":"Gentry C, Waters B. Adaptive security in broadcast encryption systems (with short ciphertexts). In: Advances in Cryptology\u2014EUROCRYPT 2009. Berlin: Springer, 2009. 171\u2013188"},{"key":"3393_CR93","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-662-49099-0_9","volume-title":"Theory of Cryptography","author":"H Wee","year":"2016","unstructured":"Wee H. D\u00e9j\u00e0 Q: encore! Un petit IBE. In: Theory of Cryptography. Berlin: Springer, 2016. 237\u2013258"},{"key":"3393_CR94","first-page":"102736","volume":"58","author":"K Acharya","year":"2021","unstructured":"Acharya K, Dutta R. Constructing provable secure broadcast encryption scheme with dealership. J Inf Secur Appl, 2021, 58: 102736","journal-title":"J Inf Secur Appl"},{"key":"3393_CR95","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-30057-8_13","volume-title":"Public Key Cryptography\u2014PKC 2012","author":"B Libert","year":"2012","unstructured":"Libert B, Paterson K G, Quaglia E A. Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model. In: Public Key Cryptography\u2014PKC 2012. Berlin: Springer, 2012. 206\u2013224"},{"key":"3393_CR96","doi-asserted-by":"crossref","unstructured":"He K, Weng J, Liu J, et al. Anonymous identity-based broadcast encryption with chosen-ciphertext security. In: Proceedings of ACM on Asia Conference on Computer and Communications Security, 2016. 247\u2013255","DOI":"10.1145\/2897845.2897879"},{"key":"3393_CR97","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s00453-016-0242-8","volume":"79","author":"D Boneh","year":"2017","unstructured":"Boneh D, Zhandry M. Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Algorithmica, 2017, 79: 1233\u20131285","journal-title":"Algorithmica"},{"key":"3393_CR98","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00145-017-9258-8","volume":"31","author":"M Abdalla","year":"2018","unstructured":"Abdalla M, Bellare M, Neven G. Robust encryption. J Cryptol, 2018, 31: 307\u2013350","journal-title":"J Cryptol"},{"key":"3393_CR99","first-page":"102666","volume":"55","author":"M Mandal","year":"2020","unstructured":"Mandal M. Privacy-preserving fully anonymous ciphertext policy attribute-based broadcast encryption with constant-size secret keys and fast decryption. J Inf Secur Appl, 2020, 55: 102666","journal-title":"J Inf Secur Appl"},{"key":"3393_CR100","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.ins.2020.05.092","volume":"538","author":"L Q Chen","year":"2020","unstructured":"Chen L Q, Li J G, Lu Y, et al. Adaptively secure certificate-based broadcast encryption and its application to cloud storage service. Inf Sci, 2020, 538: 273\u2013289","journal-title":"Inf Sci"},{"key":"3393_CR101","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s11277-020-07606-6","volume":"115","author":"P Mishra","year":"2020","unstructured":"Mishra P, Renuka P, Verma V. Identity based broadcast encryption scheme with shorter decryption keys for open networks. Wireless Pers Commun, 2020, 115: 961\u2013969","journal-title":"Wireless Pers Commun"},{"key":"3393_CR102","doi-asserted-by":"crossref","unstructured":"Bethencourt J, Sahai A, Waters B. Ciphertext-policy attribute-based encryption. In: Proceedings of IEEE Symposium on Security and Privacy, 2007. 321\u2013334","DOI":"10.1109\/SP.2007.11"},{"key":"3393_CR103","unstructured":"Vipul G, Omkant P, Amit S, et al. Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2006. 89\u201398"},{"key":"3393_CR104","doi-asserted-by":"publisher","first-page":"050106","DOI":"10.1007\/s11432-016-5558-0","volume":"59","author":"Z F Cao","year":"2016","unstructured":"Cao Z F. New trends of information security\u2014how to change people\u2019s life style? Sci China Inf Sci, 2016, 59: 050106","journal-title":"Sci China Inf Sci"},{"key":"3393_CR105","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/TIFS.2012.2223683","volume":"8","author":"Z Liu","year":"2013","unstructured":"Liu Z, Cao Z F, Wong D S. White-box traceable ciphertext-policy attribute-based encryption supporting any monotone access structures. IEEE Trans Inform Forensic Secur, 2013, 8: 76\u201388","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR106","doi-asserted-by":"crossref","unstructured":"Liu Z, Cao Z, Wong D S. Blackbox traceable CP-ABE: how to catch people leaking their keys by selling decryption devices on an ebay. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2013. 475\u2013486","DOI":"10.1145\/2508859.2516683"},{"key":"3393_CR107","first-page":"276","volume-title":"Computer Security\u2014ESORICS 2016","author":"J Ning","year":"2016","unstructured":"Ning J, Cao Z, Dong X, et al. Traceable CP-ABE with short ciphertexts: how to catch people selling decryption devices on eBay efficiently. In: Computer Security\u2014ESORICS 2016. Berlin: Springer, 2016. 276\u2013288"},{"key":"3393_CR108","doi-asserted-by":"publisher","first-page":"032102","DOI":"10.1007\/s11432-016-9019-8","volume":"61","author":"K Zhang","year":"2018","unstructured":"Zhang K, Li H, Ma J F, et al. Efficient large-universe multi-authority ciphertext-policy attribute-based encryption with white-box traceability. Sci China Inf Sci, 2018, 61: 032102","journal-title":"Sci China Inf Sci"},{"key":"3393_CR109","doi-asserted-by":"crossref","unstructured":"Liang X, Cao Z, Lin H, et al. Attribute based proxy re-encryption with delegating capabilities. In: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, 2009. 276\u2013286","DOI":"10.1145\/1533057.1533094"},{"key":"3393_CR110","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s12204-011-1178-4","volume":"16","author":"J Qian","year":"2011","unstructured":"Qian J, Dong X. Fully secure revocable attribute-based encryption. J Shanghai Jiaotong Univ (Sci), 2011, 16: 490\u2013496","journal-title":"J Shanghai Jiaotong Univ (Sci)"},{"key":"3393_CR111","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-32009-5_13","volume-title":"Advances in Cryptology\u2014CRYPTO 2012","author":"A Sahai","year":"2012","unstructured":"Sahai A, Seyalioglu H, Waters H. Dynamic credentials and ciphertext delegation for attribute-based encryption. In: Advances in Cryptology\u2014CRYPTO 2012. Berlin: Springer, 2012. 199\u2013217"},{"key":"3393_CR112","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1109\/TPDS.2013.253","volume":"25","author":"K Yang","year":"2014","unstructured":"Yang K, Jia X. Expressive, efficient, and revocable data access control for multi-authority cloud storage. IEEE Trans Parallel Distrib Syst, 2014, 25: 1735\u20131744","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3393_CR113","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1109\/TSC.2016.2520932","volume":"10","author":"J Li","year":"2017","unstructured":"Li J, Yao W, Zhang Y, et al. Flexible and fine-grained attribute-based data storage in cloud computing. IEEE Trans Serv Comput, 2017, 10: 785\u2013796","journal-title":"IEEE Trans Serv Comput"},{"key":"3393_CR114","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-319-45741-3_29","volume-title":"Computer Security\u2014ESORICS 2016","author":"H Cui","year":"2016","unstructured":"Cui H, Deng R H, Li Y J, et al. Server-aided revocable attribute-based encryption. In: Computer Security\u2014ESORICS 2016. Berlin: Springer, 2016. 570\u2013587"},{"key":"3393_CR115","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ins.2019.03.053","volume":"490","author":"B D Qin","year":"2019","unstructured":"Qin B D, Zhao Q L, Zheng D, et al. (Dual) server-aided revocable attribute-based encryption with decryption key exposure resistance. Inf Sci, 2019, 490: 74\u201392","journal-title":"Inf Sci"},{"key":"3393_CR116","doi-asserted-by":"publisher","first-page":"e5680","DOI":"10.1002\/cpe.5680","volume":"32","author":"H Cui","year":"2020","unstructured":"Cui H, Yuen T H, Deng R H, et al. Server-aided revocable attribute-based encryption for cloud computing services. Concurr Computat Pract Exper, 2020, 32: e5680","journal-title":"Concurr Computat Pract Exper"},{"key":"3393_CR117","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-70936-7_28","volume-title":"Theory of Cryptography","author":"M Chase","year":"2007","unstructured":"Chase M. Multi-authority attribute based encryption. In: Theory of Cryptography. Berlin: Springer, 2007. 515\u2013534"},{"key":"3393_CR118","doi-asserted-by":"publisher","first-page":"220","DOI":"10.23919\/JCC.2020.08.018","volume":"17","author":"S L Zhou","year":"2020","unstructured":"Zhou S L, Chen G X, Huang G J, et al. Research on multi-authority CP-ABE access control model in multicloud. China Commun, 2020, 17: 220\u2013233","journal-title":"China Commun"},{"key":"3393_CR119","first-page":"102503","volume":"53","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Roy S, Odelu V, et al. Multi-authority CP-ABE-based user access control scheme with constant-size key and ciphertext for IoT deployment. J Inf Secur Appl, 2020, 53: 102503","journal-title":"J Inf Secur Appl"},{"key":"3393_CR120","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1049\/cje.2019.10.006","volume":"29","author":"Q Q Zhao","year":"2020","unstructured":"Zhao Q Q, Wu G F, Ma H, et al. Black-box and public traceability in multi-authority attribute based encryption. Chin J Electron, 2020, 29: 106\u2013113","journal-title":"Chin J Electron"},{"key":"3393_CR121","doi-asserted-by":"crossref","unstructured":"Okamoto T, Takashima K. Decentralized attribute-based encryption and signatures. IEICE Trans Fundamentals, 2020, E103.A: 41\u201373","DOI":"10.1587\/transfun.2019CIP0008"},{"key":"3393_CR122","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1109\/TIFS.2015.2419186","volume":"10","author":"K T Liang","year":"2015","unstructured":"Liang K T, Susilo W, Liu J K. Privacy-preserving ciphertext multi-sharing control for big data storage. IEEE Trans Inform Forensic Secur, 2015, 10: 1578\u20131589","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR123","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.1109\/TIFS.2015.2442215","volume":"10","author":"K T Liang","year":"2015","unstructured":"Liang K T, Susilo W. Searchable attribute-based mechanism with efficient data sharing for secure cloud storage. IEEE Trans Inform Forensic Secur, 2015, 10: 1981\u20131992","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR124","first-page":"211","volume":"27","author":"X Xu","year":"2016","unstructured":"Xu X, Zhou J, Wang X. Multi-authority proxy re-encryption based on CPABE for cloud storage systems. J Syst Eng Electron, 2016, 27: 211\u2013223","journal-title":"J Syst Eng Electron"},{"key":"3393_CR125","unstructured":"Gorbunov S, Vaikuntanathan V, Wee H. Attribute-based encryption for circuits. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, 2015. 545\u2013554"},{"key":"3393_CR126","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1109\/TIFS.2016.2523941","volume":"11","author":"S Wang","year":"2016","unstructured":"Wang S, Zhou J, Liu J K, et al. An efficient file hierarchy attribute-based encryption scheme in cloud computing. IEEE Trans Inform Forensic Secur, 2016, 11: 1265\u20131277","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR127","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1109\/TITS.2017.2653103","volume":"18","author":"Y Xia","year":"2017","unstructured":"Xia Y, Chen W, Liu X, et al. Adaptive multimedia data forwarding for privacy preservation in vehicular Ad-Hoc networks. IEEE Trans Intell Transp Syst, 2017, 18: 2629\u20132641","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"3393_CR128","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TNET.2019.2894625","volume":"27","author":"H Cui","year":"2019","unstructured":"Cui H, Deng R H, Wang G. An attribute-based framework for secure communications in vehicular ad hoc networks. IEEE\/ACM Trans Networking, 2019, 27: 721\u2013733","journal-title":"IEEE\/ACM Trans Networking"},{"key":"3393_CR129","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ins.2016.06.035","volume":"379","author":"X H Liu","year":"2017","unstructured":"Liu X H, Liu Q, Peng T, et al. Dynamic access policy in cloud-based personal health record (PHR) systems. Inf Sci, 2017, 379: 62\u201381","journal-title":"Inf Sci"},{"key":"3393_CR130","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1504\/IJBET.2019.097624","volume":"29","author":"J Athena","year":"2019","unstructured":"Athena J, Sumathy V. TBAC: tree-based access control approach for secure access of PHR in cloud. Int J Biomed Eng Technol, 2019, 29: 246\u2013272","journal-title":"Int J Biomed Eng Technol"},{"key":"3393_CR131","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2007","unstructured":"Boneh D, Waters B. Conjunctive, subset, and range queries on encrypted data. In: Theory of Cryptography. Berlin: Springer, 2007. 535\u2013554"},{"key":"3393_CR132","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10623-015-0131-1","volume":"77","author":"T Okamoto","year":"2015","unstructured":"Okamoto T, Takashima K. Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. Des Codes Cryptogr, 2015, 77: 725\u2013771","journal-title":"Des Codes Cryptogr"},{"key":"3393_CR133","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.3390\/s21062024","volume":"21","author":"T Gaybullaev","year":"2021","unstructured":"Gaybullaev T, Kwon H Y, Kim T, et al. Efficient and privacy-preserving energy trading on blockchain using dual binary encoding for inner product encryption. Sensors, 2021, 21: 2024","journal-title":"Sensors"},{"key":"3393_CR134","first-page":"595","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2015","author":"C Jie","year":"2015","unstructured":"Jie C, Gay R, Wee H. Improved dual system ABE in prime-order groups via predicate encodings. In: Advances in Cryptology\u2014EUROCRYPT 2015. Berlin: Springer, 2015. 595\u2013624"},{"key":"3393_CR135","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1093\/comjnl\/bxz079","volume":"62","author":"S Ling","year":"2019","unstructured":"Ling S, Nguyen K, Wang H, et al. Server-aided revocable predicate encryption: formalization and lattice-based instantiation. Comput J, 2019, 62: 49\u201362","journal-title":"Comput J"},{"key":"3393_CR136","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1504\/IJACT.2020.107163","volume":"4","author":"M Nandi","year":"2020","unstructured":"Nandi M, Pandit T. Delegation-based conversion from CPA to CCA-secure predicate encryption. Int J Appl Cryptogr, 2020, 4: 16","journal-title":"Int J Appl Cryptogr"},{"key":"3393_CR137","doi-asserted-by":"crossref","unstructured":"Naveed M, Agrawal S, Prabhakaran M, et al. Controlled functional encryption. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2014. 1280\u20131291","DOI":"10.1145\/2660267.2660291"},{"key":"3393_CR138","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2478\/popets-2021-0003","volume":"2021","author":"M Ambrona","year":"2021","unstructured":"Ambrona M, Fiore D, Soriente C. Controlled functional encryption revisited: multi-authority extensions and efficient schemes for quadratic functions. Proc Privacy Enhancing Technol, 2021, 2021: 21\u201342","journal-title":"Proc Privacy Enhancing Technol"},{"key":"3393_CR139","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00145-019-09337-9","volume":"33","author":"N Bitansky","year":"2020","unstructured":"Bitansky N, Nishimaki R, Passel\u00e9gue A, et al. From cryptomania to obfustopia through secret-key functional encryption. J Cryptol, 2020, 33: 357\u2013405","journal-title":"J Cryptol"},{"key":"3393_CR140","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-319-63688-7_20","volume-title":"Advances in Cryptology\u2014CRYPTO 2017","author":"H Lin","year":"2017","unstructured":"Lin H. Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Advances in Cryptology\u2014CRYPTO 2017. Berlin: Springer, 2017. 599\u2013629"},{"key":"3393_CR141","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1007\/s10623-021-00854-y","volume":"89","author":"W Cho","year":"2021","unstructured":"Cho W, Kim J, Lee C. (In)security of concrete instantiation of Lin17\u2019s functional encryption scheme from noisy multilinear maps. Des Codes Cryptogr, 2021, 89: 973\u20131016","journal-title":"Des Codes Cryptogr"},{"key":"3393_CR142","doi-asserted-by":"crossref","unstructured":"Agrawal R, Kiernan J, Srikant R, et al. Order-preserving encryption for numeric data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004. 563\u2013574","DOI":"10.1145\/1007568.1007632"},{"key":"3393_CR143","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-01001-9_13","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2009","author":"A Boldyreva","year":"2009","unstructured":"Boldyreva A, Chenette N, Lee Y, et al. Order-preserving symmetric encryption. In: Advances in Cryptology\u2014EUROCRYPT 2009. Berlin: Springer, 2009. 224\u2013241"},{"key":"3393_CR144","doi-asserted-by":"crossref","unstructured":"Popa R A, Li F H, Zeldovich N. An ideal-security protocol for order-preserving encoding. In: Proceedings of IEEE Symposium on Security and Privacy, 2013. 463\u2013477","DOI":"10.1109\/SP.2013.38"},{"key":"3393_CR145","doi-asserted-by":"crossref","unstructured":"Kerschbaum F. Frequency-hiding order-preserving encryption. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2015. 656\u2013667","DOI":"10.1145\/2810103.2813629"},{"key":"3393_CR146","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-46803-6_19","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2015","author":"D Boneh","year":"2015","unstructured":"Boneh D, Lewi K, Raykova M, et al. Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: Advances in Cryptology\u2014EUROCRYPT 2015. Berlin: Springer, 2015. 563\u2013594"},{"key":"3393_CR147","first-page":"102391","volume":"49","author":"J Dyer","year":"2019","unstructured":"Dyer J, Dyer M, Djemame K. Order-preserving encryption using approximate common divisors. J Inf Secur Appl, 2019, 49: 102391","journal-title":"J Inf Secur Appl"},{"key":"3393_CR148","doi-asserted-by":"crossref","unstructured":"Naveed M, Kamara S, Wright C V. Inference attacks on property-preserving encrypted databases. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2015. 644\u2013655","DOI":"10.1145\/2810103.2813651"},{"key":"3393_CR149","unstructured":"Song D X, Wagner D, Perrig A. Practical techniques for searches on encrypted data. In: Proceedings of IEEE Symposium on Security and Privacy, 2000. 44\u201355"},{"key":"3393_CR150","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh D, Crescenzo G D, Ostrovsky R, et al. Public key encryption with keyword search. In: Advances in Cryptology\u2014EUROCRYPT 2004. Berlin: Springer, 2004. 506\u2013522"},{"key":"3393_CR151","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11535218_13","volume-title":"Advances in Cryptology\u2014CRYPTO 2005","author":"M Abdalla","year":"2005","unstructured":"Abdalla M, Bellare M, Catalano D, et al. Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. In: Advances in Cryptology\u2014CRYPTO 2005. Berlin: Springer, 2005. 205\u2013222"},{"key":"3393_CR152","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","volume":"27","author":"Z Xia","year":"2016","unstructured":"Xia Z, Wang X, Sun X, et al. A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst, 2016, 27: 340\u2013352","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3393_CR153","first-page":"102824","volume":"59","author":"A A A M Kamal","year":"2021","unstructured":"Kamal A A A M, Iwamura K. Searchable encryption using secret sharing scheme that realizes direct search of encrypted documents and disjunctive search of multiple keywords. J Inf Secur Appl, 2021, 59: 102824","journal-title":"J Inf Secur Appl"},{"key":"3393_CR154","doi-asserted-by":"crossref","unstructured":"Wang B, Yu S, Lou W, et al. Privacy-preserving multikeyword fuzzy search over encrypted data in the cloud. In: Proceedings of IEEE Conference on Computer Communications, 2014. 2112\u20132120","DOI":"10.1109\/INFOCOM.2014.6848153"},{"key":"3393_CR155","doi-asserted-by":"publisher","first-page":"2706","DOI":"10.1109\/TIFS.2016.2596138","volume":"11","author":"Z Fu","year":"2016","unstructured":"Fu Z, Wu X, Guan C, et al. Toward efficient multi-keyword fuzzy search over encrypted outsourced data with accuracy improvement. IEEE Trans Inform Forensic Secur, 2016, 11: 2706\u20132716","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR156","doi-asserted-by":"publisher","first-page":"28","DOI":"10.3390\/fi8030028","volume":"8","author":"M Strizhov","year":"2016","unstructured":"Strizhov M, Osman Z, Ray I. Substring position search over encrypted cloud data supporting efficient multi-user setup. Future Internet, 2016, 8: 28\u201335","journal-title":"Future Internet"},{"key":"3393_CR157","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-29485-8_5","volume-title":"Topics in Cryptology\u2014CTRSA 2016","author":"S Gajek","year":"2016","unstructured":"Gajek S. Dynamic symmetric searchable encryption from constrained functional encryption. In: Topics in Cryptology\u2014CTRSA 2016. Berlin: Springer, 2016. 75\u201389"},{"key":"3393_CR158","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ins.2017.03.037","volume":"403\u2013404","author":"X Jiang","year":"2017","unstructured":"Jiang X, Yu J, Yan J, et al. Enabling efficient and verifiable multi-keyword ranked search over encrypted cloud data. Inf Sci, 2017, 403\u2013404: 22\u201341","journal-title":"Inf Sci"},{"key":"3393_CR159","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.future.2017.02.024","volume":"78","author":"Z Liu","year":"2018","unstructured":"Liu Z, Li T, Li P, et al. Verifiable searchable encryption with aggregate keys for data sharing system. Future Gener Comput Syst, 2018, 78: 778\u2013788","journal-title":"Future Gener Comput Syst"},{"key":"3393_CR160","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1587\/transinf.E97.D.1790","volume":"97","author":"F Zhao","year":"2014","unstructured":"Zhao F, Nishide T, Sakurai K. Fine-grained access control aware multi-user data sharing with secure keyword search. IEICE Trans Inf Syst, 2014, 97: 1790\u20131803","journal-title":"IEICE Trans Inf Syst"},{"key":"3393_CR161","doi-asserted-by":"crossref","unstructured":"Sun W, Yu S, Lou W, et al. Protecting your right: attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. In: Proceedings of IEEE Conference on Computer Communications, 2014. 226\u2013234","DOI":"10.1109\/INFOCOM.2014.6847943"},{"key":"3393_CR162","doi-asserted-by":"publisher","first-page":"1943","DOI":"10.1109\/TIFS.2014.2359389","volume":"9","author":"Q Tang","year":"2014","unstructured":"Tang Q. Nothing is for free: security in searching shared and encrypted data. IEEE Trans Inform Forensic Secur, 2014, 9: 1943\u20131952","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR163","unstructured":"Popa R, Zeldovich N. Multi-key searchable encryption. IACR Cryptology ePrint Archive, 2013. https:\/\/eprint.iacr.org\/2013\/508\/20130817:204810"},{"key":"3393_CR164","doi-asserted-by":"publisher","first-page":"052105","DOI":"10.1007\/s11432-015-5449-9","volume":"60","author":"S Qiu","year":"2017","unstructured":"Qiu S, Liu J Q, Shi Y F, et al. Hidden policy ciphertext-policy attribute-based encryption with keyword search against keyword guessing attack. Sci China Inf Sci, 2017, 60: 052105","journal-title":"Sci China Inf Sci"},{"key":"3393_CR165","doi-asserted-by":"publisher","first-page":"e5291","DOI":"10.1002\/cpe.5291","volume":"32","author":"Mamta","year":"2020","unstructured":"Mamta, Gupta B B. An efficient KP design framework of attribute-based searchable encryption for user level revocation in cloud. Concurr Computat Pract Exper, 2020, 32: e5291","journal-title":"Concurr Computat Pract Exper"},{"key":"3393_CR166","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1587\/transfun.2019CIP0014","volume":"103","author":"J Hayata","year":"2020","unstructured":"Hayata J, Ishizaka M, Sakai Y, et al. Generic construction of adaptively secure anonymous key-policy attribute-based encryption from public-key searchable encryption. IEICE Trans Fundamentals, 2020, 103: 107\u2013113","journal-title":"IEICE Trans Fundamentals"},{"key":"3393_CR167","unstructured":"Bost R. \u03a3\u03bf\u03a6\u03bf\u03b6: forward secure searchable encryption. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2016. 1143\u20131154"},{"key":"3393_CR168","doi-asserted-by":"crossref","unstructured":"Kim K S, Kim M, Lee D, et al. Forward secure dynamic searchable symmetric encryption with efficient updates. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2017. 1449\u20131463","DOI":"10.1145\/3133956.3133970"},{"key":"3393_CR169","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.future.2016.05.017","volume":"72","author":"Z Deng","year":"2017","unstructured":"Deng Z, Li K L, Li K Q, et al. A multi-user searchable encryption scheme with keyword authorization in a cloud storage. Future Gener Comput Syst, 2017, 72: 208\u2013218","journal-title":"Future Gener Comput Syst"},{"key":"3393_CR170","doi-asserted-by":"crossref","unstructured":"Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"3393_CR171","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography\u2014PKC 2010","author":"N P Smart","year":"2010","unstructured":"Smart N P, Vercauteren F. Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Public Key Cryptography\u2014PKC 2010. Berlin: Springer, 2010. 420\u2013443"},{"key":"3393_CR172","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011. 97\u2013106","DOI":"10.1109\/FOCS.2011.12"},{"key":"3393_CR173","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) Fully homomorphic encryption without bootstrapping. ACM Trans Comput Theor, 2014, 6: 1\u201336","journal-title":"ACM Trans Comput Theor"},{"key":"3393_CR174","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology\u2014CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski Z. Fully homomorphic encryption without modulus switching from classical GapSVP. In: Advances in Cryptology\u2014CRYPTO 2012. Berlin: Springer, 2012. 868\u2013886"},{"key":"3393_CR175","first-page":"75","volume-title":"Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based","author":"C Gentry","year":"2013","unstructured":"Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Proceedings of Annual Cryptology Conference. Berlin: Springer, 2013. 75\u201392"},{"key":"3393_CR176","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-662-44371-2_17","volume-title":"Advances in Cryptology\u2014CRYPTO 2014","author":"J Alperin-Sheriff","year":"2014","unstructured":"Alperin-Sheriff J, Peikert C. Faster bootstrapping with polynomial error. In: Advances in Cryptology\u2014CRYPTO 2014. Berlin: Springer, 2014. 297\u2013314"},{"key":"3393_CR177","first-page":"845","volume":"7","author":"Z Li","year":"2021","unstructured":"Li Z, Ma C, Wang D. Leakage resilient leveled FHE on multiple bit message. IEEE Trans Big Data, 2021, 7: 845\u2013858","journal-title":"IEEE Trans Big Data"},{"key":"3393_CR178","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1049\/iet-ifs.2018.5427","volume":"13","author":"F C Luo","year":"2019","unstructured":"Luo F C, Wang F Q, Wang K P, et al. Fully homomorphic encryption based on the ring learning with rounding problem. IET Inf Secur, 2019, 13: 639\u2013648","journal-title":"IET Inf Secur"},{"key":"3393_CR179","doi-asserted-by":"publisher","first-page":"5217","DOI":"10.1007\/s12652-020-01849-8","volume":"11","author":"A Amuthan","year":"2020","unstructured":"Amuthan A, Sendhil R. Hybrid GSW and DM based fully homomorphic encryption scheme for handling false data injection attacks under privacy preserving data aggregation in fog computing. J Ambient Intell Human Comput, 2020, 11: 5217\u20135231","journal-title":"J Ambient Intell Human Comput"},{"key":"3393_CR180","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology\u2014 EUROCRYPT 2010","author":"M van Dijk","year":"2010","unstructured":"van Dijk M, Gentry C, Halevi S. Fully homomorphic encryption over the integers. In: Advances in Cryptology\u2014 EUROCRYPT 2010. Berlin: Springer, 2010. 24\u201343"},{"key":"3393_CR181","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-38348-9_20","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2013","author":"J H Cheon","year":"2013","unstructured":"Cheon J H, Coron J S, Kim J, et al. Batch fully homomorphic encryption over the integers. In: Advances in Cryptology\u2014EUROCRYPT 2013. Berlin: Springer, 2013. 315\u2013335"},{"key":"3393_CR182","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-662-46800-5_20","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2015","author":"J H Cheon","year":"2015","unstructured":"Cheon J H, Stehl\u00e9 D. Fully homomophic encryption over the integers revisited. In: Advances in Cryptology\u2014EUROCRYPT 2015. Berlin: Springer, 2015. 513\u2013536"},{"key":"3393_CR183","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-662-54388-7_10","volume-title":"Public-Key Cryptography\u2014PKC 2017","author":"D Benarroch","year":"2017","unstructured":"Benarroch D, Brakerski Z, Lepoint T. FHE over the integers: decomposed and batched in the post-quantum regime. In: Public-Key Cryptography\u2014PKC 2017. Berlin: Springer, 2017. 271\u2013301"},{"key":"3393_CR184","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2018.11.014","volume":"771","author":"K M M Aung","year":"2019","unstructured":"Aung K M M, Lee H T, Tan B H M, et al. Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem. Theor Comput Sci, 2019, 771: 49\u201370","journal-title":"Theor Comput Sci"},{"key":"3393_CR185","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10207-019-00427-0","volume":"18","author":"J Dyer","year":"2019","unstructured":"Dyer J, Dyer M, Xu J. Practical homomorphic encryption over the integers for secure computation in the cloud. Int J Inf Secur, 2019, 18: 549\u2013579","journal-title":"Int J Inf Secur"},{"key":"3393_CR186","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-319-70694-8_14","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2017","author":"I Chillotti","year":"2017","unstructured":"Chillotti I, Gama N, Georgieva M, et al. Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE. In: Advances in Cryptology\u2014ASIACRYPT 2017. Berlin: Springer, 2017. 377\u2013408"},{"key":"3393_CR187","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-76578-5_5","volume-title":"Public-Key Cryptography\u2014PKC 2018","author":"Y Dor\u00fcz","year":"2018","unstructured":"Dor\u00fcz Y, Hoffstein J, Pipher J, et al. Fully homomorphic encryption from the finite field isomorphism problem. In: Public-Key Cryptography\u2014PKC 2018. Berlin: Springer, 2018. 125\u2013155"},{"key":"3393_CR188","first-page":"213","volume-title":"Public-Key Cryptography\u2014PKC 2017","author":"C Ran","year":"2017","unstructured":"Ran C, Raghuraman S, Richelson S, et al. Chosen-ciphertext secure fully homomorphic encryption. In: Public-Key Cryptography\u2014PKC 2017. Berlin: Springer, 2017. 213\u2013240"},{"key":"3393_CR189","first-page":"373","volume-title":"Provable Security","author":"Z Li","year":"2016","unstructured":"Li Z, Galbraith S D, Ma C. Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme. In: Provable Security. Berlin: Springer, 2016. 373\u2013383"},{"key":"3393_CR190","first-page":"93","volume-title":"Faster homomorphic linear transformations in HElib","author":"S Halevi","year":"2018","unstructured":"Halevi S, Shoup V. Faster homomorphic linear transformations in HElib. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2018. 93\u2013120"},{"key":"3393_CR191","doi-asserted-by":"publisher","unstructured":"Zhou J, Choo K K R, Cao Z, et al. PVOPM: verifiable privacy-preserving pattern matching with efficient outsourcing in the malicious setting. IEEE Trans Dependable Secure Comput, 2019. doi: https:\/\/doi.org\/10.1109\/TDSC.2019.2947436","DOI":"10.1109\/TDSC.2019.2947436"},{"key":"3393_CR192","first-page":"565","volume-title":"Threshold cryptosystems from threshold fully homomorphic encryption","author":"D Boneh","year":"2018","unstructured":"Boneh D, Gennaro R, Goldfeder S, et al. Threshold cryptosystems from threshold fully homomorphic encryption. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2018. 565\u2013596"},{"key":"3393_CR193","doi-asserted-by":"publisher","first-page":"e22555","DOI":"10.2196\/22555","volume":"22","author":"Y Lu","year":"2020","unstructured":"Lu Y, Zhou T, Tian Y, et al. Web-based privacy-preserving multicenter medical data analysis tools via threshold homomorphic encryption: design and development study. J Med Internet Res, 2020, 22: e22555","journal-title":"J Med Internet Res"},{"key":"3393_CR194","unstructured":"Adriana L A, Tromer E, Vaikuntanathan V. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, 2012. 1219\u20131234"},{"key":"3393_CR195","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1142\/S012905412050001X","volume":"31","author":"E Kim","year":"2020","unstructured":"Kim E, Lee H S, Park J. Towards round-optimal secure multiparty computations: multikey FHE without a CRS. Int J Found Comput Sci, 2020, 31: 157\u2013174","journal-title":"Int J Found Comput Sci"},{"key":"3393_CR196","doi-asserted-by":"publisher","first-page":"564","DOI":"10.26599\/TST.2019.9010076","volume":"25","author":"X L Che","year":"2020","unstructured":"Che X L, Zhou T P, Li N B, et al. Modified multi-key fully homomorphic encryption based on NTRU cryptosystem without key-switching. Tinshhua Sci Technol, 2020, 25: 564\u2013578","journal-title":"Tinshhua Sci Technol"},{"key":"3393_CR197","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-63697-9_6","volume-title":"Advances in Cryptology\u2014CRYPTO 2017","author":"S Yamada","year":"2017","unstructured":"Yamada S. Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: Advances in Cryptology\u2014CRYPTO 2017. Berlin: Springer, 2017. 161\u2013193"},{"key":"3393_CR198","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-030-17253-4_17","volume-title":"Public-Key Cryptography\u2014PKC 2019","author":"M Clear","year":"2019","unstructured":"Clear M, Mcgoldrick C. Additively homomorphic IBE from higher residuosity. In: Public-Key Cryptography\u2014PKC 2019. Berlin: Springer, 2019. 496\u2013515"},{"key":"3393_CR199","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-662-53644-5_13","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2016","unstructured":"Brakerski Z, Cash D, Tsabary R, et al. Targeted homomorphic attribute-based encryption. In: Theory of Cryptography. Berlin: Springer, 2016. 330\u2013360"},{"key":"3393_CR200","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-17653-2_7","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2019","author":"S Agrawal","year":"2019","unstructured":"Agrawal S. Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation. In: Advances in Cryptology\u2014EUROCRYPT 2019. Berlin: Springer, 2019. 191\u2013225"},{"key":"3393_CR201","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-17653-2_9","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2019","author":"A Jain","year":"2019","unstructured":"Jain A, Lin H, Christian M, et al. How to leverage hardness of constant-degree expanding polynomials overaRto build iO. In: Advances in Cryptology\u2014EUROCRYPT 2019. Berlin: Springer, 2019. 251\u2013281"},{"key":"3393_CR202","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-662-54388-7_17","volume-title":"Public-Key Cryptography\u2014PKC 2017","author":"D Boneh","year":"2017","unstructured":"Boneh D, Lewi K, Wu D J. Constraining pseudorandom functions privately. In: Public-Key Cryptography\u2014PKC 2017. Berlin: Springer, 2017. 494\u2013524"},{"key":"3393_CR203","first-page":"79","volume-title":"Candidate iO from homomorphic encryption schemes","author":"Z Brakerski","year":"2020","unstructured":"Brakerski Z, D\u00f6ttling N, Garg S, et al. Candidate iO from homomorphic encryption schemes. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2020. 79\u2013109"},{"key":"3393_CR204","doi-asserted-by":"crossref","unstructured":"Yao A C. Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), Chicago, 1982. 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"3393_CR205","volume-title":"Foundations of Cryptography: Volume 2, Basic Applications","author":"O Goldreich","year":"2009","unstructured":"Goldreich O. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge: Cambridge University Press, 2009"},{"key":"3393_CR206","unstructured":"Rabin M O. How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive, 2005. http:\/\/eprint.iacr.org\/2005\/187"},{"key":"3393_CR207","first-page":"131","volume-title":"Advances in Intelligent Systems & Computing","author":"M Kumar","year":"2015","unstructured":"Kumar M, Praveen I. A fully simulatable oblivious transfer scheme using vector decomposition. In: Advances in Intelligent Systems & Computing. New Delhi: Springer, 2015. 309: 131\u2013137"},{"key":"3393_CR208","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology\u2014CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert C, Vaikuntanathan V, Waters B. A framework for efficient and composable oblivious transfer. In: Advances in Cryptology\u2014CRYPTO 2008. Berlin: Springer, 2008. 554\u2013571"},{"key":"3393_CR209","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/TIFS.2014.2322257","volume":"9","author":"F Guo","year":"2014","unstructured":"Guo F, Mu Y, Susilo W. Subset membership encryption and its applications to oblivious transfer. IEEE Trans Inform Forensic Secur, 2014, 9: 1098\u20131107","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR210","first-page":"119","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2020","author":"N Dttling","year":"2020","unstructured":"Dttling N, Garg S, Hajiabadi M, et al. Two-round oblivious transfer from CDH or LPN. In: Advances in Cryptology\u2014EUROCRYPT 2020. Berlin: Springer, 2020. 119\u2013135"},{"key":"3393_CR211","first-page":"235","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2020","author":"V Goyal","year":"2020","unstructured":"Goyal V, Jain A, Jin Z, et al. Statistical zaps and new oblivious transfer protocols. In: Advances in Cryptology\u2014EUROCRYPT 2020. Berlin: Springer, 2020. 235\u2013270"},{"key":"3393_CR212","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-52153-4_22","volume-title":"Topics in Cryptology\u2014CT-RSA 2017","author":"M Orr\u00fa","year":"2017","unstructured":"Orr\u00fa M, Orsini E, Scholl P. Actively secure 1-out-of-N OT extension with application to private set intersection. In: Topics in Cryptology\u2014CT-RSA 2017. Berlin: Springer, 2017. 381\u2013396"},{"key":"3393_CR213","doi-asserted-by":"crossref","unstructured":"Patra A, Sarkar P, Suresh A. Fast actively secure OT extension for short secrets. In: Proceedings of Network and Distributed System Symposium, 2017. 131\u2013154","DOI":"10.14722\/ndss.2017.23089"},{"key":"3393_CR214","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.compeleceng.2019.01.021","volume":"75","author":"B Mi","year":"2019","unstructured":"Mi B, Huang D, Wan S, et al. A post-quantum light weight 1-out-n oblivious transfer protocol. Comput Electrical Eng, 2019, 75: 90\u2013100","journal-title":"Comput Electrical Eng"},{"key":"3393_CR215","doi-asserted-by":"crossref","unstructured":"Yao C C. How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986. 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"3393_CR216","doi-asserted-by":"crossref","unstructured":"Bellare M, Hoang V T, Rogaway P. Foundations of garbled circuits. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2012. 784\u2013796","DOI":"10.1145\/2382196.2382279"},{"key":"3393_CR217","first-page":"149","volume-title":"Adaptively secure garbled circuits from one-way functions","author":"B Hemenway","year":"2016","unstructured":"Hemenway B, Jafargholi Z, Ostrovsky R, et al. Adaptively secure garbled circuits from one-way functions. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2016. 149\u2013178"},{"key":"3393_CR218","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-70503-3_2","volume-title":"Theory of Cryptography","author":"Z Jafargholi","year":"2017","unstructured":"Jafargholi Z, Scafuro A, Wichs D. Adaptively indistinguishable garbled circuits. In: Theory of Cryptography. Berlin: Springer, 2017. 40\u201371"},{"key":"3393_CR219","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-46803-6_8","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2015","author":"S Zahur","year":"2015","unstructured":"Zahur S, Rosulek M, Evans D. Two halves make a whole. In: Advances in Cryptology\u2014EUROCRYPT 2015. Berlin: Springer, 2015. 220\u2013250"},{"key":"3393_CR220","doi-asserted-by":"crossref","unstructured":"Ball M, Malkin T, Rosulek M. Garbling gadgets for Boolean and arithmetic circuits share on. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2016. 565\u2013577","DOI":"10.1145\/2976749.2978410"},{"key":"3393_CR221","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1504\/IJWGS.2017.082061","volume":"13","author":"X A Wang","year":"2017","unstructured":"Wang X A, Xhafa F, Ma J, et al. Reusable garbled gates for new fully homomorphic encryption service. Int J Web Grid Serv, 2017, 13: 25\u201338","journal-title":"Int J Web Grid Serv"},{"key":"3393_CR222","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.future.2017.12.067","volume":"87","author":"M Alam","year":"2018","unstructured":"Alam M, Emmanuel N, Khan T, et al. Secure policy execution using reusable garbled circuit in the cloud. Future Gener Comput Syst, 2018, 87: 488\u2013501","journal-title":"Future Gener Comput Syst"},{"key":"3393_CR223","doi-asserted-by":"publisher","first-page":"e5236","DOI":"10.1002\/cpe.5236","volume":"22","author":"A A T Innocent","year":"2019","unstructured":"Innocent A A T, Sangeeta K, Prakash G. Universal gates on garbled circuit construction. Concurr Computat Pract Exper, 2019, 22: e5236","journal-title":"Concurr Computat Pract Exper"},{"key":"3393_CR224","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-56617-7_15","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2017","author":"P Mohassel","year":"2017","unstructured":"Mohassel P, Rosulek M. Non-interactive secure 2PC in the offline\/online and batch settings. In: Advances in Cryptology\u2014EUROCRYPT 2017. Berlin: Springer, 2017. 425\u2013455"},{"key":"3393_CR225","unstructured":"Xiao W, Ranellucci S, Katz J. Authenticated garbling and efficient maliciously secure two-party computation. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2017. 21\u201337"},{"key":"3393_CR226","first-page":"365","volume-title":"Optimizing authenticated garbling for faster secure two-party computation","author":"J Katz","year":"2018","unstructured":"Katz J, Ranellucci S, Rosulek M, et al. Optimizing authenticated garbling for faster secure two-party computation. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2018. 365\u2013391"},{"key":"3393_CR227","first-page":"425","volume-title":"On the exact round complexity of secure three-party computation","author":"A Patra","year":"2018","unstructured":"Patra A, Ravi D. On the exact round complexity of secure three-party computation. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2018. 425\u2013458"},{"key":"3393_CR228","doi-asserted-by":"crossref","unstructured":"Hastings M, Hemenway B, Noble D, et al. SoK: general purpose compilers for secure multi-party computation. In: Proceedings of IEEE Symposium on Security and Privacy, 2019. 1220\u20131237","DOI":"10.1109\/SP.2019.00028"},{"key":"3393_CR229","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-28628-8_21","volume-title":"Advances in Cryptology\u2014CRYPTO 2004","author":"J Katz","year":"2004","unstructured":"Katz J, Ostrovsky R. Round-optimal secure two-party computation. In: Advances in Cryptology\u2014CRYPTO 2004. Berlin: Springer, 2004. 335\u2013354"},{"key":"3393_CR230","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-72540-4_6","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2007","author":"S Jarecki","year":"2007","unstructured":"Jarecki S, Shmatikov V. Efficient two-party secure computation on committed inputs. In: Advances in Cryptology\u2014EUROCRYPT 2007. Berlin: Springer, 2007. 97\u2013114"},{"key":"3393_CR231","first-page":"537","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2013","author":"J B Nielsen","year":"2013","unstructured":"Nielsen J B. MiniLEGO: efficient secure two-party computation from general assumptions. In: Advances in Cryptology\u2014EUROCRYPT 2013. Berlin: Springer, 2013. 537\u2013556"},{"key":"3393_CR232","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology\u2014CRYPTO 2012","author":"J B Nielsen","year":"2012","unstructured":"Nielsen J B, Nordholt P S, Orlandi C, et al. A new approach to practical active-secure two-party computation. In: Advances in Cryptology\u2014CRYPTO 2012. Berlin: Springer, 2012. 681\u2013700"},{"key":"3393_CR233","first-page":"1","volume-title":"Advances in Cryptology\u2014CRYPTO 2013","author":"Y Lindell","year":"2013","unstructured":"Lindell Y. Fast cut-and-choose based protocols for malicious and covert adversaries. In: Advances in Cryptology\u2014CRYPTO 2013. Berlin: Springer, 2013. 1\u201317"},{"key":"3393_CR234","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.ins.2020.03.087","volume":"529","author":"X C Wei","year":"2020","unstructured":"Wei X C, Xu L, Zhao M H, et al. Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer. Inf Sci, 2020, 529: 132\u2013140","journal-title":"Inf Sci"},{"key":"3393_CR235","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2011","author":"R Bendlin","year":"2011","unstructured":"Bendlin R, Damg\u00e5rd I, Orlandi C, et al. Semi-homomorphic encryption and multiparty computation. In: Advances in Cryptology\u2014EUROCRYPT 2011. Berlin: Springer, 2011. 169\u2013188"},{"key":"3393_CR236","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology\u2014CRYPTO 2012","author":"I Damgrd","year":"2012","unstructured":"Damgrd I, Pastro V, Smart N P, et al. Multiparty computation from somewhat homomorphic encryption. In: Advances in Cryptology\u2014CRYPTO 2012. Berlin: Springer, 2012. 643\u2013662"},{"key":"3393_CR237","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov G, Jain A, Adriana L A, et al. Multiparty computation with low communication, computation and interaction via threshold FHE. In: Advances in Cryptology\u2014EUROCRYPT 2012. Berlin: Springer, 2012. 483\u2013501"},{"key":"3393_CR238","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10207-016-0350-0","volume":"16","author":"M Aliasgari","year":"2017","unstructured":"Aliasgari M, Blanton M, Bayatbabolghani F. Secure computation of hidden Markov models and secure floating-point arithmetic in the malicious model. Int J Inf Secur, 2017, 16: 577\u2013601","journal-title":"Int J Inf Secur"},{"key":"3393_CR239","first-page":"371","volume-title":"Proceedings of Annual International Cryptology Conference","author":"S D Gordon","year":"2015","unstructured":"Gordon S D, Liu F H, Shi E. Constant-round MPC with fairness and guarantee of output delivery. In: Proceedings of Annual International Cryptology Conference. Berlin: Springer, 2015. 371\u2013400"},{"key":"3393_CR240","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-54388-7_9","volume-title":"Public-Key Cryptography\u2014PKC 2017","author":"W Chongchitmate","year":"2017","unstructured":"Chongchitmate W, Ostrovsky R. Circuit-private multi-key FHE. In: Public-Key Cryptography\u2014PKC 2017. Berlin: Springer, 2017. 241\u2013270"},{"key":"3393_CR241","doi-asserted-by":"crossref","unstructured":"Chen H, Dai W, Kim M. Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2019. 395\u2013412","DOI":"10.1145\/3319535.3363207"},{"key":"3393_CR242","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-030-34621-8_16","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2019","author":"H Chen","year":"2019","unstructured":"Chen H, Chillotti I, Song Y. Multi-key homomophic encryption from TFHE. In: Advances in Cryptology\u2014ASIACRYPT 2019. Berlin: Springer, 2019. 446\u2013472"},{"key":"3393_CR243","first-page":"101","volume-title":"Towards round-optimal secure multiparty computations: multikey FHE without a CRS","author":"E Kim","year":"2018","unstructured":"Kim E, Lee H S, Park J. Towards round-optimal secure multiparty computations: multikey FHE without a CRS. In: Proceedings of Australasian Conference on Information Security and Privacy. Berlin: Springer, 2018. 101\u2013113"},{"key":"3393_CR244","first-page":"678","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2017","unstructured":"Brakerski Z, Halevi S, Polychroniadou A. Four round secure computation without setup. In: Theory of Cryptography. Berlin: Springer, 2017. 678\u2013710"},{"key":"3393_CR245","unstructured":"Goyal R. Quantum multi-key homomorphic encryption for polynomial-sized circuits. IACR Cryptology ePrint Archive, 2018. https:\/\/eprint.iacr.org\/2018\/443"},{"key":"3393_CR246","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TIFS.2019.2923156","volume":"15","author":"J Zhou","year":"2020","unstructured":"Zhou J, Cao Z, Qin Z, et al. LPPA: lightweight privacy-preserving authentication from efficient multi-key secure outsourced computation for location-based services in VANETs. IEEE Trans Inform Forensic Secur, 2020, 15: 420\u2013434","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR247","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11496137_31","volume-title":"Applied Cryptography and Network Security","author":"H Y Lin","year":"2005","unstructured":"Lin H Y, Tzeng W G. An efficient solution to the millionaires\u2019 problem based on homomorphic encryption. In: Applied Cryptography and Network Security. Berlin: Springer, 2005. 456\u2013466"},{"key":"3393_CR248","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1049\/cje.2017.06.014","volume":"26","author":"S D Li","year":"2017","unstructured":"Li S D, Guo Y M, Zhou S F, et al. Efficient protocols for the general millionaires\u2019 problem. Chin J Electron, 2017, 26: 696\u2013702","journal-title":"Chin J Electron"},{"key":"3393_CR249","doi-asserted-by":"crossref","unstructured":"Liu M, Nanda P, Zhang X. Asymmetric commutative encryption scheme based efficient solution to the millionaires\u2019 problem. In: Proceedings of the 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications and the 12th IEEE International Conference on Big Data Science and Engineering Combined Conference, 2018. 990\u2013995","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00139"},{"key":"3393_CR250","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/TDSC.2016.2536601","volume":"15","author":"X Liu","year":"2018","unstructured":"Liu X, Choo K K R, Deng R H, et al. Efficient and privacy-preserving outsourced calculation of rational numbers. IEEE Trans Dependable Secure Comput, 2018, 15: 27\u201339","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"3393_CR251","first-page":"202","volume-title":"Information Security and Cryptology\u2014ICISC 2012","author":"K Hamada","year":"2012","unstructured":"Hamada K, Kikuchi R, Dai I, et al. Practically efficient multi-party sorting protocols from comparison sort algorithms. In: Information Security and Cryptology\u2014ICISC 2012. Berlin: Springer, 2012. 202\u2013216"},{"key":"3393_CR252","first-page":"488","volume":"24","author":"Z Marszaek","year":"2018","unstructured":"Marszaek Z. Parallel fast sort algorithm for secure multiparty computation. J Universal Comput Sci, 2018, 24: 488\u2013514","journal-title":"J Universal Comput Sci"},{"key":"3393_CR253","first-page":"165","volume-title":"Secure multi-party computational geometry","author":"M J Atallah","year":"2001","unstructured":"Atallah M J, Du W. Secure multi-party computational geometry. In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001). Berlin: Springer, 2001. 165\u2013179"},{"key":"3393_CR254","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jnca.2014.08.004","volume":"46","author":"J Qin","year":"2014","unstructured":"Qin J, Duan H, Zhao H, et al. A new Lagrange solution to the privacy-preserving general geometric intersection problem. J Network Comput Appl, 2014, 46: 94\u201399","journal-title":"J Network Comput Appl"},{"key":"3393_CR255","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.32604\/cmc.2019.03551","volume":"60","author":"W J Liu","year":"2019","unstructured":"Liu W J, Xu Y, Yang J C N, et al. Privacy-preserving quantum two-party geometric intersection. Comput Mater Continua, 2019, 60: 1237\u20131250","journal-title":"Comput Mater Continua"},{"key":"3393_CR256","first-page":"3","volume-title":"ICT Systems Security and Privacy Protection","author":"A Abadi","year":"2005","unstructured":"Abadi A, Terzis S, Dong C. O-PSI: delegated private set intersection on outsourced datasets. In: ICT Systems Security and Privacy Protection. Berlin: Springer, 2005. 3\u201317"},{"key":"3393_CR257","unstructured":"Pinkas B, Schneider T, Zohner M. Faster private set intersection based on OT extension. In: Proceedings of the 23rd USENIX Security Symposium, 2014. 797\u2013812"},{"key":"3393_CR258","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00145-014-9190-0","volume":"29","author":"M J Freedman","year":"2016","unstructured":"Freedman M J, Hazay C, Nissim K, et al. Efficient set intersection with simulation-based security. J Cryptol, 2016, 29: 115\u2013155","journal-title":"J Cryptol"},{"key":"3393_CR259","first-page":"727","volume":"14","author":"M Hirofumi","year":"2018","unstructured":"Hirofumi M, Noritaka S, Hiromi M. A proposal of profit sharing method for secure multiparty computation. Int J Innovative Comput Inform Control, 2018, 14: 727\u2013735","journal-title":"Int J Innovative Comput Inform Control"},{"key":"3393_CR260","unstructured":"Juvekar C, Vaikuntanathan V, Chandrakasan A. Gazelle: a low latency framework for secure neural network inference. In: Proceedings of the 27th USENIX Conference on Security Symposium, 2018. 1651\u20131668"},{"key":"3393_CR261","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TNNLS.2014.2342533","volume":"26","author":"B Gu","year":"2015","unstructured":"Gu B, Sheng V S, Tay K Y, et al. Incremental support vector learning for ordinal regression. IEEE Trans Neural Netw Learning Syst, 2015, 26: 1403\u20131416","journal-title":"IEEE Trans Neural Netw Learning Syst"},{"key":"3393_CR262","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699436","volume":"62","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser S, Kalai Y T, Rothblum G N. Delegating computation: interactive proofs for muggles. J ACM, 2015, 62: 1\u201364","journal-title":"J ACM"},{"key":"3393_CR263","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1109\/TIFS.2017.2656824","volume":"12","author":"Y Zheng","year":"2017","unstructured":"Zheng Y, Cui H, Wang C, et al. Privacy-preserving image denoising from external cloud databases. IEEE Trans Inform Forensic Secur, 2017, 12: 1285\u20131298","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR264","unstructured":"McMahan H B, Moore E, Ramage D, et al. Communication-efficient learning of deep networks from decentralized data. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017. 1273\u20131282"},{"key":"3393_CR265","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3339474","volume":"10","author":"Q Yang","year":"2019","unstructured":"Yang Q, Liu Y, Chen T, et al. Federated machine learning: concept and applications. ACM Trans Intell Syst Technol, 2019, 10: 1\u201319","journal-title":"ACM Trans Intell Syst Technol"},{"key":"3393_CR266","first-page":"50","volume":"37","author":"T Li","year":"2020","unstructured":"Li T, Sahu A K, Talwalkar A, et al. Federated learning: challenges, methods, and future directions. IEEE Signal Process Mag, 2020, 37: 50\u201360","journal-title":"IEEE Signal Process Mag"},{"key":"3393_CR267","unstructured":"Malkhi D, Nisan N, Pinkas B, et al. Fairplay: a secure two-party computation system. In: Proceedings of the 13th Conference on USENIX Security Symposium, 2004. 20\u201359"},{"key":"3393_CR268","doi-asserted-by":"crossref","unstructured":"Gueron S, Lindell Y, Nof A, et al. Fast garbling of circuits under standard assumptions. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2015. 5670\u2013578","DOI":"10.1145\/2810103.2813619"},{"key":"3393_CR269","doi-asserted-by":"crossref","unstructured":"Zhang Y, Steele A, Blanton M. PICCO: a general-purpose compiler for private distributed computation. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, 2013. 813\u2013826","DOI":"10.1145\/2508859.2516752"},{"key":"3393_CR270","doi-asserted-by":"crossref","unstructured":"Rastogi A, Hammer M A, Hicks M. Wysteria: a programming language for generic, mixed-mode multiparty computations. In: Proceedings of IEEE Symposium on Security and Privacy, 2014. 655\u2013670","DOI":"10.1109\/SP.2014.48"},{"key":"3393_CR271","unstructured":"Wang X, Malozemoff A J, Katz J, et al. EMP-toolkit: efficient multiparty computation toolkit. 2016. https:\/\/github.com\/emp-toolkit"},{"key":"3393_CR272","doi-asserted-by":"crossref","unstructured":"Songhori E M, Hussain S U, Sadeghi A R, et al. TinyGarble: highly compressed and scalable sequential garbled circuits. In: Proceedings of IEEE Symposium on Security and Privacy, 2015. 411\u2013428","DOI":"10.1109\/SP.2015.32"},{"key":"3393_CR273","unstructured":"Zahur S, Evans D. Obliv-C: a language for extensible data-oblivious computation. IACR Cryptology ePrint Archive 2015\/1153, 2015"},{"key":"3393_CR274","doi-asserted-by":"crossref","unstructured":"Liu C, Xiao S W, Nayak K, et al. ObliVM: a programming framework for secure computation. In: Proceedings of IEEE Symposium on Security and Privacy, 2015. 359\u2013376","DOI":"10.1109\/SP.2015.29"},{"key":"3393_CR275","doi-asserted-by":"crossref","unstructured":"Mood B, Gupta D, Carter H, et al. Frigate: a validated, extensible, and efficient compiler and interpreter for secure computation. In: Proceedings of IEEE European Symposium on Security and Privacy, 2016. 112\u2013127","DOI":"10.1109\/EuroSP.2016.20"},{"key":"3393_CR276","unstructured":"Mihaela I, Kreuter B. On deploying secure computing commercially: private intersection-sum protocols and their business applications. IACR Cryptology ePrint Archive, 2019. https:\/\/eprint.iacr.org\/2019\/723.pdf"},{"key":"3393_CR277","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TIFS.2015.2483486","volume":"11","author":"J H Cheon","year":"2016","unstructured":"Cheon J H, Kim M, Kim M. Optimized search-and-compute circuits and their application to query evaluation on encrypted data. IEEE Trans Inform Forensic Secur, 2016, 11: 188\u2013199","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3393_CR278","doi-asserted-by":"crossref","unstructured":"Garg S, Gentry C, Halevi S, et al. Candidate indistinguishability obfuscation and functional encryption for all circuits. sIn: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013. 40\u201349","DOI":"10.1109\/FOCS.2013.13"},{"key":"3393_CR279","doi-asserted-by":"crossref","unstructured":"Jain A, Lin H, Sahai A. Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021. 60\u201373","DOI":"10.1145\/3406325.3451093"},{"key":"3393_CR280","doi-asserted-by":"crossref","unstructured":"Liu L B, Luo A, Li G H, et al. Jintide\u00ae: a hardware security enhanced server CPU with Xeon\u00aeCores under runtime surveillance by an In-Package dynamically reconfigurable processor. In: Proceedings of IEEE Hot Chips 31 Symposium (HCS), 2019. 1\u201325","DOI":"10.1109\/HOTCHIPS.2019.8875682"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3393-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-021-3393-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3393-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T22:03:26Z","timestamp":1699135406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-021-3393-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,23]]},"references-count":280,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["3393"],"URL":"https:\/\/doi.org\/10.1007\/s11432-021-3393-x","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,23]]},"assertion":[{"value":"17 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"201301"}}