Pages that link to "Item:Q3408189"
From MaRDI portal
The following pages link to On Complete Primitives for Fairness (Q3408189):
Displaying 16 items.
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- An introduction to the regular theory of fairness (Q1102102) (← links)
- An efficient primal-dual algorithm for fair combinatorial optimization problems (Q1699796) (← links)
- Coin-based multi-party fair exchange (Q2117033) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Algebraic manipulation detection codes (Q2438532) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference (Q3648757) (← links)
- On fairness of completion-based theorem proving strategies (Q5055773) (← links)
- Fairness for Infinite-State Systems (Q5194957) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703800) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- Astrolabous: a universally composable time-lock encryption scheme (Q6157525) (← links)
- Synchronizable fair exchange (Q6581797) (← links)
- Just how fair is an unreactive world? (Q6605334) (← links)