基于逆向树的前向安全动态范围最小值查询方案OA
Forward-Secure Dynamic Range Minimum Query Scheme Based on Reverse Tree
现有的加密范围最小值查询方案主要基于稀疏表技术实现,存在查询时可能泄露查询范围之间关系的问题.此外,这些方案均为静态方案,不支持对加密数据进行更新操作,因而在实际应用中具有一定的局限性.为了解决上述问题,本文提出了一种名为逆向树(reverse tree,RT)的数据结构及其通用构造方法,并基于该数据结构提出了两种满足前向安全的动态加密范围最小值查询方案:RTDRMQ和OMDRMQ.RTDRMQ方案在保证高查询效率的同时,具有较高的更新效率;OMDRMQ方案则具有更好的安全性,有效解决了查询过程中可能泄露查询范围之间关系的问题.实验结果表明,本文提出的方法是实用的.
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.
秦仲言;马昌社;吴昊
华南师范大学计算机学院,广州 510631华南师范大学计算机学院,广州 510631珠海科技学院计算机学院,珠海 519041
信息技术与安全科学
可搜索加密方案范围最小值查询前向安全逆向树
searchable symmetric sncryptionrange minimum queryforward securityreverse tree
《密码学报（中英文）》 2026 (1)
60-79,20
国家自然科学基金(61672243)National Natural Science Foundation of China(61672243)
评论