Mining for privacy: how to bootstrap a snarky blockchain

DOI10.1007/978-3-662-64322-8_24zbMath1491.94055OpenAlexW3209083355MaRDI QIDQ2145411

Aggelos Kiayias, Thomas Kerber, Markulf Kohlweiss

Publication date: 17 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_24

zbMATH Keywords

non-interactive zero-knowledge proofsSNARK systems

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Composition with knowledge assumptions ⋮ Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol

Uses Software

• Pinocchio
• Marlin

Cites Work

• Updatable and universal common reference strings with applications to zk-SNARKs
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• The Bitcoin backbone protocol with chains of variable difficulty
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Transparent SNARKs from DARK compilers
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• The Bitcoin Backbone Protocol: Analysis and Applications
• Analysis of the Blockchain Protocol in Asynchronous Networks
• On the Size of Pairing-Based Non-interactive Arguments

This page was built for publication: Mining for privacy: how to bootstrap a snarky blockchain