Pages that link to "Item:Q1004599"

The following pages link to On expected constant-round protocols for Byzantine agreement (Q1004599):

Displaying 22 items.

• A strong provably secure IBE scheme without bilinear map (Q743115) (← links)
• On the bit security of cryptographic primitives (Q1648779) (← links)
• Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
• Expected constant round Byzantine broadcast under dishonest majority (Q2055728) (← links)
• On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
• Decentralized asset custody scheme with security against rational adversary (Q2152140) (← links)
• Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
• Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
• Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
• Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
• A characterization of eventual Byzantine agreement (Q2784483) (← links)
• Byzantine Agreement in Expected Polynomial Time (Q3177770) (← links)
• Authenticated Byzantine Generals in Dual Failure Model (Q3406476) (← links)
• Random oracles in constantipole (Q5176778) (← links)
• Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
• Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
• On the round complexity of randomized Byzantine agreement (Q6487529) (← links)
• Expected linear round synchronization: the missing link for linear Byzantine SMR (Q6535025) (← links)
• On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
• Sublinear message bounds of authenticated implicit Byzantine agreement (Q6646446) (← links)
• Towards permissionless consensus in the standard model via fine-grained complexity (Q6648203) (← links)