Ontology for Certificates and crypto stuff.
This is in development.
Some other ontologies to look at:
* http://www.w3.org/2000/10/swap/crypto
+ has cwm builtins: http://www.w3.org/2000/10/swap/doc/Trust
- a bit old perhaps. It imports daml+oil
- would help to be more completely specified
- uses literals as subjects a little liberally, which makes this a
bit difficult to work with frameworks that don't permit this
* http://xmlns.com/wot/0.1/
- limited very much to PGP (though on can map PGP to X509)
- a little coarse grained, mixes up the PGP certificate with the PGP
public key
*
A certificate is a Document that is signed.
As explained here http://www.pgpi.org/doc/pgpintro/#p16
'A digital certificate consists of three things:
* A public key.
* Certificate information. ('Identity' information about the
user, such as name, user ID, and so on.)
* One or more digital signatures.'
The class of all integers, however large they be.
This should be defined in another ontology.
Different representations for each can be defined via relations to string
literals.
This is the class of xsd:integer literals.
the class of keys
the class of PGP Certificates
Private Key
Public Key
The union of the public and private components of an RSAKey.
Usually those pieces are not kept together
A Private Key in the RSA framework
The RSA public key. Padded message m are encrypted by applying the function
modulus(power(m,exponent),modulus)
the class of signtatures
the class of X509 Certificates
the identity of the public key. These is the entity that knows the private key and so can decrypt messages encrypted with the public key, or encrypt messages that can be decrypted with the public key.
The modulus of an RSA public and private key.
This is defined as n = p*q
The encoding of an integer as an octet string, as defined in section 8.3 of International Telecommunications Unions (ITU) X.690 spec.
The exponent used to decrypt the message
calculated as
public_exponent*private_exponent â‰¡ 1 modulo totient(p*q)
The private exponent is often named 'd'
The exponent used to encrypt the message. Number chosen between
1 and the totient(p*q). Often named 'e' .
relates the private key to the public key component, in a public/private
key pair.