Extending homomorphic algorithms for encrypted text comparison.

Area of Science:

• Cryptography
• Computer Science
• Data Security

Background:

• Fully Homomorphic Encryption (FHE) allows computations on encrypted data, enhancing privacy for sensitive applications.
• Existing FHE libraries lack native support for string operations, hindering their use in text-heavy domains.
• Private string search is vital for sensitive identifiers without exposing queries or database content.

Purpose of the Study:

• Introduce a novel algorithm for encrypted string comparison within FHE.
• Enable secure detection of matches between encrypted query and target strings.
• Address the limitation of FHE in handling textual data for privacy-preserving search.

Main Methods:

• Developed a new algorithm for encrypted string comparison operating entirely in the encrypted domain.
• Designed an implementation compatible with existing FHE frameworks.
• Validated the algorithm's correctness and performance through experimental evaluation.

Main Results:

• Demonstrated the feasibility of secure and efficient string matching using FHE.
• The proposed algorithm successfully performs comparisons on encrypted strings without decryption.
• Experimental results confirm the algorithm's effectiveness and efficiency.

Conclusions:

• The developed algorithm overcomes limitations in current FHE libraries for string operations.
• This work enables privacy-preserving search capabilities in real-world applications.
• Paves the way for broader adoption of FHE in sensitive data analysis.