Pages that link to "Item:Q656919"
From MaRDI portal
The following pages link to Resource fairness and composability of cryptographic protocols (Q656919):
Displaying 5 items.
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- Synchronizable fair exchange (Q6581797) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
