Pages that link to "Item:Q1648817"
From MaRDI portal
The following pages link to Thunderella: blockchains with optimistic instant confirmation (Q1648817):
Displaying 26 items.
- Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions (Q1633456) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Security of the blockchain against long delay attack (Q1710674) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Order-fairness for Byzantine consensus (Q2102076) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Shielded computations in smart contracts overcoming forks (Q2145367) (← links)
- Weight-based Nakamoto-style blockchains (Q2146099) (← links)
- Instant block confirmation in the sleepy model (Q2147229) (← links)
- Fast isomorphic state channels (Q2147250) (← links)
- Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- On the (Ir)replaceability of global setups, or how (not) to use a global ledger (Q2697878) (← links)
- Oceanic Games: Centralization Risks and Incentives in Blockchain Mining (Q3294792) (← links)
- piChain: When a Blockchain meets Paxos (Q3300800) (← links)
- Be aware of your leaders (Q6045205) (← links)
- Practical provably secure flooding for blockchains (Q6135421) (← 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)
- Fair delivery of decentralised randomness beacon (Q6573966) (← links)
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! (Q6579852) (← links)
- Simplex consensus: a simple and fast consensus protocol (Q6587963) (← links)
- Asymptotically optimal message dissemination with applications to blockchains (Q6637325) (← links)
