Speaker
Description
As the volume of sensitive data stored in the cloud continues to grow exponentially, ensuring the privacy and security of this information has become increasingly critical. However, conventional encryption techniques often hinder efficient search operations on encrypted data. Additionally, the ability to perform fuzzy searches is crucial in handling real-world data containing typographical errors or variations in word forms. To address these challenges, a searchable encryption library in Java is presented that enables secure and efficient text search over encrypted data.
The library is designed to provide a comprehensive and efficient solution for privacy-preserving and flexible information retrieval. It achieves this by integrating three main features: the Advanced Encryption Standard (AES) algorithm for robust data encryption, an n-gram based inverted index structure, and the BM25 ranking algorithm enhanced with proximity scoring.
The AES algorithm is widely regarded as one of the most secure encryption techniques available. It provides a high level of confidentiality and ensures that data stored in the cloud is safe from unauthorized access or tampering. This feature is particularly important for sensitive data such as financial or personal information.
The n-gram based inverted index structure is a flexible and powerful technique for mapping terms to document IDs and term positions. It allows for fuzzy search capabilities which means that users can perform searches using keywords that may not exactly match the exact phrasing in the documents, yet still receive accurate and relevant results. Additionally, the inverted index structure enables quick and precise search operations, ensuring efficient and effective information retrieval.
The BM25 ranking algorithm is a widely used algorithm for measuring the relevance of search results. By incorporating proximity scoring, the library is able to further refine the relevance of the search results. Proximity scoring considers not only the frequency of a search term in a document, but also the proximity of the term to other search terms. This approach provides more accurate and relevant search results, enhancing the library's search capabilities.
By incorporating all of these characteristics, a searchable encryption library was created to meet the increasing demand for private and adaptable information retrieval across diverse domains, providing a robust solution for information security and privacy researchers and developers.
