Indistinguishable proofs of work or knowledge

DOI10.1007/978-3-662-53890-6_30MaRDI QIDQ2953800zbMATH OpenOpenAlexFDO

Authors Foteini Baldimtsi, Aggelos Kiayias, Thomas Zacharias, Bingsheng Zhang

Publication date 6 January 2017

Published in Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL https://eprints.lancs.ac.uk/id/eprint/81372/1/main_OR.pdf

zbMATH Keywords

cryptocurrenciesproof of workconcurrent zero-knowledgecryptographic puzzledense one-way functions

Mathematics Subject Classification ID

Cryptography (94A60) Internet topics (68M11)

Recommendations

• Proofs of Work from worst-case assumptions
• Designing proof of human-work puzzles for cryptocurrency and beyond
• Proofs of space
• Simple proofs of sequential work
• Publicly verifiable proofs of sequential work

Cites work

• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 177052 (Why is no real title available?)
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• scientific article; zbMATH DE number 1759783 (Why is no real title available?)
• scientific article; zbMATH DE number 1759796 (Why is no real title available?)
• scientific article; zbMATH DE number 1775397 (Why is no real title available?)
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• scientific article; zbMATH DE number 1418304 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Computing discrete logarithms in an interval
• Correcting errors without leaking partial information
• Definitions and properties of zero-knowledge proof systems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Improved OR-composition of sigma-protocols
• Indistinguishable proofs of work or knowledge
• On continual leakage of discrete log representations
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Resettable zero-knowledge (extended abstract)
• Resource-based corruptions and the combinatorics of hidden diversity
• Security Notions and Generic Constructions for Client Puzzles
• Solving Discrete Logarithms from Partial Knowledge of the Key
• The Bitcoin Backbone Protocol: Analysis and Applications
• The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
• The knowledge complexity of interactive proof-systems
• Time-lock puzzles from randomized encodings
• Time-lock puzzles in the random oracle model
• Universal one-way hash functions via inaccessible entropy

Cited in

(14)

• Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
• Indistinguishable proofs of work or knowledge
• Designing proof of human-work puzzles for cryptocurrency and beyond
• Efficient NIZK arguments with straight-line simulation and extraction
• Non-interactive proofs of proof-of-work
• Proof-of-burn
• Space-deniable proofs
• PURED: a unified framework for resource-hard functions
• Short-lived zero-knowledge proofs and signatures
• PoW-based distributed cryptography with no trusted setup
• On Input Indistinguishable Proof Systems
• Universally composable SNARKs with transparent setup without programmable random oracle
• Proofs of Work from worst-case assumptions
• DSKE: digital signatures with key extraction

Describes a project that uses

Uses Software

• Elligator

This page was built for publication: Indistinguishable proofs of work or knowledge

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