密码学报（中英文）2026，Vol.13Issue(1)：60-79,20.DOI:10.13868/j.cnki.jcr.000838
基于逆向树的前向安全动态范围最小值查询方案
Forward-Secure Dynamic Range Minimum Query Scheme Based on Reverse Tree
摘要
Abstract
Existing encrypted range minimum query(ERMQ)schemes are primarily based on sparse table techniques,which may leak relationships between query ranges during searches.Addition-ally,these schemes are static and do not support updates on encrypted data,limiting their practical applications.To address these issues,this study proposes a novel cryptographic primitive called the Reverse Tree(RT)and its general construction.Based on this primitive,two dynamic and forward pri-vate encrypted range minimum query schemes are presented:RTDRMQ and OMDRMQ.The scheme RTDRMQ ensures high query efficiency while providing high update efficiency,whereas the scheme OMDRMQ offers enhanced security to mitigate the leakage of relationships between query ranges during searches.Experimental results demonstrate the practicality of the proposed schemes.关键词
可搜索加密方案/范围最小值查询/前向安全/逆向树Key words
searchable symmetric sncryption/range minimum query/forward security/reverse tree分类
信息技术与安全科学引用本文复制引用
秦仲言,马昌社,吴昊..基于逆向树的前向安全动态范围最小值查询方案[J].密码学报（中英文）,2026,13(1):60-79,20.基金项目
国家自然科学基金(61672243)National Natural Science Foundation of China(61672243) （61672243）
