Proofs of Work from worst-case assumptions
From MaRDI portal
Publication:1673424
DOI10.1007/978-3-319-96884-1_26zbMath1444.94044OpenAlexW2884999233MaRDI QIDQ1673424
Prashant Nalini Vasudevan, Marshall Ball, Manuel Sabin, Alon Rosen
Publication date: 12 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96884-1_26
Related Items (8)
On building fine-grained one-way functions from strong average-case hardness ⋮ Proofs of Work from worst-case assumptions ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ Improved Merlin-Arthur protocols for central problems in fine-grained complexity ⋮ Bankrupting Sybil despite churn ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- One way functions and pseudorandom generators
- A fast method for interpolation using preconditioning
- Toward efficient agnostic learning
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Proofs of Work from worst-case assumptions
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- From obfuscation to the security of Fiat-Shamir for proofs
- When does functional encryption imply obfuscation?
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Non-trivial witness encryption and null-iO from standard assumptions
- On relationships between statistical zero-knowledge proofs
- Mining circuit lower bound proofs for meta-algorithms
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
- Output-Compressing Randomized Encodings and Applications
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Time-Lock Puzzles from Randomized Encodings
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Obfuscation Combiners
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Cryptanalysis of the Multilinear Map over the Integers
- How to Obfuscate Programs Directly
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
- Constant depth circuits, Fourier transform, and learnability
- Random-Self-Reducibility of Complete Sets
- New Multilinear Maps Over the Integers
- On Best-Possible Obfuscation
- A theory of the learnable
- On the Fourier spectrum of monotone functions
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Strong Direct Product Theorems for Quantum Communication and Query Complexity
- Average-case fine-grained hardness
- Agnostic Learning from Tolerant Natural Proofs
- How to use indistinguishability obfuscation
- Graph-Induced Multilinear Maps from Lattices
- Cryptanalyses of Candidate Branching Program Obfuscators
- How Proofs are Prepared at Camelot
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Learning algorithms from natural proofs
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Multi-input Functional Encryption
- Witness encryption and its applications
- Reusable garbled circuits and succinct functional encryption
- Topics in Cryptology – CT-RSA 2005
- Theory of Cryptography
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Natural proofs
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
This page was built for publication: Proofs of Work from worst-case assumptions
