| http://dbpedia.org/ontology/abstract
|
Probabilistic encryption is the use of ran … Probabilistic encryption is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. The term "probabilistic encryption" is typically used in reference to public key encryption algorithms; however various symmetric key encryption algorithms achieve a similar property (e.g., block ciphers when used in a chaining mode such as CBC), and stream ciphers such as Freestyle which are inherently random. To be semantically secure, that is, to hide even partial information about the plaintext, an encryption algorithm must be probabilistic.ncryption algorithm must be probabilistic.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://github.com/arun-babu/freestyle +
, https://web.archive.org/web/20090319000035/http:/groups.csail.mit.edu/cis/pubs/shafi/1984-jcss.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
1051442
|
| http://dbpedia.org/ontology/wikiPageLength
|
4480
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1080447485
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Theory_of_cryptography +
, http://dbpedia.org/resource/Trapdoor_permutation +
, http://dbpedia.org/resource/Silvio_Micali +
, http://dbpedia.org/resource/Randomized_algorithm +
, http://dbpedia.org/resource/Public_key_cryptography +
, http://dbpedia.org/resource/Semantic_security +
, http://dbpedia.org/resource/Deterministic_algorithm +
, http://dbpedia.org/resource/Random_oracle +
, http://dbpedia.org/resource/Cryptographic_hash_function +
, http://dbpedia.org/resource/Block_ciphers +
, http://dbpedia.org/resource/Ciphertext +
, http://dbpedia.org/resource/Deterministic_encryption +
, http://dbpedia.org/resource/Strong_secrecy +
, http://dbpedia.org/resource/Symmetric_key_encryption +
, http://dbpedia.org/resource/Quadratic_residuosity_problem +
, http://dbpedia.org/resource/Paillier +
, http://dbpedia.org/resource/Random_oracle_model +
, http://dbpedia.org/resource/Hard_core_predicate +
, http://dbpedia.org/resource/Optimal_Asymmetric_Encryption_Padding +
, http://dbpedia.org/resource/Encryption +
, http://dbpedia.org/resource/Shafi_Goldwasser +
, http://dbpedia.org/resource/ElGamal_encryption +
, http://dbpedia.org/resource/Plaintext +
, http://dbpedia.org/resource/Efficient_Probabilistic_Public-Key_Encryption_Scheme +
, http://dbpedia.org/resource/Adversary_%28cryptography%29 +
, http://dbpedia.org/resource/Randomness +
, http://dbpedia.org/resource/Cipher_block_chaining +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Theory_of_cryptography +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Use +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Probabilistic_encryption?oldid=1080447485&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Probabilistic_encryption +
|
| owl:sameAs |
http://dbpedia.org/resource/Probabilistic_encryption +
, https://global.dbpedia.org/id/4ti2q +
, http://tr.dbpedia.org/resource/Probabilistik_%C5%9Fifreleme +
, http://rdf.freebase.com/ns/m.041r7v +
, http://he.dbpedia.org/resource/%D7%94%D7%A6%D7%A4%D7%A0%D7%94_%D7%94%D7%A1%D7%AA%D7%91%D7%A8%D7%95%D7%AA%D7%99%D7%AA +
, http://www.wikidata.org/entity/Q7246854 +
|
| rdfs:comment |
Probabilistic encryption is the use of ran … Probabilistic encryption is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. The term "probabilistic encryption" is typically used in reference to public key encryption algorithms; however various symmetric key encryption algorithms achieve a similar property (e.g., block ciphers when used in a chaining mode such as CBC), and stream ciphers such as Freestyle which are inherently random. To be semantically secure, that is, to hide even partial information about the plaintext, an encryption algorithm must be probabilistic.ncryption algorithm must be probabilistic.
|
| rdfs:label |
Probabilistic encryption
|
