Subadditive threshold in proof of stake system

05/25/2018
by   Chunlei Liu, et al.
0

Two subadditive threshold are proposed for proof stake systems: one is radical threshold, the other is logarithmic threshold. Securities of both systems are analysed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2018

Proof of subadditive stake in block-chain cash system

The proof of radical stake system as well as the proof of logarithmic st...
research
08/17/2020

Parallel repetition with a threshold in quantum interactive proofs

In this note, we show that O(log (1/ϵ)) rounds of parallel repetition wi...
research
05/25/2018

Subadditive stake systems

Stake systems which issue stakes as well as coins are proposed. Two suba...
research
04/11/2018

Threshold and Revocation Encryptions via Threshold Trapdoor Function

We introduce a cryptographic primitive named threshold trapdoor function...
research
12/27/2020

Foresight AND Hindsight

To model is to represent. The threshold of decidability defines two epis...
research
12/09/2008

Polyomino-Based Digital Halftoning

In this work, we present a new method for generating a threshold structu...
research
10/19/2016

Chinese Restaurant Process for cognate clustering: A threshold free approach

In this paper, we introduce a threshold free approach, motivated from Ch...

Please sign up or login with your details

Forgot password? Click here to reset