Universal composable transaction serialization with order fairness

DOI10.1007/978-3-031-68379-4_5MaRDI QIDQ6648204

Aggelos Kiayias, Michele Ciampi, Yu Shen

Publication date: 4 December 2024

zbMATH Keywords

blockchaindistributed ledger protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• The wonderful world of global random oracles
• The Bitcoin backbone protocol with chains of variable difficulty
• Bitcoin as a transaction ledger: a composable treatment
• Security and composition of multiparty cryptographic protocols
• Can a public blockchain keep a secret?
• Ledger combiners for fast settlement
• Order-fairness for Byzantine consensus
• Universal composition with global subroutines: capturing global setup within plain UC
• The consensus number of a cryptocurrency
• The Bitcoin Backbone Protocol: Analysis and Applications
• Reaching Agreement in the Presence of Faults
• Analysis of the Blockchain Protocol in Asynchronous Networks
• Advances in Cryptology – CRYPTO 2004
• FruitChains
• Formal Abstractions for Attested Execution Secure Processors
• Quick order fairness
• Universally composable \(\varSigma \)-protocols in the global random-oracle model
• Ordering transactions with bounded unfairness: definitions, complexity and constructions

This page was built for publication: Universal composable transaction serialization with order fairness

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