2
$\begingroup$

For detecting double spending, secret splitting is used. If a user duplicates the coin, then there will be two different transaction items in transaction list. What is the probability of catching a user who duplicates the coin using this technique?

To clarify:

https://www.cs.bham.ac.uk/~mdr/teaching/modules03/security/students/SS4/DigitalCash.pdf shows on slide 13 of 17 that the probability of catching a user is $1-(\frac{1}{2})^n$ where $n$ is the number of identity pairs used in the transaction item. But how do you calculate it?

Improve this question
$\endgroup$
2
  • $\begingroup$ "How do you calculate it" Calculate $1 - (1/2)^n$ ? Or do you mean how do you detect the double spending? $\endgroup$
    – cypherfox
    Commented Mar 10, 2018 at 15:19
  • $\begingroup$ If you're still interested in e-cash, here is something modern: ia.cr/2015/972 $\endgroup$
    – cypherfox
    Commented Mar 10, 2018 at 15:21

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.