We construct a constant round resettably-sound zero knowledge argument of knowledge
based on black-box use of any one-way function. Resettable-soundness was introduced by …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

Zero knowledge proofs are one of the most influential concepts in theoretical computer
science. In the seminal definition due to Goldwasser, Micali and Rackoff dating back to the …

The MinRank problem is an NP-complete problem that is prevalent in multivariate
cryptography and its goal is to find a non-zero linear combination of given a series of …

Zero-Knowledge (ZK) proofs (ZKP) are foundational in cryptography. Most recent ZK
research focuses on non-interactive proofs (NIZK) of small statements, useful in blockchain …

A non-interactive zero-knowledge (NIZK) protocol enables a prover to convince a verifier of
the truth of a statement without leaking any other information by sending a single message …

While the intuition underlying a zero knowledge proof system [GMR85] is that no
“knowledge” is leaked by the prover to the verifier, researchers are just beginning to analyze …

The rapid development of blockchain, privacy computation, artificial intelligence and other
technologies has greatly promoted the research of zero-knowledge proofs, especially the …

General-purpose zero-knowledge proofs for all NP NP languages greatly simplify secure
protocol design. However, they inherently require the code of the underlying relation. If the …

In this work we study the efficiency of Zero-Knowledge (ZK) arguments of knowledge,
particularly exploring Multi-Verifier ZK (MVZK) protocols as a midway point between Non …