{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:45Z","timestamp":1740109245705,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272294"],"award-info":[{"award-number":["62272294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Innovation Action Plan of Shanghai","award":["22511101300"],"award-info":[{"award-number":["22511101300"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00778-024-00852-1","type":"journal-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T06:02:31Z","timestamp":1716444151000},"page":"1357-1375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient cryptanalysis of an encrypted database supporting data interoperability"],"prefix":"10.1007","volume":"33","author":[{"given":"Gongyu","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0504-9538","authenticated-orcid":false,"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"key":"852_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"852_CR2","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference, pp. 307\u2013314 (1968)","DOI":"10.1145\/1468075.1468121"},{"key":"852_CR3","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 10\u201324. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"852_CR4","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Chenette, N., Lee, Y., O\u2019neill, A.: Order-preserving symmetric encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 224\u2013241. Springer (2009)","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"852_CR5","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Chenette, N., O\u2019Neill, A.: Order-preserving encryption revisited: Improved security analysis and alternative solutions. In: Advances in Cryptology\u2014CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2011. Proceedings 31, pp. 578\u2013595. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_33"},{"key":"852_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Theory of Cryptography Conference, pp. 535\u2013554. Springer (2007)","DOI":"10.1007\/978-3-540-70936-7_29"},{"issue":"3","key":"852_CR7","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. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"issue":"10","key":"852_CR8","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.14778\/3467861.3467865","volume":"14","author":"X Cao","year":"2021","unstructured":"Cao, X., Liu, J., Lu, H., Ren, K.: Cryptanalysis of an encrypted database in SIGMOD\u201914. Proc. VLDB Endow. 14(10), 1743\u20131755 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"852_CR9","doi-asserted-by":"crossref","unstructured":"Chang, Y.C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: International Conference on Applied Cryptography And Network Security, pp. 442\u2013455. Springer (2005)","DOI":"10.1007\/11496137_30"},{"key":"852_CR10","doi-asserted-by":"crossref","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 1\u201320. Springer (2011)","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"852_CR11","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Stehl\u00e9, D.: Fully homomophic encryption over the integers revisited. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 513\u2013536. Springer (2015)","DOI":"10.1007\/978-3-662-46800-5_20"},{"key":"852_CR12","doi-asserted-by":"crossref","unstructured":"Daemen, J., Rijmen, V.: The block cipher rijndael. In: International Conference on Smart Card Research and Advanced Applications, pp. 277\u2013284. Springer (1998)","DOI":"10.1007\/10721064_26"},{"key":"852_CR13","doi-asserted-by":"crossref","unstructured":"Dijk, M.v., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 24\u201343. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"852_CR14","doi-asserted-by":"crossref","unstructured":"Evdokimov, S., G\u00fcnther, O.: Encryption techniques for secure database outsourcing. In: European Symposium on Research in Computer Security, pp. 327\u2013342. Springer (2007)","DOI":"10.1007\/978-3-540-74835-9_22"},{"key":"852_CR15","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptol. ePrint Arch. (2012)"},{"key":"852_CR16","doi-asserted-by":"crossref","unstructured":"Fuller, B., Varia, M., Yerukhimovich, A., Shen, E., Hamlin, A., Gadepally, V., Shay, R., Mitchell, J.D., Cunningham, R.K.: Sok: Cryptographically protected database search. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 172\u2013191. IEEE (2017)","DOI":"10.1109\/SP.2017.10"},{"issue":"A","key":"852_CR17","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1112\/S1461157016000218","volume":"19","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., Gebregiyorgis, S.W., Murphy, S.: Algorithms for the approximate common divisor problem. LMS J. Comput. Math. 19(A), 58\u201372 (2016)","journal-title":"LMS J. Comput. Math."},{"key":"852_CR18","doi-asserted-by":"crossref","unstructured":"Grubbs, P., Lacharit\u00e9, M.S., Minaud, B., Paterson, K.G.: Learning to reconstruct: statistical learning theory and encrypted database attacks. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1067\u20131083. IEEE (2019)","DOI":"10.1109\/SP.2019.00030"},{"key":"852_CR19","doi-asserted-by":"crossref","unstructured":"Grubbs, P., Sekniqi, K., Bindschaedler, V., Naveed, M., Ristenpart, T.: Leakage-abuse attacks against order-revealing encryption. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 655\u2013672. IEEE (2017)","DOI":"10.1109\/SP.2017.44"},{"key":"852_CR20","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham, N.: Approximate integer common divisors. In: International Cryptography and Lattices Conference, pp. 51\u201366. Springer (2001)","DOI":"10.1007\/3-540-44670-2_6"},{"key":"852_CR21","doi-asserted-by":"crossref","unstructured":"Kellaris, G., Kollios, G., Nissim, K., O\u2019neill, A.: Generic attacks on secure outsourced databases. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1329\u20131340 (2016)","DOI":"10.1145\/2976749.2978386"},{"key":"852_CR22","doi-asserted-by":"crossref","unstructured":"Kim, S., Lewi, K., Mandal, A., Montgomery, H., Roy, A., Wu, D.J.: Function-hiding inner product encryption is practical. In: International Conference on Security and Cryptography for Networks, pp. 544\u2013562. Springer (2018)","DOI":"10.1007\/978-3-319-98113-0_29"},{"key":"852_CR23","doi-asserted-by":"crossref","unstructured":"Krastnikov, S., Kerschbaum, F., Stebila, D.: Efficient oblivious database joins. arXiv:2003.09481 (2020)","DOI":"10.14778\/3407790.3407814"},{"key":"852_CR24","doi-asserted-by":"crossref","unstructured":"Lacharit\u00e9, M.S., Minaud, B., Paterson, K.G.: Improved reconstruction attacks on encrypted data using range query leakage. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 297\u2013314. IEEE (2018)","DOI":"10.1109\/SP.2018.00002"},{"key":"852_CR25","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"852_CR26","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":"852_CR27","doi-asserted-by":"crossref","unstructured":"Nguyen, P., Stern, J.: Merkle\u2013Hellman revisited: a cryptanalysis of the Qu\u2013Vanstone cryptosystem based on group factorizations. In: Annual International Cryptology Conference, pp. 198\u2013212. Springer (1997)","DOI":"10.1007\/BFb0052236"},{"key":"852_CR28","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Lll on the average. In: International Algorithmic Number Theory Symposium, pp. 238\u2013256. Springer (2006)","DOI":"10.1007\/11792086_18"},{"issue":"5","key":"852_CR29","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/0022-314X(72)90038-8","volume":"4","author":"JE Nymann","year":"1972","unstructured":"Nymann, J.E.: On the probability that k positive integers are relatively prime. J. Number Theory 4(5), 469\u2013473 (1972)","journal-title":"J. Number Theory"},{"key":"852_CR30","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 223\u2013238. Springer (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"852_CR31","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Redfield, C.M., Zeldovich, N., Balakrishnan, H.: CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of the Twenty-third ACM Symposium on Operating Systems Principles, pp. 85\u2013100 (2011)","DOI":"10.1145\/2043556.2043566"},{"issue":"1","key":"852_CR32","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"852_CR33","doi-asserted-by":"crossref","unstructured":"Shafieinejad, M., Gupta, S., Liu, J.Y., Karabina, K., Kerschbaum, F.: Equi-joins over encrypted data for series of queries. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 1635\u20131648. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00168"},{"key":"852_CR34","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE Symposium on Security And Privacy. S &P 2000, pp. 44\u201355. IEEE (2000)"},{"key":"852_CR35","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.4) (2021). https:\/\/www.sagemath.org"},{"key":"852_CR36","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Kao, B., Cheung, D.W.L., Li, R., Yiu, S.M.: Secure query processing with data interoperability in a cloud database environment. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1395\u20131406 (2014)","DOI":"10.1145\/2588555.2588572"},{"key":"852_CR37","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhong, S., Wright, R.N.: Privacy-preserving queries on encrypted data. In: European Symposium on Research in Computer Security, pp. 479\u2013495. Springer (2006)","DOI":"10.1007\/11863908_29"},{"key":"852_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00852-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00852-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00852-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T12:03:54Z","timestamp":1723896234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00852-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,23]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["852"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00852-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2024,5,23]]},"assertion":[{"value":"6 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}