Publicly verifiable zero knowledge from (collapsing) blockchains

DOI10.1007/978-3-030-75248-4_17MaRDI QIDQ2061968zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Publicly verifiable proofs from blockchains
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• On the Composition of Public-Coin Zero-Knowledge Protocols
• On the composition of public-coin zero-knowledge protocols
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
• Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers?

Cites work

• Analysis of the Blockchain Protocol in Asynchronous Networks
• Bitcoin as a transaction ledger: a composable treatment
• But why does it work? A rational protocol design treatment of bitcoin
• Can a public blockchain keep a secret?
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Founding secure computation on blockchains
• How to extract useful randomness from unreliable sources
• How to use bitcoin to design fair protocols
• scientific article; zbMATH DE number 1088907 (Why is no real title available?)
• Overcoming cryptographic impossibility results using blockchains
• Publicly verifiable proofs from blockchains
• Quadratic span programs and succinct NIZKs without PCPs
• Quasi-linear size zero knowledge from linear-algebraic PCPs
• The Bitcoin Backbone Protocol: Analysis and Applications
• The sleepy model of consensus
• Updatable and universal common reference strings with applications to zk-SNARKs

Cited in

(8)

• Overcoming cryptographic impossibility results using blockchains
• Can a public blockchain keep a secret?
• Publicly verifiable proofs from blockchains
• Founding secure computation on blockchains
• Towards self-stabilizing blockchain, reconstructing totally erased blockchain
• Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
• Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers?
• Untangling the security of Kilian's protocol: upper and lower bounds

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

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