セマンティックセキュリティー
Sign in to savesecurity 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
In the Vinony graph
Within Vinony's link graph, セマンティックセキュリティー is referenced by 42 other articles, and connects out to Ciphertext indistinguishability, International Standard Book Number and cryptography.
It is catalogued under the topic Theory of cryptography.
Its subject is documented across 10 Wikipedia language editions.
Connections
Ciphertext indistinguishability
Entity
International Standard Book Number
Entity
cryptography
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Claude Shannon
Entity
randomness
Entity
public-key cryptography
Entity
RSA
Entity
symmetric-key algorithm
Entity
Shafrira Goldwasser
Entity
analysis of algorithms
Entity
Handle System
Entity
plaintext
Entity
Silvio Micali
Entity
ElGamal encryption
Entity
cryptosystem
Entity
ciphertext
Entity
PP
Entity
optimal asymmetric encryption padding
Entity