| 摘要 |
The present description refers in particular to a computer-implemented method, a computer program product, and a computer system for automatically generating a digital signature for a message, the message being representable in a hierarchical tree structure and to a computer-implemented method, a computer program product, and a computer system for automatically verifying a digital signature of a message, the message being representable in a hierarchical tree structure. The computer-implemented method for automatically generating a digital signature for a message, the message being representable in a hierarchical tree structure may comprise:
selecting, from a message M T , a sub-message M to be signed, the sub-message M comprising at least one element;
generating a well-formed context C M t for the sub-message M, wherein the well-formed context C M t defines a derivation path to the element in the message M T at a time t, the element being marked [M] in the well-formed context C M t ;
generating a message digest ´ M from the sub-message M and a context digest ´ C from the well-formed context C M t ; and
generating a signature S by applying a secret key s A of a user A to the message digest ´ M and to the context digest ´ C .
The computer-implemented method for automatically verifying a digital signature of a message M T , the message M T being representable in a hierarchical tree structure may comprise:
receiving the message M T comprising a signature S, wherein the signature S is associated with a well-formed context C M t ;
selecting, from the message M T , a sub-message M' to be verified;
decrypting the signature S with a public key p A of a user A, the decrypted signature comprising a message digest ´ M and a context digest ´ C ;
generating a further message digest ´' M from the sub-message M' and a further context digest ´' C from the well-formed context C M t ; and
verifying the signature by checking:
whether the further context digest ´' C equals the context digest ´ C ,
whether the sub-message M' is in a derivation path through the message M T to a marked element [M] , wherein the derivation path is generated from the well-formed context C M t , and
whether the further message digest ´' M equals the message digest ´ M . |
