{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:00:18Z","timestamp":1742976018638,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031252006"},{"type":"electronic","value":"9783031252013"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25201-3_19","type":"book-chapter","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T06:02:04Z","timestamp":1676008924000},"page":"247-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Secure Order-Preserving Encryption Scheme Based on\u00a0Encrypted Index"],"prefix":"10.1007","author":[{"given":"Haobin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Antonopoulos, P., et al.: Azure SQL database always encrypted. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 1511\u20131525 (2020)","DOI":"10.1145\/3318464.3386141"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-01001-9_13","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"A Boldyreva","year":"2009","unstructured":"Boldyreva, A., Chenette, N., Lee, Y., O\u2019Neill, A.: Order-preserving symmetric encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 224\u2013241. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_13"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-22792-9_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A Boldyreva","year":"2011","unstructured":"Boldyreva, A., Chenette, N., O\u2019Neill, A.: Order-preserving encryption revisited: improved security analysis and alternative solutions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 578\u2013595. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_33"},{"issue":"8","key":"19_CR4","first-page":"1246","volume":"11","author":"H Chen","year":"2017","unstructured":"Chen, H., Tian, X., Yuan, P.: Crypt-JDBC model: optimization of onion encryption algorithm. J. Front. Comput. Sci. Technol. 11(8), 1246\u20131257 (2017)","journal-title":"J. Front. Comput. Sci. Technol."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-91458-9_7","volume-title":"Database Systems for Advanced Applications","author":"N Cui","year":"2018","unstructured":"Cui, N., Yang, X., Wang, L., Wang, B., Li, J.: Secure range query over encrypted data in outsourced environments. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10828, pp. 112\u2013129. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91458-9_7"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: IEEE International Conference on Data Engineering, pp. 664\u2013675. IEEE (2014)","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/s41019-021-00170-4","volume":"6","author":"Y Ge","year":"2021","unstructured":"Ge, Y., Cao, J., Wang, H., Chen, Z., Zhang, Y.: Set-based adaptive distributed differential evolution for anonymity-driven database fragmentation. Data Sci. Eng. 6, 380\u2013391 (2021). https:\/\/doi.org\/10.1007\/s41019-021-00170-4","journal-title":"Data Sci. Eng."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Grubbs, P., Sekniqi, K., Bindschaedler, V., Naveed, M., Ristenpart, T.: Leakage-abuse attacks against order-revealing encryption. In: IEEE Symposium on Security and Privacy, pp. 655\u2013672. IEEE (2017)","DOI":"10.1109\/SP.2017.44"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Hacig\u00fcm\u00fc\u015f, H., Iyer, B., Li, C., Mehrotra, S.: Executing SQL over encrypted data in the database-service-provider model. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 216\u2013227 (2002)","DOI":"10.1145\/564691.564717"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: Proceedings of the Thirtieth International Conference on Very Large Data, pp. 720\u2013731 (2004)","DOI":"10.1016\/B978-012088469-8.50064-4"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Hu, H., Xu, J., Ren, C., Choi, B.: Processing private queries over untrusted data cloud through privacy homomorphism. In: IEEE International Conference on Data Engineering, pp. 601\u2013612. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767862"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F., Schr\u00f6pfer, A.: Optimal average-complexity ideal-security order-preserving encryption. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 275\u2013286 (2014)","DOI":"10.1145\/2660267.2660277"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-030-29962-0_17","volume-title":"Computer Security \u2013 ESORICS 2019","author":"F Kerschbaum","year":"2019","unstructured":"Kerschbaum, F., Tueno, A.: An efficiently searchable encrypted data structure for range queries. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 344\u2013364. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_17"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Liu, D., Wang, S.: Programmable order-preserving secure index for encrypted database query. In: IEEE International Conference on Cloud Computing, pp. 502\u2013509. IEEE (2012)","DOI":"10.1109\/CLOUD.2012.65"},{"issue":"13","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1967","DOI":"10.1002\/cpe.2992","volume":"25","author":"D Liu","year":"2013","unstructured":"Liu, D., Wang, S.: Nonlinear order preserving index for encrypted database query in service cloud environments. Concurr. Comput. Pract. Exp. 25(13), 1967\u20131984 (2013)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Naveed, M., Kamara, S., Wright, C.V.: Inference attacks on property-preserving encrypted databases. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 644\u2013655 (2015)","DOI":"10.1145\/2810103.2813651"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R.: Efficient computation on oblivious RAMs. In: Proceedings of ACM Symposium on Theory of Computing, pp. 514\u2013523 (1990)","DOI":"10.1145\/100216.100289"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s41019-020-00136-y","volume":"5","author":"M Padhya","year":"2020","unstructured":"Padhya, M., Jinwala, D.C.: R-OO-KASE: revocable online\/offline key aggregate searchable encryption. Data Sci. Eng. 5, 391\u2013418 (2020). https:\/\/doi.org\/10.1007\/s41019-020-00136-y","journal-title":"Data Sci. Eng."},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Li, F.H., Zeldovich, N.: An ideal-security protocol for order-preserving encoding. In: IEEE Symposium on Security and Privacy, pp. 463\u2013477. IEEE (2013)","DOI":"10.1109\/SP.2013.38"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Redfield, C.M., Zeldovich, N., Balakrishnan, H.: CryptDB: protecting confidentiality with encrypted query processing. In: ACM Symposium on Operating Systems Principles, pp. 85\u2013100 (2011)","DOI":"10.1145\/2043556.2043566"},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Roche, D.S., Apon, D., Choi, S.G., Yerukhimovich, A.: POPE: partial order preserving encoding. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1131\u20131142 (2016)","DOI":"10.1145\/2976749.2978345"},{"issue":"5","key":"19_CR28","doi-asserted-by":"publisher","first-page":"289","DOI":"10.14778\/2535573.2488336","volume":"6","author":"SL Tu","year":"2013","unstructured":"Tu, S.L., Kaashoek, M.F., Madden, S.R., Zeldovich, N.: Processing analytical queries over encrypted data. Proc. VLDB Endow. 6(5), 289\u2013300 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Shi, E., Bethencourt, J., Chan, T.H., Song, D., Perrig, A.: Multi-dimensional range query over encrypted data. In: IEEE Symposium on Security and Privacy, pp. 350\u2013364. IEEE (2007)","DOI":"10.1109\/SP.2007.29"},{"issue":"4","key":"19_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3177872","volume":"65","author":"E Stefanov","year":"2018","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious ram protocol. J. ACM (JACM) 65(4), 1\u201326 (2018)","journal-title":"J. ACM (JACM)"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Tueno, A., Kerschbaum, F.: Efficient secure computation of order-preserving encryption. In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, pp. 193\u2013207 (2020)","DOI":"10.1145\/3320269.3384739"},{"key":"19_CR32","unstructured":"Zheguang, Z., Seny, K., Tarik, M., Stan, Z.: Encrypted databases: from theory to systems. In: Conference on Innovative Data Systems Research (2021)"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25201-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T06:19:42Z","timestamp":1676009982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25201-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031252006","9783031252013"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25201-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}