Pages that link to "Item:Q2829949"
From MaRDI portal
The following pages link to Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949):
Displaying 12 items.
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)