The following pages link to (Q4783743):
Displayed 9 items.
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Nearly optimal robust secret sharing (Q1999899) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters (Q2953805) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness (Q6163696) (← links)