Split: A Hash-Based Memory Optimization Method for Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK)
Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK) is a practical
zero-knowledge proof system for Rank-1 Constraint Satisfaction (R1CS), enabling privacy …
zero-knowledge proof system for Rank-1 Constraint Satisfaction (R1CS), enabling privacy …
{zkSaaS}:{Zero-Knowledge}{SNARKs} as a Service
A decade of active research has led to practical constructions of zero-knowledge succinct
non-interactive arguments of knowledge (zk-SNARKs) that are now being used in a wide …
non-interactive arguments of knowledge (zk-SNARKs) that are now being used in a wide …
Enabling zero knowledge proof by accelerating zk-SNARK kernels on GPU
N Ni, Y Zhu - Journal of Parallel and Distributed Computing, 2023 - Elsevier
As a recent cryptography protocol, Zero-Knowledge Succinct Non-Interactive Argument of
Knowledge (zk-SNARK) allows one party to prove that it possesses certain information …
Knowledge (zk-SNARK) allows one party to prove that it possesses certain information …
Prover-efficient commit-and-prove zero-knowledge SNARKs
H Lipmaa - International Journal of Applied Cryptography, 2017 - inderscienceonline.com
Succinct non-interactive zero-knowledge arguments of knowledge (Zk-SNARKs) are needed
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …
Polaris: transparent succinct zero-knowledge arguments for R1CS with efficient verifier
S Fu, G Gong - Proceedings on Privacy Enhancing Technologies, 2022 - petsymposium.org
We present a new zero-knowledge succinct argument of knowledge (zkSNARK) scheme for
Rank-1 Constraint Satisfaction (RICS), a widely deployed NPcomplete language that …
Rank-1 Constraint Satisfaction (RICS), a widely deployed NPcomplete language that …
Doubly-efficient zkSNARKs without trusted setup
We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …
zk-Bench: A Toolset for Comparative Evaluation and Performance Benchmarking of SNARKs
J Ernstberger, S Chaliasos, G Kadianakis… - Cryptology ePrint …, 2023 - eprint.iacr.org
Abstract Zero-Knowledge Proofs (ZKPs), especially Succinct Non-interactive ARguments of
Knowledge (SNARKs), have garnered significant attention in modern cryptographic …
Knowledge (SNARKs), have garnered significant attention in modern cryptographic …
Spartan: Efficient and general-purpose zkSNARKs without trusted setup
S Setty - Annual International Cryptology Conference, 2020 - Springer
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 …
arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …
Legosnark: Modular design and composition of succinct zero-knowledge proofs
We study the problem of building non-interactive proof systems modularly by linking small
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
Prover-efficient commit-and-prove zero-knowledge SNARKs
H Lipmaa - Progress in Cryptology–AFRICACRYPT 2016: 8th …, 2016 - Springer
Zk-SNARKs (succinct non-interactive zero-knowledge arguments of knowledge) are needed
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …