- 期刊
Analysis of a Privacy Preserving Ranked Multi-Keyword Search Scheme
摘要
The scheme [IEEE Trans. Computers, 65(5), 2016, 1566-1577] aims to enable cloud servers to perform secure search without knowing the actual contents of both keywords and trapdoors in the scenario of multi-owners and multi-users. To rank the search results and preserve the privacy of relevance scores between keywords and files, it needs to construct an Additive Order and Privacy Preserving Function family. In this paper, we show that the proposed construction is awed, because the basic order and privacy preserving function is not well-defined. The univariate recurrence equation only generates a trivial linear transformation. It neglected the fact that an order preserving encryption was generally believed to be insecure because it was quite vulnerable to statistical attack.
延伸閱讀
- Kang, Y. C. (2015). Privacy-Preserving Multi-keyword Ranked Search with Verifying and Updating Efficiently [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2015.01004
- Lee, C. C., Hsu, S. T., & Hwang, M. S. (2013). A Study of Conjunctive Keyword Searchable Schemes. International Journal of Network Security, 15(5), 321-330. https://doi.org/10.6633/IJNS.201309.15(5).01
- 俞潔伶（2009）。Exploring Online Users' Keyword Searching Behavior〔碩士論文，國立臺北大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0023-0807200900385500
- Hsu, S. T., Yang, C. C., & Hwang, M. S. (2013). A Study of Public Key Encryption with Keyword Search. International Journal of Network Security, 15(2), 71-79. https://doi.org/10.6633/IJNS.201303.15(2).01
- Lin, J. K. (2022). Flexible and Efficient Multi-Keyword Ranked Searchable Attribute-based Encryption Schemes [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU202201738