On Designing Comparison Searchable Encryption based on Braid Group

• Main Authors: Kuo-Chang Chen, 陳國璋
• Other Authors: Gwoboa Horng
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/89349060517834391486

碩士 === 國立中興大學 === 資訊科學與工程學系所 === 98 === Most keyword-searchable encryption schemes are unable to provide range query of keywords. Shi et al. first proposed a keyword-searchable encryption based on the concept of tree structures and hyper-rectangles. Boneh et al. proposed hidden vector encryption scheme which has the ability to support range queries, subset queries, and comparison queries. In their scheme, a user needs to construct a predicate vector for the server to test. This thesis presents a comparable keyword-searchable encryption scheme based on braid group. The proposed scheme can support comparison query. Furthermore, it is more efficient than previous schemes, and needs less computation and communication costs.