- From: Peter Patel-Schneider <pfpschneider@gmail.com>
- Date: Tue, 04 May 2021 10:59:48 -0400
- To: Manu Sporny <msporny@digitalbazaar.com>, Dan Brickley <danbri@google.com>, Phil Archer <phil.archer@gs1.org>
- Cc: Ivan Herman <ivan@w3.org>, Dan Brickley <danbri@danbri.org>, Aidan Hogan <aidhog@gmail.com>, Pierre-Antoine Champin <pierre-antoine@w3.org>, Ramanathan Guha <guha@google.com>, semantic-web <semantic-web@w3.org>
On Tue, 2021-05-04 at 10:39 -0400, Manu Sporny wrote: > [...] > > The Linked Data Signatures signing algorithm consists of 4 phases: > > 1. Canonicalization of input data > 2. Cryptographic hashing > 3. Digitally signing > 4. Expressing the signature > > RDF really only comes into play in steps #1 and #4... and it's > possible for it > to not come into play at all. > > For example, you can use JCS[1] to canonicalize in step #1, and > simple > key-values to express the signature in #4. Workday and Microsoft do > this today > with one of their Linked Data Cryptosuites. > [...] > > -- manu > > [1]https://tools.ietf.org/html/rfc8785 > Is using JCS viable? Is there a unique canonicalization of an RDF dataset (or RDF graph) expressed in JSON-LD? If not, then I don't see how this could work. peter
Received on Tuesday, 4 May 2021 15:01:03 UTC