security guarantee in which any probabilistic polynomial-time algorithm (PPTA) given the ciphertext and the message length can’t find any information on the message with probability nonnegligibly higher than a PPTA only given the message length
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).