Overcoming cryptographic impossibility results using blockchains

DOI10.1007/978-3-319-70500-2_18MaRDI QIDQ1690207zbMATH OpenOpenAlexFDO

Authors Rishab Goyal, Vipul Goyal

Publication date 19 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-70500-2_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Blockchains from non-idealized hash functions
• Founding secure computation on blockchains
• On the impossibility of highly-efficient blockcipher-based hash functions
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• Practical provably secure flooding for blockchains
• Cryptographic Primitives in Blockchain Technology
• Publicly verifiable zero knowledge from (collapsing) blockchains

Cited in

(14)

• Certifying Findel derivatives for blockchain
• Fair hierarchical secret sharing scheme based on smart contract
• How to extract useful randomness from unreliable sources
• Abuse resistant law enforcement access systems
• Publicly verifiable zero knowledge from (collapsing) blockchains
• Shielded computations in smart contracts overcoming forks
• Unclonable polymers and their cryptographic applications
• Towards self-stabilizing blockchain, reconstructing totally erased blockchain
• Blockchains enable non-interactive MPC
• Storing and retrieving secrets on a blockchain
• YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
• Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
• Forward-secure public key encryption without key update from proof-of-stake blockchain
• One-time programs from commodity hardware

This page was built for publication: Overcoming cryptographic impossibility results using blockchains

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