Skip to main content
Conference Proceedings

Distributed double spending prevention (transcript of discussion)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5964 LNCS 166-170
DOI: 10.1007/978-3-642-17773-6_20
1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The spending protocol that I described so far, will guarantee that double spending is prevented, as long as we can guarantee that these clerk sets are constructed in such a way that there's always an honest node in the intersection of two clerk sets. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Hoepman, J. H. (2010). Distributed double spending prevention (transcript of discussion). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5964 LNCS, pp. 166–170). https://doi.org/10.1007/978-3-642-17773-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free