Ordering transactions with bounded unfairness: definitions, complexity and constructions

DOI10.1007/978-3-031-58734-4_2MaRDI QIDQ6637324

Could not fetch data.

Publication date: 13 November 2024

Mathematics Subject Classification ID

Cryptography (94A60) Social choice (91B14)

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?)
• Hardness results for approximating the bandwidth
• A note on exact algorithms for vertex ordering problems on graphs
• SoK: a consensus taxonomy in the blockchain era
• The NP-completeness of the bandwidth minimization problem
• The Bitcoin backbone protocol with chains of variable difficulty
• Voting paradoxes and digraphs realizations
• Security and composition of multiparty cryptographic protocols
• Order-fairness for Byzantine consensus
• The Bitcoin Backbone Protocol: Analysis and Applications
• The Voting Problem
• The bandwidth problem for graphs and matrices—a survey
• Universally Composable Synchronous Computation
• Analysis of the Blockchain Protocol in Asynchronous Networks
• Faster Exact Bandwidth
• FruitChains
• Exact and Approximate Digraph Bandwidth
• Quick order fairness

This page was built for publication: Ordering transactions with bounded unfairness: definitions, complexity and constructions

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