Publicly verifiable zero knowledge from (collapsing) blockchains

DOI10.1007/978-3-030-75248-4_17zbMath1479.94252OpenAlexW3107817770MaRDI QIDQ2061968

Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_17

zbMATH Keywords

(collapsing) blockchainpublicly verifiable zero knowledge

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Updatable and universal common reference strings with applications to zk-SNARKs
• But why does it work? A rational protocol design treatment of bitcoin
• Bitcoin as a transaction ledger: a composable treatment
• Overcoming cryptographic impossibility results using blockchains
• The sleepy model of consensus
• How to extract useful randomness from unreliable sources
• Can a public blockchain keep a secret?
• Publicly verifiable proofs from blockchains
• Founding secure computation on blockchains
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
• How to Use Bitcoin to Design Fair Protocols
• The Bitcoin Backbone Protocol: Analysis and Applications
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Analysis of the Blockchain Protocol in Asynchronous Networks

This page was built for publication: Publicly verifiable zero knowledge from (collapsing) blockchains