A Secure and Comparable Text Encryption Algorithm
This addresses the need for secure and comparable text encryption, potentially enabling applications like finding scientific collaborators online, though it appears incremental as it builds on existing NP-complete subset sum methods.
The paper tackles the problem of comparing encrypted text messages for semantic similarity without a trusted intermediary, achieving a proportional relationship between encryption similarity and message semantic similarity.
This paper discloses a simple algorithm for encrypting text messages, based on the NP-completeness of the subset sum problem, such that the similarity between encryptions is roughly proportional to the semantic similarity between their generating messages. This allows parties to compare encrypted messages for semantic overlap without trusting an intermediary and might be applied, for example, as a means of finding scientific collaborators over the Internet.