6533b851fe1ef96bd12aa111

RESEARCH PRODUCT

Secure and Privacy Preserving Pattern Matching in Distributed Cloud-based Data Storage

Vladimir A. Oleshchuk

subject

021110 strategic defence & security studiesTheoretical computer scienceComputer sciencebusiness.industry0211 other engineering and technologiesCloud computing02 engineering and technologyString searching algorithmData structureEncryptionSimple (abstract algebra)Computer data storagePattern matchingbusinessBlossom algorithm

description

Given two strings: pattern $p$ of length $m$ and text $t$ of length $n$ . The string matching problem is to find all (or some) occurrences of the pattern $p$ in the text $t$ . We introduce a new simple data structure, called index arrays, and design fast privacy-preserving matching algorithm for string matching. The motivation behind introducing index arrays is determined by the need for pattern matching on distributed cloud-based datasets with semi-trusted cloud providers. It is intended to use encrypted index arrays both to improve performance and protect confidentiality and privacy of user data.

yearjournalcountryeditionlanguage
2019-09-012019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)
https://doi.org/10.1109/idaacs.2019.8924356