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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n15http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n17https://web.archive.org/web/20071114155348/http:/www.rsa.com/rsalabs/
n16https://web.archive.org/web/20071114154350/http:/www.rsa.com/rsalabs/
n19http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
n9http://www.arijuels.com/wp-content/uploads/2013/09/
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/
n8https://web.archive.org/web/20110716154251/http:/www.rsa.com/

Statements

Subject Item
dbr:DDoS_mitigation
dbo:wikiPageWikiLink
dbr:Client_Puzzle_Protocol
Subject Item
dbr:Client_Puzzle_Protocol
rdf:type
dbo:Software
rdfs:label
Client Puzzle Protocol
rdfs:comment
Client Puzzle Protocol (CPP) is a computer algorithm for use in Internet communication, whose goal is to make abuse of server resources infeasible. It is an implementation of a proof-of-work system (POW).
foaf:depiction
n19:Client_Puzzle_Generation.svg
dcterms:subject
dbc:Computer_network_security
dbo:wikiPageID
8412968
dbo:wikiPageRevisionID
1058436826
dbo:wikiPageWikiLink
dbr:Algorithm dbr:Client_(computing) dbr:Server_(computing) dbr:Computer_security dbr:Denial-of-service n15:Client_Puzzle_Generation.svg dbc:Computer_network_security dbr:Guided_tour_puzzle_protocol dbr:Intrusion-prevention_system dbr:Internet dbr:Spam_(electronic) dbr:Proof-of-work_system dbr:Mathematical_puzzle
dbo:wikiPageExternalLink
n8:press_release.aspx%3Fid=138 n9:JB99.pdf n16:node.asp%3Fid=2753 n17:node.asp%3Fid=2050
owl:sameAs
wikidata:Q5132484 n18:4i4c6 freebase:m.0272jj7
dbp:wikiPageUsesTemplate
dbt:Cite_book
dbo:thumbnail
n19:Client_Puzzle_Generation.svg?width=300
dbo:abstract
Client Puzzle Protocol (CPP) is a computer algorithm for use in Internet communication, whose goal is to make abuse of server resources infeasible. It is an implementation of a proof-of-work system (POW). The idea of the CPP is to require all clients connecting to a server to correctly solve a mathematical puzzle before establishing a connection, if the server is under attack. After solving the puzzle, the client would return the solution to the server, which the server would quickly verify, or reject and drop the connection. The puzzle is made simple and easily solvable but requires at least a minimal amount of computation on the client side. Legitimate users would experience just a negligible computational cost, but abuse would be deterred: those clients that try to simultaneously establish a large number of connections would be unable to do so because of the computational cost (time delay). This method holds promise in fighting some types of spam as well as other attacks like denial-of-service.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Client_Puzzle_Protocol?oldid=1058436826&ns=0
dbo:wikiPageLength
2253
foaf:isPrimaryTopicOf
wikipedia-en:Client_Puzzle_Protocol
Subject Item
dbr:Proof_of_space
dbo:wikiPageWikiLink
dbr:Client_Puzzle_Protocol
Subject Item
dbr:Proof_of_work
dbo:wikiPageWikiLink
dbr:Client_Puzzle_Protocol
Subject Item
dbr:Guided_tour_puzzle_protocol
dbo:wikiPageWikiLink
dbr:Client_Puzzle_Protocol
Subject Item
dbr:Client_Puzzle
dbo:wikiPageWikiLink
dbr:Client_Puzzle_Protocol
dbo:wikiPageRedirects
dbr:Client_Puzzle_Protocol
Subject Item
wikipedia-en:Client_Puzzle_Protocol
foaf:primaryTopic
dbr:Client_Puzzle_Protocol