Pages that link to "Item:Q2948386"
From MaRDI portal
The following pages link to The Bitcoin Backbone Protocol: Analysis and Applications (Q2948386):
Displaying 43 items.
- Correctness of Tendermint-Core Blockchains (Q5091090) (← links)
- Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
- Analysis of the Blockchain Protocol in Asynchronous Networks (Q5267421) (← links)
- Monotonic Prefix Consistency in Distributed Systems (Q5881533) (← links)
- Be aware of your leaders (Q6045205) (← links)
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks (Q6045214) (← links)
- The availability-accountability dilemma and its resolution via accountability gadgets (Q6045232) (← links)
- Permissionless consensus in the resource model (Q6045237) (← links)
- Achieving almost all blockchain functionalities with polylogarithmic storage (Q6045249) (← links)
- A Novel Two-Stage Game Model for Pricing Cloud/ Fog Computing Resource in Blockchain Systems (Q6053486) (← links)
- PFLM: privacy-preserving federated learning with membership proof (Q6066136) (← links)
- Multi-stage proof-of-works: properties and vulnerabilities (Q6077060) (← links)
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol (Q6104339) (← links)
- Formalizing delayed adaptive corruptions and the security of flooding networks (Q6104341) (← links)
- Practical provably secure flooding for blockchains (Q6135421) (← links)
- SNACKs: leveraging proofs of sequential work for blockchain light clients (Q6135422) (← links)
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees (Q6135431) (← links)
- Better incentives for proof-of-work (Q6155258) (← links)
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions (Q6157530) (← links)
- On elapsed time consensus protocols (Q6157609) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- Decentralizing information technology: the advent of resource based systems (Q6164495) (← links)
- Short Paper: Secure Offline Payments in Bitcoin (Q6166528) (← links)
- Permissionless clock synchronization with public setup (Q6169555) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
- SCRAPE: Scalable Randomness Attested by Public Entities (Q6487218) (← links)
- A Secure Cross-Shard View-Change Protocol for Sharding Blockchains (Q6488393) (← links)
- Bitcoin as a Transaction Ledger: A Composable Treatment (Q6489334) (← links)
- Auditable attribute-based credentials scheme and its application in contact tracing (Q6547973) (← links)
- Byzantine generals in the permissionless setting (Q6573944) (← links)
- Fair delivery of decentralised randomness beacon (Q6573966) (← links)
- Simplex consensus: a simple and fast consensus protocol (Q6587963) (← links)
- Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs (Q6614029) (← links)
- A mean field game approach to bitcoin mining (Q6623046) (← links)
- Tagged chameleon hash from lattices and application to redactable blockchain (Q6635827) (← links)
- Ordering transactions with bounded unfairness: definitions, complexity and constructions (Q6637324) (← links)
- Asymptotically optimal message dissemination with applications to blockchains (Q6637325) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
- Towards permissionless consensus in the standard model via fine-grained complexity (Q6648203) (← links)
- Universal composable transaction serialization with order fairness (Q6648204) (← links)
- Round efficient Byzantine agreement from VDFs (Q6660385) (← links)