Semantic security
In cryptography, a semantically secure cryptosystem is one where only negligible information about the plaintext can be feasibly extracted from the ciphertext. Specifically, any probabilistic, polynomial-time algorithm (PPTA) that is given the ciphertext of a certain message (taken from any distribution of messages), and the message's length, cannot determine any partial information on the message with probability non-negligibly higher than all other PPTA's that only have access to the message length (and not the ciphertext). This concept is the computational complexity analogue to Shannon's concept of perfect secrecy. Perfect secrecy means that the ciphertext reveals no information at all about the plaintext, whereas semantic security implies that any information revealed cannot be feasi
Wikipage redirect
Authenticated encryptionAveraging argumentBlock cipherBlum–Goldwasser cryptosystemBoneh–Franklin schemeCEILIDHChosen-ciphertext attackCiphertext indistinguishabilityCommitment schemeComputational Diffie–Hellman assumptionDamgård–Jurik cryptosystemDeterministic encryptionEfficient Probabilistic Public-Key Encryption SchemeElGamal encryptionEntropic securityGoldwasser–Micali cryptosystemHard-core predicateHigher residuosity problemIndex of cryptography articlesInformation-theoretic securityInitialization vectorIntegrated Encryption SchemeList of cryptographersMalleability (cryptography)Mental pokerNaccache–Stern cryptosystemNaccache–Stern knapsack cryptosystemOblivious RAMOkamoto–Uchiyama cryptosystemOptimal asymmetric encryption paddingOutline of cryptographyPaillier cryptosystemPlaintext-aware encryptionPrivate information retrievalProbabilistic encryptionProvable securityPseudorandom generatorRSA (cryptosystem)Semantically-secureSemantically secure
Link from a Wikipage to another Wikipage
primaryTopic
Semantic security
In cryptography, a semantically secure cryptosystem is one where only negligible information about the plaintext can be feasibly extracted from the ciphertext. Specifically, any probabilistic, polynomial-time algorithm (PPTA) that is given the ciphertext of a certain message (taken from any distribution of messages), and the message's length, cannot determine any partial information on the message with probability non-negligibly higher than all other PPTA's that only have access to the message length (and not the ciphertext). This concept is the computational complexity analogue to Shannon's concept of perfect secrecy. Perfect secrecy means that the ciphertext reveals no information at all about the plaintext, whereas semantic security implies that any information revealed cannot be feasi
has abstract
Em criptografia, um sistema cr ...... evelada não pode ser extraída.
@pt
In crittografia si definisce s ...... ici difficilmente risolvibili.
@it
In cryptography, a semanticall ...... cannot be feasibly extracted.
@en
La sécurité sémantique est une ...... ations publiques du protocole.
@fr
Семантически стойкой криптосис ...... кого-либо фрагмента сообщения.
@ru
Семантична стійкість — характе ...... во витягнути виконуємим чином.
@uk
语义安全(英語:Semantic Security)是密码学 ...... 何明文的信息,而语义安全侧重表示被揭露的信息不会被实际窃取。
@zh
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,016,601,587
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
Em criptografia, um sistema cr ...... Sigilo perfeito significa que
@pt
In crittografia si definisce s ...... omunemente dal seguente gioco:
@it
In cryptography, a semanticall ...... ation revealed cannot be feasi
@en
La sécurité sémantique est une ...... s des schémas à clef publique.
@fr
Семантически стойкой криптосис ...... ния какой-либо информации об и
@ru
Семантична стійкість — характе ...... во витягнути виконуємим чином.
@uk
语义安全(英語:Semantic Security)是密码学 ...... 何明文的信息,而语义安全侧重表示被揭露的信息不会被实际窃取。
@zh
label
Segurança semântica
@pt
Semantic security
@en
Sicurezza semantica
@it
Sécurité sémantique
@fr
Семантическая стойкость
@ru
Семантична стійкість
@uk
语义安全
@zh