ZoKrates - Scalable Privacy-Preserving Off-Chain Computations

@article{Eberhardt2018ZoKratesS,
  title={ZoKrates - Scalable Privacy-Preserving Off-Chain Computations},
  author={Jacob Eberhardt and Stefan Tai},
  journal={2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)},
  year={2018},
  pages={1084-1091}
}
  • Jacob Eberhardt, S. Tai
  • Published 1 July 2018
  • Computer Science
  • 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)
Scalability and privacy are two challenges for today's blockchain systems. [] Key Method Due to the verifiable computation scheme's zero-knowledge property, private information used in the off-chain computation does not have to become public to verify correctness. (ii)We introduce ZoKrates, a toolbox to specify, integrate and deploy such off-chain computations. It consists of a domain-specific language, a compiler, and generators for proofs and verification Smart Contracts. ZoKrates hides significant…

Figures from this paper

Non-Disclosing Credential On-chaining for Blockchain-based Decentralized Applications

TLDR
This paper proposes a novel credential on-chaining system that ensures blockchain-based transparency while preserving pseudonymity, and presents a general model compliant to the W3C verifiable credential recommendation and demonstrates how it can be applied to solve existing problems that require computational identity-related attribute veri fication.

Tuxedo: Maximizing Smart Contract Computation in PoW Blockchains

TLDR
Tuxedo is presented, the first on-chain protocol to theoretically scale τ/I ≈1 in PoW blockchains and performs security analysis of Tuxedo considering all possible adversarial strategies in a synchronous network with maximum end-to-end delay Δ and achieves security equivalent to known results for longest chain PoW Nakamoto consensus.

Non-Interactive Zero-Knowledge for Blockchain: A Survey

TLDR
The state-of-the-art non-interactive zero-knowledge argument schemes and their applications in confidential transactions and private smart contracts on blockchain are surveyed to serve as a reference for blockchain application developers in finding the most suitable scheme for a particular use case.

Better Late than Never; Scaling Computations in Blockchain by Delaying Transactions

TLDR
Tuxedo is presented, the first on-chain protocol to theoretically scale $\tau/\mathbb{I} \approx 1$ in PoW blockchains and performs security analysis of Tuxedo considering all possible adversarial strategies in a synchronous network with end-to-end delay $\Delta$ and achieves security equivalent to known results for longest chain PoW Nakamoto consensus.

Better Late than Never; Scaling Computation in Blockchains by Delaying Execution

TLDR
Tuxedo is presented, the first on-chain protocol to theoretically scale $\tau/\mathbb{I} \approx 1$ in PoW blockchains and performs security analysis of Tuxedo considering all possible adversarial strategies in a synchronous network with end-to-end delay $\Delta$ and achieves security equivalent to known results for longest chain PoW Nakamoto consensus.

Blockchain-based Result Verification for Computation Offloading

TLDR
Using this approach, it is possible to establish trust between a service consumer and arbitrary service providers via the blockchain, and this approach is evaluated using a very well-known example task, i.e., the Traveling Salesman Problem.

zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays

TLDR
This work proposes the utilization of off-chain computations through zkSNARKs to provide a cryptographically secure and highly scalable sidechain mechanism that requires constant verification costs and releases the target ledger from processing and storing every single block header of the source blockchain.

Analysis and Application of Verifiable Computation Techniques in Blockchain Systems for the Energy Sector

TLDR
An overview of verifiable computation technologies, including trusted oracles, zkSNARKs, and multi-party computation, and their application in blockchain environments with a focus on energy-related applications are presented.

Analysis and Application of Verifiable Computation Techniques in Blockchain Systems for the Energy Sector

TLDR
An overview of verifiable computation technologies, including trusted oracles, zkSNARKs, and multi-party computation, and their application in blockchain environments with a focus on energy-related applications are presented.

Towards Private On-Chain Algorithmic Trading

TLDR
This paper presents ChainBot, an approach for creating algorithmic trading bots with the help of blockchain technology, and shows how to partition the algorithmic computation into on and off-chain components in a way that provides a measure of end-to-end integrity, while preserving the algorithmmic “secret sauce”.
...

References

SHOWING 1-10 OF 24 REFERENCES

Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts

TLDR
Hawk is a decentralized smart contract system that does not store financial transactions in the clear on the blockchain, thus retaining transactional privacy from the public's view, and is the first to formalize the blockchain model of cryptography.

On or Off the Blockchain? Insights on Off-Chaining Computation and Data

The potential for blockchains to fundamentally transform how organizations produce and capture value is huge and very real. Practical applications dealing with nearly any type of digital asset

A scalable verification solution for blockchains

TLDR
A new system consists of a financial incentive layer atop a dispute resolution layer where the latter takes form of a versatile "verification game" that brings scalable computation to Ethereum.

A NEXT GENERATION SMART CONTRACT & DECENTRALIZED APPLICATION PLATFORM

When Satoshi Nakamoto first set the Bitcoin blockchain into motion in January 2009, he was simultaneously introducing two radical and untested concepts. The first is the "bitcoin", a decentralized

Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model

TLDR
A more scalable multi-party computation (MPC) protocol, secure in the random beacon model, which omits the precommitment phase, and it is shown that security holds even if an adversary has limited inence on the beacon.

Zerocash: Decentralized Anonymous Payments from Bitcoin

TLDR
This paper formulate and construct decentralized anonymous payment schemes (DAP schemes) and builds Zero cash, a practical instantiation of the DAP scheme construction that is orders of magnitude more efficient than the less-anonymous Zero coin and competitive with plain Bit coin.

Pinocchio: Nearly Practical Verifiable Computation

TLDR
This work introduces Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions, and is the first general-purpose system to demonstrate verification cheaper than native execution (for some apps).

Bulletproofs : Efficient Range Proofs for Confidential Transactions

TLDR
Bulletproofs is a new non-interactive zero-knowledge proof protocol with very short proofs and without a trusted setup, which greatly improves on the linear range proofs currently used to implement Confidential Transactions in Bitcoin and other cryptocurrencies.

ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER

TLDR
The blockchain paradigm when coupled with cryptographically-secured transactions has demonstrated its utility through a number of projects, with Bitcoin being one of the most notable ones, and Ethereum implements this paradigm in a generalised manner.

Scalable, transparent, and post-quantum secure computational integrity

TLDR
The first realization of a transparent ZK system (ZK-STARK) in which verification scales exponentially faster than database size is reported, and this exponential speedup in verification is observed concretely for meaningful and sequential computations, described next.