{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:47:47Z","timestamp":1783788467781,"version":"3.55.0"},"reference-count":72,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T00:00:00Z","timestamp":1521158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2018,8,9]]},"abstract":"<jats:p>Software-based approaches for search over encrypted data are still either challenged by lack of proper, low-leakage encryption or slow performance. Existing hardware-based approaches do not scale well due to hardware limitations and software designs that are not specifically tailored to the hardware architecture, and are rarely well analyzed for their security (e.g. the impact of side channels). Additionally, existing hardware-based solutions often have a large code footprint in the trusted environment susceptible to software compromises. In this paper we present HardIDX: a hardware-based approach, leveraging Intel\u2019s SGX, for search over encrypted data. It implements only the security critical core, i.e., the search functionality, in the trusted environment and resorts to untrusted software for the remainder. HardIDX is deployable as a highly performant encrypted database index: it is logarithmic in the size of the index and searches are performed within a few milliseconds rather than seconds. We formally model and prove the security of our scheme showing that its leakage is equivalent to the best known searchable encryption schemes. Our implementation has a very small code and memory footprint yet still scales to virtually unlimited search index sizes, i.e., size is limited only by the general \u2013 non-secure \u2013 hardware resources.<\/jats:p>","DOI":"10.3233\/jcs-171103","type":"journal-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T11:46:01Z","timestamp":1521200761000},"page":"677-706","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":8,"title":["HardIDX: Practical and secure index with SGX in a malicious environment"],"prefix":"10.1177","volume":"26","author":[{"given":"Benny","family":"Fuhry","sequence":"first","affiliation":[{"name":"SAP Research, Germany. E-mails:\u00a0,\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raad","family":"Bahmani","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Germany. E-mails:\u00a0,\u00a0,\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ferdinand","family":"Brasser","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Germany. E-mails:\u00a0,\u00a0,\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Hahn","sequence":"additional","affiliation":[{"name":"SAP Research, Germany. E-mails:\u00a0,\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Kerschbaum","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada. E-mail:\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Germany. E-mails:\u00a0,\u00a0,\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2018,3,16]]},"reference":[{"key":"ref001","doi-asserted-by":"crossref","unstructured":"R.\u00a0Agrawal, J.\u00a0Kiernan, R.\u00a0Srikant and Y.\u00a0Xu, Order preserving encryption for numeric data, in: Proceedings of the ACM International Conference on Management of Data, SIGMOD, 2004.","DOI":"10.1145\/1007568.1007632"},{"key":"ref002","unstructured":"I.\u00a0Anati, S.\u00a0Gueron, S.P.\u00a0Johnson and V.R.\u00a0Scarlata, Innovative technology for CPU based attestation and sealing, in: Workshop on Hardware and Architectural Support for Security and Privacy, HASP, 2013."},{"key":"ref003","unstructured":"ARM Limited, ARM Security Technology \u2013 Building a Secure System using TrustZone Technology, 2009, http:\/\/infocenter.arm.com\/help\/topic\/com.arm.doc.prd29-genc-009492c\/PRD29-GENC-009492C_trustzone_security_whitepaper.pdf."},{"key":"ref004","doi-asserted-by":"crossref","unstructured":"S.\u00a0Bajaj and R.\u00a0Sion, TrustedDB: A trusted hardware-based database with privacy and data confidentiality, IEEE Transactions on Information Forensics and Security (2014).","DOI":"10.1109\/TKDE.2013.38"},{"key":"ref005","unstructured":"A.\u00a0Baumann, M.\u00a0Peinado and G.\u00a0Hunt, Shielding applications from an untrusted cloud with haven, in: Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI, 2014."},{"key":"ref006","doi-asserted-by":"crossref","unstructured":"R.\u00a0Bayer and E.\u00a0McCreight, Organization and maintenance of large ordered indices, Mathematical and Information Sciences Report No. 20, Boeing Scientific Research Laboratories, 1970.","DOI":"10.21236\/AD0712079"},{"key":"ref007","unstructured":"M.\u00a0Bellare, A.\u00a0Boldyreva and A.\u00a0O\u2019Neill, Deterministic and efficiently searchable encryption, in: Proceedings of the 27th International Conference on Advances in Cryptology, CRYPTO, 2007."},{"key":"ref008","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser and A.\u00a0Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC, 1988.","DOI":"10.1145\/62212.62213"},{"key":"ref009","doi-asserted-by":"crossref","unstructured":"D.J.\u00a0Bernstein, T.\u00a0Lange and P.\u00a0Schwabe, The security impact of a new cryptographic library, in: 2nd International Conference on Cryptology and Information Security in Latin America, LATINCRYPT, 2012.","DOI":"10.1007\/978-3-642-33481-8_9"},{"key":"ref010","doi-asserted-by":"crossref","unstructured":"A.\u00a0Boldyreva, N.\u00a0Chenette, Y.\u00a0Lee and A.\u00a0O\u2019Neill, Order-preserving symmetric encryption, in: Proceedings of the 28th International Conference on Advances in Cryptology, EUROCRYPT, 2009.","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"ref011","doi-asserted-by":"crossref","unstructured":"A.\u00a0Boldyreva, N.\u00a0Chenette and A.\u00a0O\u2019Neill, Order-preserving encryption revisited: Improved security analysis and alternative solutions, in: Proceedings of the 31st International Conference on Advances in Cryptology, CRYPTO, 2011.","DOI":"10.1007\/978-3-642-22792-9_33"},{"key":"ref012","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, A.\u00a0Sahai and B.\u00a0Waters, Functional encryption: Definitions and challenges, in: Proceedings of the 8th Conference on Theory of Cryptography, TCC, 2011.","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"ref013","unstructured":"D.\u00a0Boneh and B.\u00a0Waters, Conjunctive, subset, and range queries on encrypted data, in: Proceedings of the 4th Theory of Cryptography Conference, TCC, 2007."},{"key":"ref014","doi-asserted-by":"crossref","unstructured":"F.\u00a0Brasser, B.\u00a0El\u00a0Mahjoub, P.\u00a0Koeberl, A.R.\u00a0Sadeghi and C.\u00a0Wachsmann, TyTAN: Tiny trust anchor for tiny devices, in: ACM DAC, 2015.","DOI":"10.1145\/2744769.2744922"},{"key":"ref015","doi-asserted-by":"crossref","unstructured":"B.B.\u00a0Brumley and N.\u00a0Tuveri, Remote timing attacks are still practical, in: Computer Security \u2013 ESORICS 2011: 16th European Symposium on Research in Computer Security, Leuven, Belgium, September 12\u201314, 2011, Proceedings, V.\u00a0Atluri and C.\u00a0Diaz, eds, Springer, Berlin, Heidelberg, 2011, pp.\u00a0355\u2013371. ISBN 978-3-642-23822-2. doi:10.1007\/978-3-642-23822-2_20.","DOI":"10.1007\/978-3-642-23822-2_20"},{"key":"ref016","doi-asserted-by":"crossref","unstructured":"D.\u00a0Cash, S.\u00a0Jarecki, C.\u00a0Jutla, H.\u00a0Krawczyk, M.C.\u00a0Ro\u015fu and M.\u00a0Steiner, Highly-scalable searchable symmetric encryption with support for Boolean queries, in: Proceedings of the 33rd International Conference on Advances in Cryptology, CRYPTO, 2013.","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"ref017","doi-asserted-by":"crossref","unstructured":"N.\u00a0Chenette, K.\u00a0Lewi, S.A.\u00a0Weis and D.J.\u00a0Wu, Practical order-revealing encryption with limited leakage, in: Proceedings of the 23rd International Conference on Fast Software Encryption, FSE, 2016.","DOI":"10.1007\/978-3-662-52993-5_24"},{"key":"ref018","doi-asserted-by":"crossref","unstructured":"D.\u00a0Clarke, S.\u00a0Devadas, M.\u00a0Van\u00a0Dijk, B.\u00a0Gassend and G.E.\u00a0Suh, Incremental multiset hash functions and their application to memory integrity checking, in: Proceedings of the 9th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT, 2003.","DOI":"10.1007\/978-3-540-40061-5_12"},{"key":"ref019","doi-asserted-by":"crossref","unstructured":"J.S.\u00a0Coron, A.\u00a0Mandal, D.\u00a0Naccache and M.\u00a0Tibouchi, Fully homomorphic encryption over the integers with shorter public keys, in: Proceedings of the 31st International Conference on Advances in Cryptology, CRYPTO, 2011.","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"ref020","unstructured":"V.\u00a0Costan and S.\u00a0Devadas, Intel SGX Explained, Technical report, IACR Cryptology ePrint Archive, 2016."},{"key":"ref021","unstructured":"V.\u00a0Costan, I.\u00a0Lebedev and S.\u00a0Devadas, Sanctum: Minimal hardware extensions for strong software isolation, in: 25th USENIX Security Symposium (USENIX Security 16), 2016."},{"key":"ref022","doi-asserted-by":"crossref","unstructured":"R.\u00a0Curtmola, J.\u00a0Garay, S.\u00a0Kamara and R.\u00a0Ostrovsky, Searchable symmetric encryption: Improved definitions and efficient constructions, in: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS, 2006.","DOI":"10.1145\/1180405.1180417"},{"key":"ref023","doi-asserted-by":"crossref","unstructured":"I.\u00a0Demertzis, S.\u00a0Papadopoulos, O.\u00a0Papapetrou, A.\u00a0Deligiannakis and M.\u00a0Garofalakis, Practical private range search revisited, in: Proceedings of the 2016 International Conference on Management of Data, SIGMOD \u201916, 2016.","DOI":"10.1145\/2882903.2882911"},{"key":"ref024","doi-asserted-by":"crossref","unstructured":"F.B.\u00a0Durak, T.M.\u00a0DuBuisson and D.\u00a0Cash, What else is revealed by order-revealing encryption? in: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS, 2016.","DOI":"10.1145\/2976749.2978379"},{"key":"ref025","unstructured":"M.\u00a0Egorov and M.\u00a0Wilkison, ZeroDB white paper, Technical report, arXiv.org, 2016."},{"key":"ref026","doi-asserted-by":"crossref","unstructured":"S.\u00a0Faber, S.\u00a0Jarecki, H.\u00a0Krawczyk, Q.\u00a0Nguyen, M.\u00a0Rosu and M.\u00a0Steiner, Rich queries on encrypted data: Beyond exact matches, in: Proceedings of the 20th European Symposium on Research in Computer Security, ESORICS, 2015.","DOI":"10.1007\/978-3-319-24177-7_7"},{"key":"ref027","doi-asserted-by":"crossref","unstructured":"B.\u00a0Fuhry, R.\u00a0Bahmani, F.\u00a0Brasser, F.\u00a0Hahn, F.\u00a0Kerschbaum and A.\u00a0Sadeghi, HardIDX: Practical and Secure Index with SGX, in: Data and Applications Security and Privacy XXXI \u2013 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Philadelphia, PA, USA, July 19-21, 2017, Proceedings, 2017, pp.\u00a0386\u2013408.","DOI":"10.1007\/978-3-319-61176-1_22"},{"key":"ref028","doi-asserted-by":"crossref","unstructured":"S.\u00a0Garg, P.\u00a0Mohassel and C.\u00a0Papamanthou, TWORAM: Efficient oblivious RAM in two rounds with applications to searchable encryption, in: Proceedings of the 36th Cryptology Conference, CRYPTO, 2016.","DOI":"10.1007\/978-3-662-53015-3_20"},{"key":"ref029","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-015-0100-7"},{"key":"ref030","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, Fully homomorphic encryption using ideal lattices, in: Proceedings of the Symposium on Theory of Computing, STOC, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"ref031","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi and N.P.\u00a0Smart, Homomorphic evaluation of the AES circuit, in: Proceedings of the 32nd International Conference on Advances in Cryptology, CRYPTO, 2012.","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"ref032","unstructured":"D.\u00a0Giampaolo, Practical File System Design with the Be File System, Morgan Kaufmann Publishers Inc., 1998."},{"key":"ref033","unstructured":"E.J.\u00a0Goh, Secure indexes, Technical report, IACR Cryptology ePrint Archive, 2003."},{"key":"ref034","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Micali and A.\u00a0Wigderson, How to play ANY mental game, in: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC, 1987.","DOI":"10.1145\/28395.28420"},{"key":"ref035","doi-asserted-by":"crossref","unstructured":"P.\u00a0Grubbs, K.\u00a0Sekniqi, V.\u00a0Bindschaedler, M.\u00a0Naveed and T.\u00a0Ristenpart, Leakage-abuse attacks against order-revealing encryption, Cryptology ePrint Archive, Report 2016\/895 2016, http:\/\/eprint.iacr.org\/2016\/895.","DOI":"10.1109\/SP.2017.44"},{"key":"ref036","doi-asserted-by":"crossref","unstructured":"M.\u00a0Hoekstra, R.\u00a0Lal, P.\u00a0Pappachan, V.\u00a0Phegade and J.\u00a0Del\u00a0Cuvillo, Using innovative instructions to create trustworthy software solutions, in: Workshop on Hardware and Architectural Support for Security and Privacy, HASP, 2013.","DOI":"10.1145\/2487726.2488370"},{"key":"ref037","doi-asserted-by":"crossref","unstructured":"B.\u00a0Hore, S.\u00a0Mehrotra and G.\u00a0Tsudik, A privacy-preserving index for range queries, in: Proceedings of the 30th International Conference on Very Large Data Bases, VLDB, 2004.","DOI":"10.1016\/B978-012088469-8\/50064-4"},{"key":"ref038","unstructured":"Intel, Intel Software Guard Extensions Programming Reference, 2014, https:\/\/software.intel.com\/sites\/default\/files\/managed\/48\/88\/329298-002.pdf."},{"key":"ref039","unstructured":"Intel, Intel 64 and IA-32 Architectures Software Developer\u2019s Manual, 2016, http:\/\/www.intel.com\/content\/www\/us\/en\/architecture-and-technology\/64-ia-32-architectures-software-developer-manual-325462.html."},{"key":"ref040","unstructured":"Intel Corporation, Intel\n                      \u00ae\n                      Software Guard Extensions (Intel\n                      \u00ae\n                      SGX), 2015, https:\/\/software.intel.com\/sites\/default\/files\/332680-002.pdf."},{"key":"ref041","unstructured":"S.\u00a0Kamara and T.\u00a0Moataz, SQL on structurally-encrypted databases, Technical report, IACR Cryptology ePrint Archive, 2016."},{"key":"ref042","unstructured":"D.\u00a0Kaplan, J.\u00a0Powell and T.\u00a0Woller, AMD Memory Encryption, 2016, http:\/\/amd-dev.wpengine.netdna-cdn.com\/wordpress\/media\/2013\/12\/AMD_Memory_Encryption_Whitepaper_v7-Public.pdf."},{"key":"ref043","doi-asserted-by":"crossref","unstructured":"F.\u00a0Kerschbaum and A.\u00a0Schr\u00f6pfer, Optimal average-complexity ideal-security order-preserving encryption, in: Proceedings of the 21st ACM Conference on Computer and Communications Security, CCS, 2014.","DOI":"10.1145\/2660267.2660277"},{"key":"ref044","doi-asserted-by":"crossref","unstructured":"P.\u00a0Koeberl, S.\u00a0Schulz, A.R.\u00a0Sadeghi and V.\u00a0Varadharajan, TrustLite: A security architecture for tiny embedded devices, in: ACM EuroSys, 2014.","DOI":"10.1145\/2592798.2592824"},{"key":"ref045","doi-asserted-by":"crossref","unstructured":"K.\u00a0Lewi and D.J.\u00a0Wu, Order-revealing encryption: New constructions, applications, and lower bounds, in: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS, ACM, 2016.","DOI":"10.1145\/2976749.2978376"},{"key":"ref046","doi-asserted-by":"crossref","unstructured":"J.\u00a0Li and E.R.\u00a0Omiecinski, Efficiency and security trade-off in supporting range queries on encrypted databases, in: Proceedings of the 19th Conference on Data and Applications Security, DBSec, 2005.","DOI":"10.1007\/11535706_6"},{"key":"ref047","doi-asserted-by":"crossref","unstructured":"F.\u00a0Liu, Y.\u00a0Yarom, Q.\u00a0Ge, G.\u00a0Heiser and R.B.\u00a0Lee, Last-level cache side-channel attacks are practical, in: 2015 IEEE Symposium on Security and Privacy, 2015, pp.\u00a0605\u2013622. ISSN 1081-6011. doi:10.1109\/SP.2015.43.","DOI":"10.1109\/SP.2015.43"},{"key":"ref048","unstructured":"Y.\u00a0Lu, Privacy-preserving logarithmic-time search on encrypted data in cloud, in: Proceedings of the 19th Network and Distributed System Security Symposium, NDSS, 2012."},{"key":"ref049","unstructured":"U.\u00a0Maheshwari, R.\u00a0Vingralek and W.\u00a0Shapiro, How to build a trusted database system on untrusted storage, in: Proceedings of the 4th Conference on Symposium on Operating System Design & Implementation, Vol.\u00a04, OSDI, 2000."},{"key":"ref050","doi-asserted-by":"crossref","unstructured":"F.\u00a0McKeen, I.\u00a0Alexandrovich, A.\u00a0Berenzon, C.V.\u00a0Rozas, H.\u00a0Shafi, V.\u00a0Shanbhogue and U.R.\u00a0Savagaonkar, Innovative instructions and software model for isolated execution, in: Workshop on Hardware and Architectural Support for Security and Privacy, HASP, 2013.","DOI":"10.1145\/2487726.2488368"},{"key":"ref051","doi-asserted-by":"crossref","unstructured":"K.\u00a0Mowery, S.\u00a0Keelveedhi and H.\u00a0Shacham, Are AES x86 cache timing attacks still feasible? in: Proceedings of the 2012 ACM Workshop on Cloud Computing Security Workshop, CCSW, 2012.","DOI":"10.1145\/2381913.2381917"},{"key":"ref052","unstructured":"MySQL : MySQL 5.6 Reference Manual : 8.3.8 Comparison of B-Tree and Hash Indexes, http:\/\/dev.mysql.com\/doc\/refman\/5.6\/en\/index-btree-hash.html."},{"key":"ref053","unstructured":"M.\u00a0Naveed, The fallacy of composition of oblivious RAM and searchable encryption, Technical report, IACR Cryptology ePrint Archive, 2015."},{"key":"ref054","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naveed, S.\u00a0Kamara and C.V.\u00a0Wright, Inference attacks on property-preserving encrypted databases, in: Proceedings of the 22nd ACM Conference on Computer and Communications Security, CCS, 2015.","DOI":"10.1145\/2810103.2813651"},{"key":"ref055","unstructured":"O.\u00a0Ohrimenko, F.\u00a0Schuster, C.\u00a0Fournet, A.\u00a0Meht, S.\u00a0Nowozin, K.\u00a0Vaswani and M.\u00a0Costa, Oblivious multi-party machine learning on trusted processors, in: 25th USENIX Security Symposium (USENIX Security 16), 2016."},{"key":"ref056","doi-asserted-by":"crossref","unstructured":"D.A.\u00a0Osvik, A.\u00a0Shamir and E.\u00a0Tromer, Cache attacks and countermeasures: The case of AES, in: CT-RSA 2006: The Cryptographers\u2019 Track at the RSA Conference, 2006.","DOI":"10.1007\/11605805_1"},{"key":"ref057","doi-asserted-by":"crossref","unstructured":"V.\u00a0Pappas, F.\u00a0Krell, B.\u00a0Vo, V.\u00a0Kolesnikov, T.\u00a0Malkin, S.G.\u00a0Choi, W.\u00a0George, A.\u00a0Keromytis and S.\u00a0Bellovin, Blind seer: A\u00a0scalable private dbms, in: Proceedings of the 2014 Symposium on Security and Privacy, S&P, 2014.","DOI":"10.1109\/SP.2014.30"},{"key":"ref058","unstructured":"R.\u00a0Poddar, T.\u00a0Boelter and R.A.\u00a0Popa, Arx: A strongly encrypted database system, Cryptology ePrint Archive, Report 2016\/591, 2016, https:\/\/eprint.iacr.org\/2016\/591."},{"key":"ref059","doi-asserted-by":"crossref","unstructured":"R.A.\u00a0Popa, C.M.S.\u00a0Redfield, N.\u00a0Zeldovich and H.\u00a0Balakrishnan, CryptDB: Protecting confidentiality with encrypted query processing, in: Proceedings of the 23rd ACM Symposium on Operating Systems Principles, SOSP, 2011.","DOI":"10.1145\/2043556.2043566"},{"key":"ref060","unstructured":"R.\u00a0Ramakrishnan and J.\u00a0Gehrke, Database Management Systems, 3rd edn, McGraw-Hill, 2002."},{"key":"ref061","doi-asserted-by":"crossref","unstructured":"F.\u00a0Schuster, M.\u00a0Costa, C.\u00a0Fournet, C.\u00a0Gkantsidis, M.\u00a0Peinado, G.\u00a0Mainar-Ruiz and M.\u00a0Russinovich, VC3: Trustworthy data analytics in the cloud using SGX, in: Proceedings of the 2015 IEEE Symposium on Security and Privacy, S&P, 2015.","DOI":"10.1109\/SP.2015.10"},{"key":"ref062","doi-asserted-by":"crossref","unstructured":"E.\u00a0Shen, E.\u00a0Shi and B.\u00a0Waters, Predicate privacy in encryption systems, in: Proceedings of the 6th Theory of Cryptography Conference, TCC, 2009.","DOI":"10.1007\/978-3-642-00457-5_27"},{"key":"ref063","doi-asserted-by":"crossref","unstructured":"E.\u00a0Shi, J.\u00a0Bethencourt, H.T.H.\u00a0Chan, D.X.\u00a0Song and A.\u00a0Perrig, Multi-dimensional range query over encrypted data, in: Proceedings of the 2007 Symposium on Security and Privacy, S&P, 2007.","DOI":"10.1109\/SP.2007.29"},{"key":"ref064","unstructured":"S.\u00a0Sinofsky, Building the next generation file system for Windows: ReFS, 2012, https:\/\/blogs.msdn.microsoft.com\/b8\/2012\/01\/16\/building-the-next-generation-file-system-for-windows-refs\/."},{"key":"ref065","unstructured":"D.X.\u00a0Song, D.\u00a0Wagner and A.\u00a0Perrig, Practical techniques for searches on encrypted data, in: Proceedings of the 2000 Symposium on Security and Privacy, S&P, 2000."},{"key":"ref066","doi-asserted-by":"crossref","unstructured":"R.\u00a0Strackx, F.\u00a0Piessens and B.\u00a0Preneel, Efficient isolation of trusted subsystems in embedded systems, in: SecureComm, Springer, 2010.","DOI":"10.1007\/978-3-642-16161-2_20"},{"key":"ref067","unstructured":"The Power of B-trees, http:\/\/guide.couchdb.org\/draft\/btree.html."},{"key":"ref068","doi-asserted-by":"crossref","unstructured":"B.\u00a0Wang, Y.\u00a0Hou, M.\u00a0Li, H.\u00a0Wang and H.\u00a0Li, Maple: Scalable multi-dimensional range search over encrypted cloud data with tree-based index, in: Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, ASIA CCS \u201914, 2014.","DOI":"10.1145\/2590296.2590305"},{"key":"ref069","unstructured":"P.\u00a0Wang and C.\u00a0Ravishankar, Secure and efficient range queries on outsourced databases using rp-trees, in: Proceedings of the 30th IEEE International Conference on Data Engineering, ICDE, 2013."},{"key":"ref070","unstructured":"L.\u00a0Xu, Securing the Enterprise with Intel AES-NI, 2010."},{"key":"ref071","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Xu, W.\u00a0Cui and M.\u00a0Peinado, Controlled-channel attacks: Deterministic side channels for untrusted operating systems, in: Proceedings of the 2015 IEEE Symposium on Security and Privacy, S&P, 2015.","DOI":"10.1109\/SP.2015.45"},{"key":"ref072","unstructured":"Y.\u00a0Yarom and K.\u00a0Falkner, FLUSH\u00a0+ RELOAD: A high resolution, low noise, L3 cache side-channel attack, in: 23rd USENIX Security Symposium (USENIX Security 14), USENIX Association, San Diego, CA, 2014, pp.\u00a0719\u2013732. ISBN 978-1-931971-15-7. https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/yarom."}],"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-171103","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCS-171103","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-171103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:45:14Z","timestamp":1777495514000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-171103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,16]]},"references-count":72,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,8,9]]}},"alternative-id":["10.3233\/JCS-171103"],"URL":"https:\/\/doi.org\/10.3233\/jcs-171103","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,16]]}}}