Transparent SNARKs from DARK compilers
type: Item
instance of: scholarly article
title: Transparent SNARKs from DARK compilers
DOI: 10.1007/978-3-030-45721-1_24
author: Benedikt Bünz
author: Ben Fisch
author: Alan Szepieniec
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436935
MaRDI profile type: Publication
full work available at URL: 978-3-030-45721-1 24
OpenAlex ID: W2990120385
cites work: Fast Reed-Solomon Interactive Oracle Proofs of Proximity
cites work: Scalable zero knowledge with no trusted setup
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: Interactive Oracle Proofs
cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs
cites work: Verifiable delay functions
cites work: Zero-knowledge proofs on secret-shared data via fully linear PCPs
cites work: Batching techniques for accumulators with applications to IOPs and stateless blockchains
cites work: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
cites work: On the computation of quadratic 2-class groups
cites work: A survey on IQ cryptography
cites work: Fiat-Shamir: from practice to theory
cites work: Marlin: preprocessing zkSNARKs with universal and updatable SRS
cites work: \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
cites work: Removing the Strong RSA Assumption from Arguments over the Integers
cites work: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
cites work: Q4737249
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Q4364540
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: On interactive proofs with a laconic prover
cites work: Q3549691
cites work: The knowledge complexity of interactive proof-systems
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
cites work: Constant-Size Commitments to Polynomials and Their Applications
cites work: Q4783725
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Simple verifiable delay functions
cites work: Constant-round interactive proofs for delegating computation
cites work: Efficient verifiable delay functions
cites work: Libra: succinct zero-knowledge proofs with optimal prover computation
Recommended article: Succinct spooky free compilers are not black box sound
Recommended article: The essence of compiling with traces
Recommended article: On the (im)possibility of obfuscating programs
Recommended article: Securing a compiler transformation
description: scientific article; zbMATH DE number 7436935