HTML Microdata document

This HTML5 document contains 34 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n4	http://dbpedia.org/resource/File:
n8	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
n17	http://commons.wikimedia.org/wiki/Special:FilePath/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
prov	http://www.w3.org/ns/prov#
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Security_parameter
dbo:wikiPageWikiLink: dbr:Computationally_bounded_adversary

Subject Item: dbr:Concrete_security
dbo:wikiPageWikiLink: dbr:Computationally_bounded_adversary

Subject Item: dbr:Computationally_bounded_adversary
rdfs:label: Computationally bounded adversary
rdfs:comment: In information theory, the computationally bounded adversary problem is a different way of looking at the problem of sending data over a noisy channel. In previous models the best that could be done was ensuring correct decoding for up to d/2 errors, where d was the Hamming distance of the code. The problem with doing it this way is that it does not take into consideration the actual amount of computing power available to the adversary. Rather, it only concerns itself with how many bits of a given code word can change and still have the message decode properly. In the computationally bounded adversary model the channel – the adversary – is restricted to only being able to perform a reasonable amount of computation to decide which bits of the code word need to change. In other words, this m
foaf:depiction: n17:Illustration_of_Proof_for_Computationally_Bounded_Adversary.png
dcterms:subject: dbc:Coding_theory dbc:Computational_complexity_theory
dbo:wikiPageID: 39275268
dbo:wikiPageRevisionID: 729252360
dbo:wikiPageWikiLink: dbr:Locally_decodable_code n4:Illustration_of_Proof_for_Computationally_Bounded_Adversary.png dbr:Worst-case_complexity dbr:Adversary_(cryptography) dbr:List_decoding dbc:Computational_complexity_theory dbc:Coding_theory dbr:Quicksort dbr:Private_information_retrieval dbr:Information_theory dbr:Fault-tolerant
owl:sameAs: n8:fE6o wikidata:Q17008711 freebase:m.0t_dmtr
dbp:wikiPageUsesTemplate: dbt:Reflist
dbo:thumbnail: n17:Illustration_of_Proof_for_Computationally_Bounded_Adversary.png?width=300
dbo:abstract: In information theory, the computationally bounded adversary problem is a different way of looking at the problem of sending data over a noisy channel. In previous models the best that could be done was ensuring correct decoding for up to d/2 errors, where d was the Hamming distance of the code. The problem with doing it this way is that it does not take into consideration the actual amount of computing power available to the adversary. Rather, it only concerns itself with how many bits of a given code word can change and still have the message decode properly. In the computationally bounded adversary model the channel – the adversary – is restricted to only being able to perform a reasonable amount of computation to decide which bits of the code word need to change. In other words, this model does not need to consider how many errors can possibly be handled, but only how many errors could possibly be introduced given a reasonable amount of computing power on the part of the adversary. Once the channel has been given this restriction it becomes possible to construct codes that are both faster to encode and decode compared to previous methods that can also handle a large number of errors.
gold:hypernym: dbr:Way
prov:wasDerivedFrom: wikipedia-en:Computationally_bounded_adversary?oldid=729252360&ns=0
dbo:wikiPageLength: 7972
foaf:isPrimaryTopicOf: wikipedia-en:Computationally_bounded_adversary

Subject Item: dbr:Secure_two-party_computation
dbo:wikiPageWikiLink: dbr:Computationally_bounded_adversary

Subject Item: dbr:Adversary_(cryptography)
dbo:wikiPageWikiLink: dbr:Computationally_bounded_adversary

Subject Item: dbr:Negligible_function
dbo:wikiPageWikiLink: dbr:Computationally_bounded_adversary

Subject Item: wikipedia-en:Computationally_bounded_adversary
foaf:primaryTopic: dbr:Computationally_bounded_adversary