Decreasing security threshold against double spend attack in networks with slow synchronization

Kovalchuk, Lyudmila; Kaidalov, Dmytro; Nastenko, Andrii; Rodinko, Mariia; Shevtsov, Oleksiy; Oliynykov, Roman

doi:10.1016/j.comcom.2020.01.079

Cited by 11 publications

(17 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work [9] generalized the results obtained in [8]. In this work, for the first time (in model with continuous time, without simplified assumptions about discrete timeslots), the author obtained and strictly proved the expression that gives the value of double-spend attack probability in dependence on network parameters, including network synchronization time.…”

Section: Related Workmentioning

confidence: 56%

“…However, in PoW, the synchronization time plays a very important role. As shown in [9,27], the security threshold (the minimal adversary ratio that can implement the attack with probability 1 despite the number of confirmation blocks) decreases when the synchronization time increases, and in the case of a large synchronization time, even an adversary with a minority hashrate can implement the attack with probability 1).…”

Section: Resultsmentioning

confidence: 99%

“…Note that all these works [3,4,[6][7][8][9] investigate proof-of-work consensus protocol, but there are still no analogical results for proof-of-stake [10][11][12]. However, consensus protocol proof-of-stake is much more preferable than proof-of-work from a lot of points of view.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Blockchain Technologies: Probability of Double-Spend Attack on a Proof-of-Stake Consensus

Karpinski

Kovalchuk

Кочан

et al. 2021

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 56%

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Blockchain Technologies: Probability of Double-Spend Attack on a Proof-of-Stake Consensus

Karpinski

Kovalchuk

Кочан

et al. 2021

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

“…We also emphasize that it is essential to consider block synchronization time or time delay for block sharing in security analysis. The importance of this parameter was shown in many works, mainly [12][13][14][15]. Notably, it was shown that if the adversary is well synchronized and honest miners are not, the security threshold (the minimal ratio of adversary, which can attack the blockchain with probability 1 despite the number of confirmation blocks) decreases dramatically.…”

Section: Introductionmentioning

confidence: 99%

Achieving Security in Proof-of-Proof Protocol with Non-Zero Synchronization Time

Kovalchuk

Kostanda²,

Marukhnenko

et al. 2022

Mathematics

Self Cite

View full text Add to dashboard Cite

Among the most significant problems that almost any blockchain faces are the problems of increasing its throughput (i.e., the number of transactions per unit of time) and the problem of a long waiting time before block confirmation. Thus, for example, in the most common BTC blockchain, according to various estimates, throughput is from 3 to 7 tps (transactions per second), and the average block confirmation time (block is considered confirmed if it has at least 6 blocks over it) is 1 h. At the same time, it is impossible to solve these problems directly by increasing the block size or increasing block generation intensity because this leads to essentially a decrease in the security of the blockchain in the first turn against double spend and splitting attacks. Such problems lead to the inconvenience of the practical use of cryptocurrencies to pay for goods and services. Proposed a few years ago, the PoP consensus protocol potentially helps to solve the problem of increasing blockchain throughput, although it was originally intended to ensure the stability of “young” blockchains, with “small” PoW, through the use of a secure blockchain, such as BTC. A blockchain that has provable security is called the security-provided blockchain (SPB), and one that uses SPB to achieve its security is called the security-inherited blockchain. In this paper, we give explicit formulas which describe how the number of confirmation blocks in the security-inherited blockchain, which is sufficient to achieve a given security level of this blockchain to a double spend attack, depends on the parameters of both blockchains. It is essential that we use a realistic model to obtain the results, taking into account the synchronization times of both blockchains. Such a model is much closer to the real situation, but at the same time, it leads to significant analytical difficulties in obtaining results. The obtained formulas are convenient for numerical calculations, the numerous examples of which are also given in this work.

show abstract

“…Generally speaking, SCs may use an arbitrary consensus protocol with proved securitytaking into account conditions in which its security was proved [7][8][9][10]. In what follows we will consider only SCs based on Latus Consensus Protocol [11], which isa hybrid PoS based on Ouroboros Praos [12], with additional binding to a PoW mainchain (MC).…”

Section: Introductionmentioning

confidence: 99%

Probability Models of Distributed Proof Generation for zk-SNARK-Based Blockchains

Bespalov

Garoffolo²,

Kovalchuk³

et al. 2021

Mathematics

Self Cite

View full text Add to dashboard Cite

The paper is devoted to the investigation of the distributed proof generation process, which makes use of recursive zk-SNARKs. Such distributed proof generation, where recursive zk-SNARK-proofs are organized in perfect Mercle trees, was for the first time proposed in Latus consensus protocol for zk-SNARKs-based sidechains. We consider two models of a such proof generation process: the simplified one, where all proofs are independent (like one level of tree), and its natural generation, where proofs are organized in partially ordered set (poset), according to tree structure. Using discrete Markov chains for modeling of corresponding proof generation process, we obtained the recurrent formulas for the expectation and variance of the number of steps needed to generate a certain number of independent proofs by a given number of provers. We asymptotically represent the expectation as a function of the one variable n/m, where n is the number of provers m is the number of proofs (leaves of tree). Using results obtained, we give numerical recommendation about the number of transactions, which should be included in the current block, idepending on the network parameters, such as time slot duration, number of provers, time needed for proof generation, etc.

show abstract

Decreasing security threshold against double spend attack in networks with slow synchronization

Cited by 11 publications

References 3 publications

Blockchain Technologies: Probability of Double-Spend Attack on a Proof-of-Stake Consensus

Blockchain Technologies: Probability of Double-Spend Attack on a Proof-of-Stake Consensus

Achieving Security in Proof-of-Proof Protocol with Non-Zero Synchronization Time

Probability Models of Distributed Proof Generation for zk-SNARK-Based Blockchains

Contact Info

Product

Resources

About