Pages that link to "Item:Q2422025"
From MaRDI portal
The following pages link to Algorand: a secure and efficient distributed ledger (Q2422025):
Displaying 29 items.
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- A rational protocol treatment of 51\% attacks (Q2128984) (← links)
- A formal model of Algorand smart contracts (Q2145369) (← links)
- SoK: communication across distributed ledgers (Q2147221) (← links)
- Instant block confirmation in the sleepy model (Q2147229) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing (Q2691589) (← links)
- The fluid limit of a random graph model for a shared ledger (Q5022281) (← links)
- Algebras of UTxO blockchains (Q5084313) (← links)
- Proofs of Catalytic Space (Q5090438) (← links)
- The availability-accountability dilemma and its resolution via accountability gadgets (Q6045232) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Permissionless and asynchronous asset transfer (Q6096037) (← links)
- Multidimensional Byzantine agreement in a synchronous setting (Q6122408) (← links)
- Practical provably secure flooding for blockchains (Q6135421) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
- Bitcoin as a Transaction Ledger: A Composable Treatment (Q6489334) (← links)
- Player-replaceability and forensic support are two sides of the same (crypto) coin (Q6573949) (← links)
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case (Q6579853) (← links)
- Taming adaptivity in YOSO protocols: the modular way (Q6582166) (← links)
- Simplex consensus: a simple and fast consensus protocol (Q6587963) (← links)
- Asymptotically optimal message dissemination with applications to blockchains (Q6637325) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
- SPRINT: high-throughput robust distributed Schnorr signatures (Q6637538) (← links)
- MUSEN: aggregatable key-evolving verifiable random functions and applications (Q6660558) (← links)