- #1
tade
- 721
- 26
We're looking at some specific cases here, and I'm interested in how mathematics can prevent certain problems from arising.
So let's say that a party is requesting peoples' signatures. And one problem is that said party might attempt to forge the signatures.
And another problem is that a signatory might want to deny and repudiate that he gave his signature and claim that that party forged the signature, while the actual fact is that he really did give his signature.
So I was wondering about when it comes to the mathematical methods of creating digital signatures, how do they prevent these mentioned problems from arising?
I guess its also a given that any method which solves one of the problems also solves the other one.
So let's say that a party is requesting peoples' signatures. And one problem is that said party might attempt to forge the signatures.
And another problem is that a signatory might want to deny and repudiate that he gave his signature and claim that that party forged the signature, while the actual fact is that he really did give his signature.
So I was wondering about when it comes to the mathematical methods of creating digital signatures, how do they prevent these mentioned problems from arising?
I guess its also a given that any method which solves one of the problems also solves the other one.
Last edited: