A new ECDLP-based PoW model

11/26/2019
by   Alessio Meneghetti, et al.
0

We lay the foundations for a blockchain scheme, whose consensus is reached via a proof of work algorithm based on the solution of consecutive discrete logarithm problems over the point group of elliptic curves. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2018

A Secure Multiple Elliptic Curves Digital Signature Algorithm for Blockchain

Most cryptocurrency systems or systems based on blockchain technology ar...
research
10/26/2021

Efficient and Secure TSA for the Tangle

The Tangle is the data structure used to store transactions in the IOTA ...
research
06/30/2019

Genus 2 Supersingular Isogeny Oblivious Transfer

We present an oblivious transfer scheme that extends the proposal made b...
research
09/02/2023

Manifesting Unobtainable Secrets: Threshold Elliptic Curve Key Generation using Nested Shamir Secret Sharing

We present a mechanism to manifest unobtainable secrets using a nested S...
research
02/21/2023

An Elementary Formal Proof of the Group Law on Weierstrass Elliptic Curves in any Characteristic

Elliptic curves are fundamental objects in number theory and algebraic g...
research
11/29/2017

A Cooperative Proof of Work Scheme for Distributed Consensus Protocols

We propose a refinement to the well known, and widely used, proof-of-wor...
research
09/15/2021

Reinshard: An optimally sharded dual-blockchain for concurrency resolution

Decentralized control, low-complexity, flexible and efficient communicat...

Please sign up or login with your details

Forgot password? Click here to reset