<p>To prove unforgeability of threshold signatures TSig =(TKeyGen, TSign, Verify), it is sufficient to prove that the underlying signature scheme Sig=(KeyGen, Sign, Verify)
is secure and TSig is simulatable.
My question is what's the intuition behind defining the security of threshold blind signatures the same way, and is it applicable for signatures on committed messages.</p>

CC BY-SA 3.0
2011-05-24T23:05:59.900Z
it might be helpful if you gave a reference (for the specific paper(s) it seems you have in mind).
Daniel Apon
CC BY-SA 3.0
2011-05-26T12:45:01.600Z
@daniel, here is a reference [Provably Secure Blind Threshold Signatures Based on Discrete Logarithm](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.105.8000&rep=rep1&type=pdf).
sam
<cr.crypto-security>
Security of threshold blind signatures
sam
# Security of threshold blind signatures

(Asked by: username_0 on 2011-05-24)

To prove unforgeability of threshold signatures TSig =(TKeyGen, TSign, Verify), it is sufficient to prove that the underlying signature scheme Sig=(KeyGen, Sign, Verify)
is secure and TSig is simulatable.
My question is what's the intuition behind defining the security of threshold blind signatures the same way, and is it applicable for signatures on committed messages.

**Tags:** cr.crypto-security
> **Comments:**
> **username_1**: it might be helpful if you gave a reference (for the specific paper(s) it seems you have in mind).  
> **username_0**: @daniel, here is a reference [Provably Secure Blind Threshold Signatures Based on Discrete Logarithm](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.105.8000&rep=rep1&type=pdf).  

---

## 0 answers

