An Efficient Correctness-Verifying Scheme for Searchable Encryption
碩士 === 國立中興大學 === 資訊科學與工程學系所 === 97 === In the open network, servers may be attacked. When a server is under control by the attacker, it cannot be trusted since the attacker may modify or delete some documents. In this paper we propose two schemes to verify the trustfulness of the server....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/50939398460802322282 |