Secure order preserving string compression
Abstract:
A processor may receive plaintext data. The plaintext data may correspond to a query. The processor may identify a granularity of the plaintext data. The processor may compress the plaintext data using a binary search tree. The binary search tree may compress the plaintext data based on the granularity of the plaintext data. The processor may encrypt the plaintext data by randomizing the order in which the binary search tree stores the compression of the plaintext data. The stored order of the binary search tree may act as a private key. The processor may process the query over an encrypted cumulative compressed database.
Public/Granted literature
Information query
Patent Agency Ranking
0/0