Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/112650
DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineeringen_US
dc.contributorMainland Development Officeen_US
dc.creatorWu, Hen_US
dc.creatorPeng, Zen_US
dc.creatorXiao, Jen_US
dc.creatorXue, Len_US
dc.creatorLin, Cen_US
dc.creatorChung, SHen_US
dc.date.accessioned2025-04-24T05:17:42Z-
dc.date.available2025-04-24T05:17:42Z-
dc.identifier.issn1545-5971en_US
dc.identifier.urihttp://hdl.handle.net/10397/112650-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.subjectBackward privacyen_US
dc.subjectDynamic searchable symmetric encryptionen_US
dc.subjectForward privacyen_US
dc.subjectRich queriesen_US
dc.subjectTrusted execution environmenten_US
dc.titleHeX : encrypted rich queries with forward and backward privacy using trusted hardwareen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1109/TDSC.2025.3540958en_US
dcterms.abstractDynamic searchable symmetric encryption (DSSE) schemes empower data owners to outsource their encrypted data to clouds while retaining the ability to update or search on it. Despite a lot of efforts devoted in recent years, there are still several challenges that have not been well addressed. Firstly, the confidentiality of data might be compromised if forward privacy and backward privacy cannot be ensured. Secondly, only the traditional single keyword-file search has attracted tremendous attention, while other popular queries like Boolean queries and range queries are not fully investigated. Lastly, how to solve these problems on untrusted servers that may deviate from pre-defined protocols is also challenging. In this paper, aiming to tackle the above problems, we propose a novel DSSE scheme named HeX based on Trusted Execution Environment (TEE) that supports rich queries on untrusted servers while guaranteeing forward and backward privacy. We achieve strong forward and backward security by designing a deferred obfuscating read-write technique atop the bitmap index. We further extend the basic scheme to realize Boolean queries and range queries by reducing them to basic keyword queries. Strict theoretical analysis is conducted to prove the security of HeX, and extensive evaluations illustrate its efficiency and practicality.en_US
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationIEEE transactions on dependable and secure computing, Date of Publication: 11 February 2025, Early Access, https://doi.org/10.1109/TDSC.2025.3540958en_US
dcterms.isPartOfIEEE transactions on dependable and secure computingen_US
dcterms.issued2025-
dc.identifier.eissn1941-0018en_US
dc.description.validate202504 bcchen_US
dc.description.oaNot applicableen_US
dc.identifier.FolderNumbera3554-
dc.identifier.SubFormID50342-
dc.description.fundingSourceRGCen_US
dc.description.pubStatusEarly releaseen_US
dc.date.embargo0000-00-00 (to be updated)en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 0000-00-00 (to be updated)
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.