{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T23:25:32Z","timestamp":1783639532202,"version":"3.55.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Deterministic encryption (DET) allows for fast retrieval of encrypted information, but it would cause significant leakage of frequency information of the underlying data, which results in an array of inference attacks. Simply replacing DET with fully randomized encryption is often undesirable in the scenario of an encrypted database since it incurs a large overhead in query and storage. Frequency Smoothing Encryption (FSE) is a practical encryption scheme to protect frequency information. Current FSE constructions still fall short of efficiency and a reasonable security definition. We revisit FSE and propose two security definitions from both theoretical and practical perspectives. Furthermore, we adopt a novel partitioning strategy to construct a new FSE scheme to improve performance. Experimental results show that compared with others, our scheme achieves excellent query performance while attaining security against inference attacks.<\/jats:p>","DOI":"10.1186\/s42400-024-00208-w","type":"journal-article","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T02:02:44Z","timestamp":1722477764000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Revisiting frequency-smoothing encryption: new security definitions and efficient construction"],"prefix":"10.1186","volume":"7","author":[{"given":"Haobin","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yue","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siyi","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,1]]},"reference":[{"key":"208_CR1","doi-asserted-by":"crossref","unstructured":"Antonopoulos P, Arasu A, Singh KD, Eguro K, Gupta N, Jain R, Kaushik R, Kodavalla H, Kossmann D, Ogg N, et al (2020) Azure sql database always encrypted. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data, pp 1511\u20131525","DOI":"10.1145\/3318464.3386141"},{"key":"208_CR2","doi-asserted-by":"crossref","unstructured":"Arasu A, Blanas S, Eguro K, Joglekar M, Kaushik R, Kossmann D, Ramamurthy R, Upadhyaya P, Venkatesan R (2013) Secure database-as-a-service with cipherbase. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 1033\u20131036. ACM Press, New York, New York, USA","DOI":"10.1145\/2463676.2467797"},{"issue":"5","key":"208_CR3","first-page":"1","volume":"11","author":"V Bindschaedler","year":"2018","unstructured":"Bindschaedler V, Grubbs P, Tech C, Cash D, Ristenpart T, Shmatikov V (2018) The tao of inference in privacy-protected databases. Proc VLDB Endow 11(5):1","journal-title":"Proc VLDB Endow"},{"key":"208_CR4","unstructured":"Bureau UC (2015) American community survey (ACS) 2015. http:\/\/www.census.gov\/programs-surveys\/acs\/"},{"key":"208_CR5","doi-asserted-by":"crossref","unstructured":"Cash D, Grubbs P, Perry J, Ristenpart T (2015) Leakage-abuse attacks against searchable encryption. In: Proceedings of the 22nd ACM SIGSAC conference on computer and communications security, vol. 2015-Octob, pp 668\u2013679. ACM, New York, NY, USA","DOI":"10.1145\/2810103.2813700"},{"issue":"1","key":"208_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/1053283.1053289","volume":"8","author":"A Ceselli","year":"2005","unstructured":"Ceselli A, Damiani E, Vimercati SDCD, Jajodia S, Paraboschi S, Samarati P (2005) Modeling and assessing inference exposure in encrypted databases. ACM Trans Inf Syst Secur 8(1):119\u2013152","journal-title":"ACM Trans Inf Syst Secur"},{"key":"208_CR7","doi-asserted-by":"crossref","unstructured":"Durak FB, DuBuisson TM, Cash D (2016) What else is revealed by order-revealing encryption? In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pp 1155\u20131166","DOI":"10.1145\/2976749.2978379"},{"key":"208_CR8","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s00145-013-9174-5","volume":"28","author":"B Fuller","year":"2015","unstructured":"Fuller B, O\u2019cneill A, Reyzin L (2015) A unified approach to deterministic encryption: new constructions and a connection to computational entropy. J Cryptol 28:671\u2013717","journal-title":"J Cryptol"},{"key":"208_CR9","doi-asserted-by":"crossref","unstructured":"Grubbs P, Sekniqi K, Bindschaedler V, Naveed M, Ristenpart T (2017) Leakage-abuse attacks against order-revealing encryption. In: 2017 IEEE symposium on security and privacy (SP), pp 655\u2013672. IEEE","DOI":"10.1109\/SP.2017.44"},{"key":"208_CR10","unstructured":"Grubbs P, Khandelwal A, Lacharit\u00e9 M-S, Brown L, Li L, Agarwal R, Ristenpart T (2020) Pancake: frequency smoothing for encrypted data stores. In: Usenix security"},{"key":"208_CR11","unstructured":"Hunter (2023) Supermarket dataset for predictive marketing 2023. https:\/\/www.kaggle.com\/datasets\/hunter0007\/ecommerce-dataset-for-predictive-marketing-2023"},{"key":"208_CR12","doi-asserted-by":"crossref","unstructured":"Kamara S, Moataz T (2018) SQL on structurally-encrypted databases. In: Advances in cryptology\u2013ASIACRYPT 2018: 24th international conference on the theory and application of cryptology and information security, Brisbane, QLD, Australia, December 2\u20136, 2018, proceedings, Part I 24, pp 149\u2013180. Springer","DOI":"10.1007\/978-3-030-03326-2_6"},{"key":"208_CR13","doi-asserted-by":"crossref","unstructured":"Kerschbaum F (2015) Frequency-hiding order-preserving encryption. In: Proceedings of the ACM conference on computer and communications security, vol. 2015-Octob, pp 656\u2013667. ACM, New York, NY, USA","DOI":"10.1145\/2810103.2813629"},{"issue":"1","key":"208_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.46586\/tosc.v2018.i1.277-313","volume":"2018","author":"MS Lacharit\u00e9","year":"2018","unstructured":"Lacharit\u00e9 MS, Paterson KG (2018) Frequency-smoothing encryption: preventing snapshot attacks on deterministically encrypted data. IACR Trans Sym Cryptol 2018(1):277\u2013313","journal-title":"IACR Trans Sym Cryptol"},{"issue":"13","key":"208_CR15","doi-asserted-by":"publisher","first-page":"3295","DOI":"10.14778\/3484224.3484228","volume":"14","author":"D Li","year":"2021","unstructured":"Li D, Lv S, Huang Y, Liu Y, Li T, Liu Z, Guo L (2021) Frequency-hiding order-preserving encryption with small client storage. Proc VLDB Endow 14(13):3295\u20133307","journal-title":"Proc VLDB Endow"},{"issue":"253","key":"208_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1080\/01621459.1951.10500769","volume":"46","author":"FJ Massey Jr","year":"1951","unstructured":"Massey FJ Jr (1951) The Kolmogorov\u2013Smirnov test for goodness of fit. J Am Stat Assoc 46(253):68\u201378","journal-title":"J Am Stat Assoc"},{"key":"208_CR17","doi-asserted-by":"crossref","unstructured":"Naveed M, Kamara S, Wright CV (2015) Inference attacks on property-preserving encrypted databases. In: Proceedings of the 22nd ACM SIGSAC conference on computer and communications security, vol. 2015-Octob, pp 644\u2013655. ACM, New York, NY, USA","DOI":"10.1145\/2810103.2813651"},{"issue":"11","key":"208_CR18","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.14778\/3342263.3342641","volume":"12","author":"R Poddar","year":"2019","unstructured":"Poddar R, Boelter T, Popa RA (2019) Arx: an encrypted database using semantically secure encryption. Proc VLDB Endow 12(11):1664\u20131678","journal-title":"Proc VLDB Endow"},{"key":"208_CR19","doi-asserted-by":"crossref","unstructured":"Popa RA, Li FH, Zeldovich N (2013) An ideal-security protocol for order-preserving encoding. In: 2013 IEEE symposium on security and privacy, pp 463\u2013477. IEEE","DOI":"10.1109\/SP.2013.38"},{"key":"208_CR20","doi-asserted-by":"crossref","unstructured":"Popa RA, Redfield CMS, Zeldovich N, Balakrishnan H (2011) CryptDB. In: Proceedings of the twenty-third ACM symposium on operating systems principles - SOSP \u201911, p 85. ACM Press, New York, New York, USA","DOI":"10.1145\/2043556.2043566"},{"key":"208_CR21","doi-asserted-by":"crossref","unstructured":"Pouliot D, Griffy S, Wright CV (2019) The strength of weak randomization: easily deployable, efficiently searchable encryption with minimal leakage. In: 2019 49th annual IEEE\/IFIP international conference on dependable systems and networks (DSN), pp 517\u2013529. IEEE","DOI":"10.1109\/DSN.2019.00059"},{"issue":"5","key":"208_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.14778\/2535573.2488336","volume":"6","author":"S Tu","year":"2013","unstructured":"Tu S, Kaashoek MF, Madden S, Zeldovich N (2013) Processing analytical queries over encrypted data. Proc VLDB Endow 6(5):289\u2013300","journal-title":"Proc VLDB Endow"},{"key":"208_CR23","doi-asserted-by":"publisher","first-page":"2811","DOI":"10.14778\/3476311.3476351","volume":"14","author":"J Zhu","year":"2021","unstructured":"Zhu J, Cheng K, Liu J, Guo L (2021) Full encryption: an end to end encryption mechanism in GaussDB. Proc VLDB Endow 14:2811\u20132814","journal-title":"Proc VLDB Endow"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00208-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00208-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00208-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T02:05:25Z","timestamp":1722477925000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00208-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["208"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00208-w","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,1]]},"assertion":[{"value":"1 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"15"}}