Forward and Backward Secure Dynamic Searchable Encryption Schemes Based on vORAM
To solve the problem of keyword retrieval caused by encrypting and storing sensitive data on the cloud platform,a for-ward and backward secure dynamic searchable encryption scheme FBDSE-Ⅰ is proposed by introducing a new oblivious data struc-ture.By using the history-independence and secure deletion of the oblivious data structure,FBDSE-Ⅰ scheme realizes the direct de-letion of keyword/file-identifier pairs,ensures the security of data updating,and simplifies the dynamic update process.Further-more,an improved scheme,FBDSE-Ⅱ,is proposed to achieve more efficient query operation.The map dictionary structure is used to decouple the oblivious primitives and search results,so as to reduce the number to access vORAM in the query process.In ad-dition,the formal security proof is given.It is proved that FBDSE-Ⅰ and FBDSE-Ⅱ schemes respectively satisfy Type-Ⅰ and Type-Ⅲ backward security while ensuring forward security.Experimental results show that FBDSE-I and FBDSE-Ⅱ schemes are more efficient than the forward and backward secure dynamic searchable encryption schemes at the same level.In particular,the larger the scale of data sets,the more significant the advantage becomes.
Dynamic searchable encryptionForward secureBackward secureOblivious data structurevORAM
NETL
NSTL
万方数据
