| http://www.w3.org/ns/prov#value | - The method can include choosing a secret-key, s, applying a modulus operator [s2 mod n] to the secret-key to produce a large public-key, v, performing a hash of the large public-key to produce the small public-key, hv=hash [s2 mod n], and combining the identifier name with the small public-key to produce the public-key pair <i, hv>, where n is a value that is known to the first peer (Peer 1) and t
|
