Towards permissionless consensus in the standard model via fine-grained complexity
From MaRDI portal
Publication:6648203
DOI10.1007/978-3-031-68379-4_4MaRDI QIDQ6648203
Giorgos Panagiotakos, Aggelos Kiayias, Peter S. Hall, Juan Garay, Marshall Ball
Publication date: 4 December 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consensus from signatures of work
- On expected constant-round protocols for Byzantine agreement
- Proofs of Work from worst-case assumptions
- Blockchains from non-idealized hash functions
- Non-interactive zero knowledge from sub-exponential DDH
- A new algorithm for optimal 2-constraint satisfaction and its implications
- The Bitcoin Backbone Protocol: Analysis and Applications
- On the Exact Complexity of Evaluating Quantified k-CNF
- The Complexity of Satisfiability of Small Depth Circuits
- The Weak Byzantine Generals Problem
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
- Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications
- Average-case fine-grained hardness
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
- More Applications of the Polynomial Method to Algorithm Design
- On the complexity of \(k\)-SAT
- Correlation intractability and SNARGs from sub-exponential DDH
- Towards permissionless consensus in the standard model via fine-grained complexity
Related Items (1)
This page was built for publication: Towards permissionless consensus in the standard model via fine-grained complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648203)
