Pages that link to "Item:Q1675731"

The following pages link to Ouroboros: a provably secure proof-of-stake blockchain protocol (Q1675731):

Displaying 50 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)
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain (Q1648822) (← links)
• Security of the blockchain against long delay attack (Q1710674) (← links)
• Dirac-based reduction techniques for quantitative analysis of discrete-time Markov models (Q1997254) (← links)
• Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
• Aggregatable distributed key generation (Q2056680) (← links)
• Dynamic ad hoc clock synchronization (Q2056800) (← links)
• Abuse resistant law enforcement access systems (Q2056806) (← links)
• FAST: fair auctions via secret transactions (Q2096643) (← links)
• Order-fairness for Byzantine consensus (Q2102076) (← links)
• Account management in proof of stake ledgers (Q2106625) (← links)
• Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
• Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
• A rational protocol treatment of 51\% attacks (Q2128984) (← links)
• Mining for privacy: how to bootstrap a snarky blockchain (Q2145411) (← links)
• Weight-based Nakamoto-style blockchains (Q2146099) (← links)
• SoK: communication across distributed ledgers (Q2147221) (← links)
• Instant block confirmation in the sleepy model (Q2147229) (← links)
• PoSAT: proof-of-work availability and unpredictability, without the work (Q2147235) (← links)
• Fraud and data availability proofs: detecting invalid blocks in light clients (Q2147248) (← links)
• Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
• Currency stability using blockchain technology (Q2168203) (← links)
• Minting mechanism for proof of stake blockchains (Q2229280) (← links)
• Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
• Interactive verification of architectural design patterns in FACTum (Q2335950) (← links)
• Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
• Soft power: upgrading chain macroeconomic policy through soft forks (Q2670864) (← links)
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing (Q2691589) (← links)
• Turn-based communication channels (Q2697935) (← links)
• Bankrupting Sybil despite churn (Q2698290) (← links)
• Oceanic Games: Centralization Risks and Incentives in Blockchain Mining (Q3294792) (← links)
• Algebras of UTxO blockchains (Q5084313) (← links)
• (Q5090429) (← links)
• Proofs of Catalytic Space (Q5090438) (← links)
• Correctness of Tendermint-Core Blockchains (Q5091090) (← links)
• Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
• Promise: Leveraging Future Gains for Collateral Reduction (Q5147171) (← links)
• Consensus in Data Management: From Distributed Commit to Blockchain (Q5886006) (← links)
• The availability-accountability dilemma and its resolution via accountability gadgets (Q6045232) (← links)
• Three attacks on proof-of-stake ethereum (Q6045235) (← links)
• Achieving almost all blockchain functionalities with polylogarithmic storage (Q6045249) (← links)
• CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
• Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
• Permissionless and asynchronous asset transfer (Q6096037) (← 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)
• Multidimensional Byzantine agreement in a synchronous setting (Q6122408) (← links)
• Practical provably secure flooding for blockchains (Q6135421) (← links)
• SNACKs: leveraging proofs of sequential work for blockchain light clients (Q6135422) (← links)