Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge

A Gabizon, ZJ Williamson, O Ciobotaru - Cryptology ePrint Archive, 2019 - eprint.iacr.org
Abstract zk-SNARK constructions that utilize an updatable universal structured reference
string remove one of the main obstacles in deploying zk-SNARKs [GKMMM, Crypto 2018] …

Marlin: Preprocessing zkSNARKs with universal and updatable SRS

A Chiesa, Y Hu, M Maller, P Mishra, N Vesely… - Advances in Cryptology …, 2020 - Springer
We present a methodology to construct preprocessing zkSNARKs where the structured
reference string (SRS) is universal and updatable. This exploits a novel use of holography …

Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings

M Maller, S Bowe, M Kohlweiss… - Proceedings of the 2019 …, 2019 - dl.acm.org
Ever since their introduction, zero-knowledge proofs have become an important tool for
addressing privacy and scalability concerns in a variety of applications. In many systems …

BFOD: Blockchain-based privacy protection and security sharing scheme of flight operation data

X Li, H Zhao, W Deng - IEEE Internet of Things Journal, 2023 - ieeexplore.ieee.org
With the rapid growth of flight operation data, how to alleviate the contradiction between data
sharing and privacy protection of civil aviation corporations has become a challenging …

A survey on zero-knowledge authentication for internet of things

Z Chen, Y Jiang, X Song, L Chen - Electronics, 2023 - mdpi.com
The Internet of Things (IoT) is ubiquitous in our lives. However, the inherent vulnerability of
IoT smart devices can lead to the destruction of networks in untrustworthy environments …

State of the art of zero-knowledge proofs in blockchain

D Čapko, S Vukmirović, N Nedić - 2022 30th …, 2022 - ieeexplore.ieee.org
Blockchain technology promises a decentralized ecosystem for building apps with
decentralized ownership and high security level. One of the most adopted blockchain …

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 …

Orion: Zero knowledge proof with linear prover time

T **e, Y Zhang, D Song - Annual International Cryptology Conference, 2022 - Springer
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 …

Fractal: Post-quantum and Transparent Recursive Proofs from Holography

A Chiesa, D Ojha, N Spooner - … on the Theory and Applications of …, 2020 - Springer
We present a new methodology to efficiently realize recursive composition of succinct non-
interactive arguments of knowledge (SNARKs). Prior to this work, the only known …

Transparent polynomial delegation and its applications to zero knowledge proof

J Zhang, T **e, Y Zhang, D Song - 2020 IEEE Symposium on …, 2020 - ieeexplore.ieee.org
We present a new succinct zero knowledge argument scheme for layered arithmetic circuits
without trusted setup. The prover time is O (C+ nlogn) and the proof size is O (D logC+ log 2 …