Skip to content
EntityQ2333581· pop 10· linked from 42 articles

semantic security

Sign in to save

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

Available in 10 languages

via Wikidata sitelinks · CC0

Connections

Categories