Blockchain, an emerging paradigm of secure and shareable computing, is a systematic
integration of 1) chain structure for data verification and storage, 2) distributed consensus …

The increasing volume of personal and sensitive data being harvested by data controllers
makes it increasingly necessary to use the cloud not just to store the data, but also to …

This paper introduces Spartan, a new family of zero-knowledge succinct non-interactive
arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …

A zero-knowledge (ZK) proof guarantees that the result of a computation is correct while
kee** part of the computation details private. Some ZK proofs are tiny and can be verified …

Thanks to the widespread deployment of TLS, users can access private data over channels
with end-to-end confidentiality and integrity. What they cannot do, however, is prove to third …

Zero-knowledge proofs (ZKPs) have evolved from being a theoretical concept providing
privacy and verifiability to having practical, real-world implementations, with SNARKs …

This works introduces BaseFold, a new field-agnostic Polynomial Commitment Scheme
(PCS) for multilinear polynomials that has O (log 2 (n)) verifier costs and O (n log n) prover …

Recently there has been much academic and industrial interest in practical implementations
of zero knowledge proofs. These techniques allow a party to prove to another party that a …

A zk-SNARK is a powerful cryptographic primitive that provides a succinct and efficiently
checkable argument that the prover has a witness to a public NP statement, without …

Proof systems allow one party to prove to another party that a certain statement is true. Most
existing practical proof systems require that the statement will be represented in terms of …