The computer-implemented proof method (M) for structured document comprises the following main steps: receiving in input a structured document comprising a set of nodes, each node comprising a plurality of components (step 51); generating a Merkle tree starting from the structured document (step 2), comprising: determining a plurality of Merkle trees to individually represent each of the components of each of said node of the structured document (step 21); for each node of the structured document, determining a node hash by hashing the Merkle roots of the plurality of Merkle trees representing the 10 components of the node (step 22); when requested, generating a proof related to information contained in the structured document using aid Merkle tree (step 3).
PROOF SYSTEM AND METHOD FOR STRUCTURED DOCUMENTS
F. Bruschi;V. Rana
2020-01-01
Abstract
The computer-implemented proof method (M) for structured document comprises the following main steps: receiving in input a structured document comprising a set of nodes, each node comprising a plurality of components (step 51); generating a Merkle tree starting from the structured document (step 2), comprising: determining a plurality of Merkle trees to individually represent each of the components of each of said node of the structured document (step 21); for each node of the structured document, determining a node hash by hashing the Merkle roots of the plurality of Merkle trees representing the 10 components of the node (step 22); when requested, generating a proof related to information contained in the structured document using aid Merkle tree (step 3).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
