Please describe your proposed solution
While searching the blockchain using a third party tool like an explorer on the Internet a user has to reveal the search term like address or staking address to receive matching results. Such information is sensitive and ideally kept private.
I am researching and developing a new type of blockchain information search that maintains a good level of privacy and provably returns correct results. This is achieved on the user's end with encoding the query in a filter using hashing the search terms. The filter is then handed over to a third party service which applies it to a blockchain search and returns the matching results to the client. In a final step this result set is further trimmed on the user's end to extract the true results.
The query is not revealed to the service in plaintext. It only learns about the query's results, which contain the true results but also many false positives.
There is some overhead involved in this type of search which is inevitable. In the research paper I am quantifying the overhead and discuss strategies to optimise the search. Also shown is an evaluation of the new method, which is benchmarked against a search without privacy preservation.