k-root-n: An efficient O(√n) algorithm for avoiding short term double spending in Distributed Ledger Technologies such as Blockchain

Zvi Schreiber. k-root-n: An efficient O(√n) algorithm for avoiding short term double spending in Distributed Ledger Technologies such as Blockchain. IACR Cryptology ePrint Archive, 2019:827, 2019. [doi]

Authors

Zvi Schreiber

This author has not been identified. Look up 'Zvi Schreiber' in Google