Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains

Garoffolo, Alberto; Kaidalov, Dmytro; Oliynykov, Roman

doi:10.48550/arxiv.2002.01847

Cited by 2 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…zkSNARKs have been extensively explored in the literature [4], [7]- [22]. Also zkSNARKs have been used in many applications, for example in authentication systems [23], construction of various types of cryptographic protocols [24], privacy preserving crypto-currencies [25], smart contracts [26]- [28], miscellaneous applications in Blockchain technology [29]- [32], verifiable outsourcing of the computation [33], [34], and many other areas [35]. In addition, various toolboxes have been created to implement zkSNARKs, e.g., [36]- [39].…”

Section: Introductionmentioning

confidence: 99%

Multi-Party Proof Generation in QAP-based zk-SNARKs

Rahimi¹,

Maddah-Ali²

2021

Preprint

View full text Add to dashboard Cite

Zero-knowledge succinct non-interactive argument of knowledge (zkSNARK) allows a party, known as the prover, to convince another party, known as the verifier, that he knows a private value v, without revealing it, such that F (u, v) = y for some function F and public values u and y. There are various versions of zk-SNARK, among them, Quadratic Arithmetic Program (QAP)-based zk-SNARK has been widely used in practice, specially in Blockchain technology. This is attributed to two desirable features; its fixed-size proof and the very light computation load of the verifier. However, the computation load of the prover in QAP-based zkSNARKs, is very heavy, even-though it is designed to be very efficient. This load can be beyond the prover's computation power to handle, and has to be offloaded to some external servers. In the existing offloading solutions, either (i) the load of computation, offloaded to each sever, is a fraction of the prover's primary computation (e.g., DZIK), however the servers need to be trusted, (ii) the servers are not required to be trusted, but the computation complexity imposed to each one is the same as the prover's primary computation (e.g., Trinocchio). In this paper, we present a scheme, which has the benefits of both solutions. In particular, we propose a secure multi-party proof generation algorithm where the prover can delegate its task to N servers, where (i) even if a group of T ∈ N servers, T ≤ N , collude, they cannot gain any information about the secret value v, (ii) the computation complexity of each server is less than 1/(N − T ) of the prover's primary computation. The design is such that we don't lose the efficiency of the prover's algorithm in the process of delegating the tasks to external servers.

show abstract

Section: Introductionmentioning

confidence: 99%

Multi-Party Proof Generation in QAP-based zk-SNARKs

Rahimi¹,

Maddah-Ali²

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In the dynamic setting, skipchains [80,139,116], i.e., double-linked skiplists which enable sub-linear crawling of identity chains, can reduce costs from linear to logarithmic (to the number of configurations). Recently, a number for light client protocols that leverage the compression properties of zero-knowledge proof systems have been proposed [83,81,165]. Verification of State Evolution.…”

mentioning

confidence: 99%

SoK: Communication Across Distributed Ledgers

Zamyatin

Al-Bassam

Zindros

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Since the inception of Bitcoin, a plethora of distributed ledgers differing in design and purpose has been created. While by design, blockchains provide no means to securely communicate with external systems, numerous attempts towards trustless cross-chain communication have been proposed over the years. Today, cross-chain communication (CCC) plays a fundamental role in cryptocurrency exchanges, scalability efforts via sharding, extension of existing systems through sidechains, and bootstrapping of new blockchains. Unfortunately, existing proposals are designed ad-hoc for specific use-cases, making it hard to gain confidence in their correctness and composability. We provide the first systematic exposition of cross-chain communication protocols. We formalize the underlying research problem and show that CCC is impossible without a trusted third party, contrary to common beliefs in the blockchain community. With this result in mind, we develop a framework to design new and evaluate existing CCC protocols, focusing on the inherent trust assumptions thereof, and derive a classification covering the field of cross-chain communication to date. We conclude by discussing open challenges for CCC research and the implications of interoperability on the security and privacy of blockchains.

show abstract

Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains

Cited by 2 publications

References 8 publications

Multi-Party Proof Generation in QAP-based zk-SNARKs

Multi-Party Proof Generation in QAP-based zk-SNARKs

SoK: Communication Across Distributed Ledgers

Contact Info

Product

Resources

About