Marlin: Preprocessing zkSNARKs with universal and updatable SRS
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 …
reference string (SRS) is universal and updatable. This exploits a novel use of holography …
Fractal: Post-quantum and Transparent Recursive Proofs from Holography
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 …
interactive arguments of knowledge (SNARKs). Prior to this work, the only known …
Sok: Privacy-preserving computing in the blockchain era
Privacy is a huge concern for cryptocurrencies and blockchains as most of these systems log
everything in the clear. This has resulted in several academic and industrial initiatives to …
everything in the clear. This has resulted in several academic and industrial initiatives to …
Kryvos: Publicly tally-hiding verifiable e-voting
N Huber, R Küsters, T Krips, J Liedtke, J Müller… - Proceedings of the …, 2022 - dl.acm.org
Elections are an important corner stone of democratic processes. In addition to publishing
the final result (eg, the overall winner), elections typically publish the full tally consisting of all …
the final result (eg, the overall winner), elections typically publish the full tally consisting of all …
Snarkpack: Practical snark aggregation
Abstract Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short
and efficiently verifiable proofs that do not reveal anything more than the correctness of the …
and efficiently verifiable proofs that do not reveal anything more than the correctness of the …
Snarky ceremonies
Succinct non-interactive arguments of knowledge (SNARKs) have found numerous
applications in the blockchain setting and elsewhere. The most efficient SNARKs require a …
applications in the blockchain setting and elsewhere. The most efficient SNARKs require a …
On succinct non-interactive arguments in relativized worlds
Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with
strong efficiency properties. Applications of SNARKs often involve proving computations that …
strong efficiency properties. Applications of SNARKs often involve proving computations that …
Simulation extractability in Groth's zk-SNARK
Abstract A Simulation Extractable (SE) zk-SNARK enables a prover to prove that she knows
a witness for an instance in a way that the proof:(1) is succinct and can be verified very …
a witness for an instance in a way that the proof:(1) is succinct and can be verified very …
Tiramisu: Black-Box Simulation Extractable NIZKs in the Updatable CRS Model
Zk-SNARKs, as the most efficient NIZK arguments in terms of proof size and verification, are
ubiquitously deployed in practice. In applications like Hawk [S&P'16], Gyges [CCS'16] …
ubiquitously deployed in practice. In applications like Hawk [S&P'16], Gyges [CCS'16] …
Subversion-resistant simulation (knowledge) sound NIZKs
K Baghery - Cryptography and Coding: 17th IMA International …, 2019 - Springer
Abstract In ASIACRYPT 2016, Bellare, Fuchsbauer and Scafuro studied security of non-
interactive zero-knowledge (NIZK) arguments in the face of parameter subversion. They …
interactive zero-knowledge (NIZK) arguments in the face of parameter subversion. They …