Abstract
Blockchain technology has attracted a lot of research interest in the last few years. Originally, their consensus algorithm was Hashcash, which is an instance of the so-called Proof-of-Work. Nowadays, there are several competing consensus algorithms, not necessarily PoW. In this paper, we propose an alternative proof of work algorithm which is based on the solution of consecutive discrete logarithm problems over the point group of elliptic curves. At the same time, we sketch a blockchain scheme, whose consensus is reached via our algorithm. In the considered architecture, the curves are pseudorandomly determined by block creators, chosen to be cryptographically secure and changed every epoch. Given the current state of the chain and a prescribed set of transactions, the curve selection is fully rigid, therefore trust is needed neither in miners nor in the scheme proposers.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference54 articles.
1. A Survey on PoW-based Consensus
2. Proofs of Work and Bread Pudding Protocols(Extended Abstract)
3. Reliable Benchmarks Using Numerical Instability. SODA ’94: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithmshttps://dl.acm.org/citation.cfm?id=314476
4. Towards uncheatable benchmarks
5. Pricing via Processing or Combatting Junk Mail
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献