This HTML5 document contains 21 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/
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/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Cryptographic_protocol
dbo:wikiPageWikiLink
dbr:Protocol_composition_logic
Subject Item
dbr:UDP-based_Data_Transfer_Protocol
dbo:wikiPageWikiLink
dbr:Protocol_composition_logic
Subject Item
dbr:Protocol_composition_logic
rdfs:label
Protocol composition logic
rdfs:comment
Protocol Composition Logic is a formal method that is used for proving security properties of protocols that use symmetric key and Public key cryptography. PCL is designed around a process calculi with actions for possible protocol steps like generating some random number, perform encryption and decryption, send and receive messages and digital signature verification actions. Some problems with the logic have been found implying that some currently claimed proofs cannot be proven within the logic.
dcterms:subject
dbc:Cryptography
dbo:wikiPageID
24649771
dbo:wikiPageRevisionID
1058716094
dbo:wikiPageWikiLink
dbr:Symmetric-key_algorithm dbc:Cryptography dbr:Digital_signature dbr:Process_calculus dbr:Public-key_cryptography
owl:sameAs
n7:4ta1m wikidata:Q7251929 freebase:m.0806_mj
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
Protocol Composition Logic is a formal method that is used for proving security properties of protocols that use symmetric key and Public key cryptography. PCL is designed around a process calculi with actions for possible protocol steps like generating some random number, perform encryption and decryption, send and receive messages and digital signature verification actions. Some problems with the logic have been found implying that some currently claimed proofs cannot be proven within the logic.
prov:wasDerivedFrom
wikipedia-en:Protocol_composition_logic?oldid=1058716094&ns=0
dbo:wikiPageLength
941
foaf:isPrimaryTopicOf
wikipedia-en:Protocol_composition_logic
Subject Item
wikipedia-en:Protocol_composition_logic
foaf:primaryTopic
dbr:Protocol_composition_logic