Transparent SNARKs from DARK compilers (Q2055634)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Transparent SNARKs from DARK compilers	scientific article

Statements

scholarly article

0 references

Transparent SNARKs from DARK compilers (English)

0 references

0 references

0 references

Alan Szepieniec

0 references

publication date

1 December 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-45721-1_24

0 references

Fast Reed-Solomon Interactive Oracle Proofs of Proximity

0 references

Scalable zero knowledge with no trusted setup

0 references

SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

0 references

Interactive Oracle Proofs

0 references

Succinct Non-interactive Arguments via Linear Interactive Proofs

0 references

Verifiable delay functions

0 references

Zero-knowledge proofs on secret-shared data via fully linear PCPs

0 references

Batching techniques for accumulators with applications to IOPs and stateless blockchains

0 references

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

0 references

On the computation of quadratic 2-class groups

0 references

0 references

Transparent SNARKs from DARK compilers

0 references

Fiat-Shamir: from practice to theory

0 references

Marlin: preprocessing zkSNARKs with universal and updatable SRS

0 references

\textsc{Fractal}: post-quantum and transparent recursive proofs from holography

0 references

Removing the Strong RSA Assumption from Arguments over the Integers

0 references

A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order

0 references

0 references

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

0 references

0 references

Quadratic Span Programs and Succinct NIZKs without PCPs

0 references

On interactive proofs with a laconic prover

0 references

0 references

The knowledge complexity of interactive proof-systems

0 references

On the Size of Pairing-Based Non-interactive Arguments

0 references

Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle

0 references

Constant-Size Commitments to Polynomials and Their Applications

0 references

0 references

Advances in Cryptology - ASIACRYPT 2003

0 references

Simple verifiable delay functions

0 references

Constant-round interactive proofs for delegating computation

0 references

Efficient verifiable delay functions

0 references

Libra: succinct zero-knowledge proofs with optimal prover computation

0 references

Identifiers

10.1007/978-3-030-45721-1_24

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2055634

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2055634&oldid=36744444"