pith. sign in

Let a : N → N ∪ {∗} and a : N → N be any functions such that a(κ) and b(κ) are computable in time poly(κ)

Veri takes as input (pk,x,y,π ), it verifies whether y = Fsk(x) by using the proof π, key pk

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.DC 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

Fair Byzantine Agreements for Blockchains

cs.DC · 2019-07-08 · unverdicted · novelty 6.0

Introduces fair validity for Byzantine agreement and a synchronous protocol achieving it with responsiveness and partition resilience under 1/3 corruptions.

citing papers explorer

Showing 1 of 1 citing paper.

  • Fair Byzantine Agreements for Blockchains cs.DC · 2019-07-08 · unverdicted · none · ref 13

    Introduces fair validity for Byzantine agreement and a synchronous protocol achieving it with responsiveness and partition resilience under 1/3 corruptions.