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

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n21http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n7https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n20https://web.archive.org/web/20071114155348/http:/www.rsa.com/rsalabs/
n14http://commons.wikimedia.org/wiki/Special:FilePath/
n16https://web.archive.org/web/20071114154350/http:/www.rsa.com/rsalabs/
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/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://www.arijuels.com/wp-content/uploads/2013/09/
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/
n12https://web.archive.org/web/20110716154251/http:/www.rsa.com/

Statements

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
n14:Client_Puzzle_Generation.svg
dct:subject
dbc:Computer_network_security
dbo:wikiPageID
8412968
dbo:wikiPageRevisionID
1058436826
dbo:wikiPageWikiLink
dbr:Intrusion-prevention_system dbr:Computer_security dbr:Spam_(electronic) dbr:Proof-of-work_system dbr:Client_(computing) dbr:Denial-of-service dbr:Algorithm dbr:Guided_tour_puzzle_protocol dbc:Computer_network_security n21:Client_Puzzle_Generation.svg dbr:Internet dbr:Mathematical_puzzle dbr:Server_(computing)
dbo:wikiPageExternalLink
n11:JB99.pdf n12:press_release.aspx%3Fid=138 n16:node.asp%3Fid=2753 n20:node.asp%3Fid=2050
owl:sameAs
n7:4i4c6 freebase:m.0272jj7 wikidata:Q5132484
dbp:wikiPageUsesTemplate
dbt:Cite_book
dbo:thumbnail
n14: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