Proof of necessary work: succinct state verification with fairness guarantees

DOI10.1007/978-3-031-47751-5_2zbMATH Open1543.94735MaRDI QIDQ6573988

Assimakis Kattis, Joseph Bonneau

Publication date: 17 July 2024

zbMATH Keywords

zero-knowledge proofsconsensus algorithmsproof-of-work

Mathematics Subject Classification ID

Cryptography (94A60) Macroeconomic theory (monetary models, models of taxation) (91B64)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Scalable zero knowledge via cycles of elliptic curves
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Zether: towards privacy in a smart contract world
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Constant-Size Commitments to Polynomials and Their Applications
• On the Evaluation of Powers and Monomials
• A Survey of Fast Exponentiation Methods
• Remarks on number theory III. On addition chains
• On the Size of Pairing-Based Non-interactive Arguments
• Cryptography and Coding
• To label, or not to label (in generic groups)

This page was built for publication: Proof of necessary work: succinct state verification with fairness guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573988)