Publicly verifiable proofs from blockchains

DOI10.1007/978-3-030-17253-4_13MaRDI QIDQ2289215zbMATH OpenOpenAlexFDO

Authors Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti

Publication date 28 January 2020

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

zbMATH Keywords

\(\varSigma\)-protocolspublicly verifiable witness-indistinguishable proof systems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Publicly verifiable zero knowledge from (collapsing) blockchains
• Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• (Public) verifiability for composable protocols without adaptivity or zero-knowledge
• Publicly verifiable proofs of sequential work

Cited in

(8)

• Certifying Findel derivatives for blockchain
• How to extract useful randomness from unreliable sources
• Can a public blockchain keep a secret?
• Publicly verifiable zero knowledge from (collapsing) blockchains
• Shielded computations in smart contracts overcoming forks
• Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
• (Public) verifiability for composable protocols without adaptivity or zero-knowledge
• Untangling the security of Kilian's protocol: upper and lower bounds

This page was built for publication: Publicly verifiable proofs from blockchains

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