Pages that link to "Item:Q1648822"

The following pages link to Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain (Q1648822):

Displaying 32 items.

• Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions (Q1633456) (← links)
• Security of the blockchain against long delay attack (Q1710674) (← links)
• Dynamic ad hoc clock synchronization (Q2056800) (← links)
• TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
• Abuse resistant law enforcement access systems (Q2056806) (← links)
• Verifiable random functions with optimal tightness (Q2061948) (← links)
• FAST: fair auctions via secret transactions (Q2096643) (← links)
• Appointed learning for the common good: optimal committee size and monetary transfers (Q2100625) (← links)
• Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
• Mining for privacy: how to bootstrap a snarky blockchain (Q2145411) (← 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)
• Fine-grained forward secrecy: allow-list/deny-list encryption and applications (Q2147256) (← links)
• Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
• Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
• Minting mechanism for proof of stake blockchains (Q2229280) (← links)
• Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
• Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing (Q2691589) (← links)
• Non-malleable time-lock puzzles and applications (Q2697901) (← links)
• Simulatable verifiable random function from the LWE assumption (Q2700784) (← links)
• Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
• Proofs about Network Communication: For Humans and Machines (Q6197375) (← links)
• Practical verifiable random function with RKA security (Q6535499) (← links)
• The unique chain rule and its applications (Q6573946) (← links)
• Player-replaceability and forensic support are two sides of the same (crypto) coin (Q6573949) (← links)
• Fair delivery of decentralised randomness beacon (Q6573966) (← links)
• Taming adaptivity in YOSO protocols: the modular way (Q6582166) (← links)
• Asymptotically optimal message dissemination with applications to blockchains (Q6637325) (← links)
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
• MUSEN: aggregatable key-evolving verifiable random functions and applications (Q6660558) (← links)