ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274)

scientific article; zbMATH DE number 7554926

Language	Label	Description	Also known as
English	ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines	scientific article; zbMATH DE number 7554926

Statements

instance of

scholarly article

0 references

title

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (English)

0 references

author

Diego F. Aranha

0 references

Emil Madsen Bennedsen

0 references

0 references

0 references

0 references

0 references

Public-Key Cryptography – PKC 2022

0 references

publication date

8 July 2022

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-97121-2_21

0 references

cites work

Non-interactive zero-knowledge proofs for composite statements

0 references

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines

0 references

Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics

0 references

Compressing proofs of \(k\)-out-of-\(n\) partial knowledge

0 references

A compressed \(\varSigma \)-protocol theory for lattices

0 references

Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup

0 references

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

0 references

Scalable Zero Knowledge via Cycles of Elliptic Curves

0 references

Succinct Non-interactive Arguments via Linear Interactive Proofs

0 references

\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments

0 references

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

0 references

Transparent SNARKs from DARK compilers

0 references

Q4364567

0 references

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials

0 references

Marlin: preprocessing zkSNARKs with universal and updatable SRS

0 references

Q4940695

0 references

Balancing privacy and accountability in blockchain identity management

0 references

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

0 references

The algebraic group model and its applications

0 references

Quadratic Span Programs and Succinct NIZKs without PCPs

0 references

The knowledge complexity of interactive proof-systems

0 references

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

0 references

On the Size of Pairing-Based Non-interactive Arguments

0 references

Updatable and universal common reference strings with applications to zk-SNARKs

0 references

Constant-Size Commitments to Polynomials and Their Applications

0 references

Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

0 references

Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

0 references

Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs

0 references

Q3210171

0 references

Spartan: efficient and general-purpose zkSNARKs without trusted setup

0 references

Identifiers

zbMATH Open document ID

1499.68112

0 references

DOI

10.1007/978-3-030-97121-2_21

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5087274