| http://dbpedia.org/ontology/abstract
|
Hyper-encryption is a form of encryption i … Hyper-encryption is a form of encryption invented by Michael O. Rabin which uses a high-bandwidth source of public random bits, together with a secret key that is shared by only the sender and recipient(s) of the message. It uses the assumptions of Ueli Maurer's as the basis of its secrecy. Although everyone can see the data, decryption by adversaries without the secret key is still not feasible, because of the space limitations of storing enough data to mount an attack against the system. Unlike almost all other cryptosystems except the one-time pad, hyper-encryption can be proved to be information-theoretically secure, provided the storage bound cannot be surpassed. Moreover, if the necessary public information cannot be stored at the time of transmission, the plaintext can be shown to be impossible to recover, regardless of the computational capacity available to an adversary in the future, even if they have access to the secret key at that future time. A highly energy-efficient implementation of a hyper-encryption chip was demonstrated by Krishna Palem et al. using the Probabilistic CMOS or PCMOS technology and was shown to be ~205 times more efficient in terms of Energy-Performance-Product.nt in terms of Energy-Performance-Product.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://web.archive.org/web/20060901193344/http:/athome.harvard.edu/dh/hvs.html +
, http://groups.csail.mit.edu/cis/theses/juang-meng-eecs-2009.pdf +
, https://web.archive.org/web/20170706132856/ftp:/ftp.inf.ethz.ch/pub/crypto/publications/DziMau02.pdf +
, https://www.iacr.org/archive/crypto2002/24420257/24420257.ps +
, https://web.archive.org/web/20150429212032/https:/www.iacr.org/archive/crypto2002/24420257/24420257.ps +
|
| http://dbpedia.org/ontology/wikiPageID
|
4907086
|
| http://dbpedia.org/ontology/wikiPageLength
|
4733
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1049304769
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Ueli_Maurer_%28cryptographer%29 +
, http://dbpedia.org/resource/Bit +
, http://dbpedia.org/resource/Perfect_forward_secrecy +
, http://dbpedia.org/resource/Krishna_Palem +
, http://dbpedia.org/resource/Random +
, http://dbpedia.org/resource/Category:Cryptography +
, http://dbpedia.org/resource/Secret_key +
, http://dbpedia.org/resource/Bounded-storage_model +
, http://dbpedia.org/resource/One-time_pad +
, http://dbpedia.org/resource/Category:Information_theory +
, http://dbpedia.org/resource/PCMOS +
, http://dbpedia.org/resource/Randomness_extractor +
, http://dbpedia.org/resource/Michael_O._Rabin +
, http://dbpedia.org/resource/Encryption +
, http://dbpedia.org/resource/Information-theoretically_secure +
|
| http://dbpedia.org/property/date
|
June 2018
|
| http://dbpedia.org/property/fixAttempted
|
yes
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Crypto-stub +
, http://dbpedia.org/resource/Template:Cite_book +
, http://dbpedia.org/resource/Template:More_footnotes +
, http://dbpedia.org/resource/Template:Primary_sources +
, http://dbpedia.org/resource/Template:Cite_journal +
, http://dbpedia.org/resource/Template:Multiple_issues +
, http://dbpedia.org/resource/Template:Dead_link +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Information_theory +
, http://dbpedia.org/resource/Category:Cryptography +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Hyper-encryption?oldid=1049304769&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Hyper-encryption +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q5957534 +
, https://global.dbpedia.org/id/4nNkw +
, http://rdf.freebase.com/ns/m.0ctlpw +
, http://dbpedia.org/resource/Hyper-encryption +
|
| rdfs:comment |
Hyper-encryption is a form of encryption i … Hyper-encryption is a form of encryption invented by Michael O. Rabin which uses a high-bandwidth source of public random bits, together with a secret key that is shared by only the sender and recipient(s) of the message. It uses the assumptions of Ueli Maurer's as the basis of its secrecy. Although everyone can see the data, decryption by adversaries without the secret key is still not feasible, because of the space limitations of storing enough data to mount an attack against the system.ata to mount an attack against the system.
|
| rdfs:label |
Hyper-encryption
|
