$\mathsf {SENTRY}$: A Compliance-Check Service for Dynamic Searchable Encryption With Sanitized Authorization Query

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Services Computing Pub Date : 2026-07-01 Epub Date: 2026-06-01 DOI:10.1109/TSC.2026.3697760
Jinhui Li;Lei Xu;Xiaoning Liu;Xun Yi;Ibrahim Khalil
{"title":"$\\mathsf {SENTRY}$: A Compliance-Check Service for Dynamic Searchable Encryption With Sanitized Authorization Query","authors":"Jinhui Li;Lei Xu;Xiaoning Liu;Xun Yi;Ibrahim Khalil","doi":"10.1109/TSC.2026.3697760","DOIUrl":null,"url":null,"abstract":"Searchable encryption enables privacy-preserving queries over data outsourced to cloud services. Classical symmetric schemes deliver efficient search but largely assume a single-client setting; multi-client variants permit delegation yet typically treat authorization as an owner-local decision, overlooking regulations enforced by higher-level authorities (e.g., sector-specific compliance). In practice, limited familiarity with regulatory detail or operational lapses can lead owners to delegate search permissions that violate authority regulations, rendering existing systems unsuited to regulated, multi-client cloud environments. <p>To address this gap, we propose two systems. First, we propose <inline-formula><tex-math>$\\mathsf {SENTRY}$</tex-math><alternatives><mml:math><mml:mi>SENTRY</mml:mi></mml:math><inline-graphic></alternatives></inline-formula>, a multi-client dynamic searchable encryption framework with a built-in <i>compliance-check service</i> via <i>sanitized authorization</i>. Its core is a tag-based sanitization protocol: the authority encodes prohibited keywords as hidden tags, and the sanitizer uses these tags to remove non-compliant per-keyword search permissions before they reach readers, without learning the underlying keywords. As a result, readers receive only compliant search capabilities. We then propose <inline-formula><tex-math>$\\mathcal {F}-\\mathsf {SENTRY}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mo>-</mml:mo><mml:mi>SENTRY</mml:mi></mml:mrow></mml:math><inline-graphic></alternatives></inline-formula>, a forward-private variant of <inline-formula><tex-math>$\\mathsf {SENTRY}$</tex-math><alternatives><mml:math><mml:mi>SENTRY</mml:mi></mml:math><inline-graphic></alternatives></inline-formula> for settings where regulations evolve over time. <inline-formula><tex-math>$\\mathcal {F}-\\mathsf {SENTRY}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mo>-</mml:mo><mml:mi>SENTRY</mml:mi></mml:mrow></mml:math><inline-graphic></alternatives></inline-formula> preserves the same sanitized-authorization mechanism and further adds forward privacy through a tailored constrained shiftable encryption, which binds search permissions and newly added encrypted updates to regulatory epochs. Consequently, permissions issued before a policy change cannot be used to retrieve data added afterward unless they are refreshed for the new epoch. We formalize the security of both <inline-formula><tex-math>$\\mathsf {SENTRY}$</tex-math><alternatives><mml:math><mml:mi>SENTRY</mml:mi></mml:math><inline-graphic></alternatives></inline-formula> and <inline-formula><tex-math>$\\mathcal {F}-\\mathsf {SENTRY}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mo>-</mml:mo><mml:mi>SENTRY</mml:mi></mml:mrow></mml:math><inline-graphic></alternatives></inline-formula> and prove them secure under standard assumptions. Experiments under cloud-like workloads show that <inline-formula><tex-math>$\\mathsf {SENTRY}$</tex-math><alternatives><mml:math><mml:mi>SENTRY</mml:mi></mml:math><inline-graphic></alternatives></inline-formula> achieves regulation-compliant authorization with modest overhead, while <inline-formula><tex-math>$\\mathcal {F}-\\mathsf {SENTRY}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mo>-</mml:mo><mml:mi>SENTRY</mml:mi></mml:mrow></mml:math><inline-graphic></alternatives></inline-formula> provides stronger protection under changing regulations at practical additional cost.</p>","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"19 4","pages":"3042-3058"},"PeriodicalIF":6.2000,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11536887/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/1 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Searchable encryption enables privacy-preserving queries over data outsourced to cloud services. Classical symmetric schemes deliver efficient search but largely assume a single-client setting; multi-client variants permit delegation yet typically treat authorization as an owner-local decision, overlooking regulations enforced by higher-level authorities (e.g., sector-specific compliance). In practice, limited familiarity with regulatory detail or operational lapses can lead owners to delegate search permissions that violate authority regulations, rendering existing systems unsuited to regulated, multi-client cloud environments.

To address this gap, we propose two systems. First, we propose $\mathsf {SENTRY}$SENTRY, a multi-client dynamic searchable encryption framework with a built-in compliance-check service via sanitized authorization. Its core is a tag-based sanitization protocol: the authority encodes prohibited keywords as hidden tags, and the sanitizer uses these tags to remove non-compliant per-keyword search permissions before they reach readers, without learning the underlying keywords. As a result, readers receive only compliant search capabilities. We then propose $\mathcal {F}-\mathsf {SENTRY}$F-SENTRY, a forward-private variant of $\mathsf {SENTRY}$SENTRY for settings where regulations evolve over time. $\mathcal {F}-\mathsf {SENTRY}$F-SENTRY preserves the same sanitized-authorization mechanism and further adds forward privacy through a tailored constrained shiftable encryption, which binds search permissions and newly added encrypted updates to regulatory epochs. Consequently, permissions issued before a policy change cannot be used to retrieve data added afterward unless they are refreshed for the new epoch. We formalize the security of both $\mathsf {SENTRY}$SENTRY and $\mathcal {F}-\mathsf {SENTRY}$F-SENTRY and prove them secure under standard assumptions. Experiments under cloud-like workloads show that $\mathsf {SENTRY}$SENTRY achieves regulation-compliant authorization with modest overhead, while $\mathcal {F}-\mathsf {SENTRY}$F-SENTRY provides stronger protection under changing regulations at practical additional cost.

哨兵:符合检查服务的动态可搜索加密与消毒的授权查询
可搜索的加密可以对外包给云服务的数据进行隐私保护查询。经典的对称方案提供了高效的搜索,但很大程度上假设了单客户端设置;多客户端变体允许委托,但通常将授权视为所有者-本地决策,忽略由更高级别的机构执行的法规(例如,特定于部门的遵从性)。在实践中,对监管细节的不熟悉或操作失误可能导致所有者授予违反权威法规的搜索权限,从而使现有系统不适合受监管的多客户端云环境。为了解决这一差距,我们提出了两种制度。首先,我们提出$\mathsf {SENTRY}$SENTRY,这是一个多客户端动态可搜索的加密框架,通过经过处理的授权,具有内置的合规性检查服务。它的核心是基于标签的清理协议:权威机构将禁止的关键字编码为隐藏标签,清理程序使用这些标签在不了解底层关键字的情况下,在到达阅读器之前删除不兼容的每个关键字搜索权限。因此,读者只能获得兼容的搜索功能。然后,我们提出$\mathcal {F}-\mathsf {SENTRY}$F-SENTRY, $\mathsf {SENTRY}$SENTRY的前向私有变体,用于规则随时间变化的设置。$\mathcal {F}-\mathsf {SENTRY}$F-SENTRY保留了相同的净化授权机制,并通过定制的受限可移动加密进一步增加了转发隐私,该加密将搜索权限和新添加的加密更新绑定到监管时代。因此,在策略更改之前颁发的权限不能用于检索之后添加的数据,除非针对新时代对其进行刷新。我们形式化了$\mathsf {SENTRY}$SENTRY和$\mathcal {F}-\mathsf {SENTRY}$F-SENTRY的安全性,并证明了它们在标准假设下的安全性。在类似云的工作负载下的实验表明,$\mathsf {SENTRY}$SENTRY以适度的开销实现符合法规的授权,而$\mathcal {F}-\mathsf {SENTRY}$F-SENTRY在不断变化的法规下提供更强的保护,但实际的额外成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书