ZkpComRef: Applications

Please start by reading the editorial disclaimer to ensure proper expectations about the process.

Collaboration Instructions

This page was prepared for a breakout session during the ZKProof 4th workshop in order to receive concurrent/collaborative suggestions of content that may be useful for the "ZKProof Community Reference" (ZkpComRef).

Goal: this document will focus on expanding Chapter 4 (Applications) of the ZkpComRef by adding new descriptions of applications of zero-knowledge proofs or by editing the existing ones.

Content

In this group we are asking for contributions between 1 and 2 pages long to be added to the Applications chapter of the document. We believe that there are many interesting applications that we would like to see covered, so feel free to think about the one that you like most or know about. Here are some examples that you can work on or get inspired by!

Examples of new applications:

• ZK for Blockchain scalability (RollUp, Compression): how can blockchains be made scalable (at layer 1 or layer 2) by using the power of ZKPs?
• Neural Networks for private inference: more and more we see proprietary ML models, how can the results of the inference be trusted by using ZKP in a way that does not reveal the model?
• Software verification of vulnerabilities: what entails proving that a software program has or does not have any vulnerability of some type?
• Building actively-secure multiparty computation systems: how can we add ZKP to an MPC system to make it actively secure?

Guidelines

What to include in the contribution:
This list is a kind of check-list that we would like you to cover in the contribution, mainly to ensure there is some consistency across applications. Feel free to use this as a template if you wish (see the first template contribution below).

1. Describe at a high level the application setting and clearly state the privacy goal (if applicable)
   • what is the context / setup?
   • What is the problem and how are ZKPs used to solve for it?
   • what is being proven and verified?
   • who are the provers and verifiers?
2. Describe what are some of the key challenges in building such an application
   • what are the main primitives needed to instantiate the protocol / application flow?
   • How do these come together (see below for the predicate)?
   • are there any specific security concerns to keep an eye on?
3. Concretely exemplify the application with a predicate (see sections 1.1–1.3 for definitions):
   • give an example statement
   • its witness (private inputs)
   • its instance
4. Describe some of the efficiency requirements and trade-offs that may exist in the application that can be used to chose a proving system
   • are there any requirements on prover / verifier running time?
   • does the proof size need to be succinct?
   • how can this application be made "practical"?
5. Include a figure or diagram for visual aid (or refer to the diagrams group to it)
   • how does the predicate look like?
   • how can you show the different parties and the application flow?
   • how do the basic primitives come together?

Add your contribution:

Contribution #0: TEMPLATE VERSION

Suggested by : Daniel Benarroch (daniel@qed-it.com)Example

Description / Overview

describe the application

Predicate and Statement

describe the statement

Efficiency Requirements

describe trade-offs

Contribution #1: