Pages that link to "Item:Q5361463"
From MaRDI portal
The following pages link to Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) (Q5361463):
Displaying 20 items.
- Recursive hiding of biometrics-based secret sharing scheme using adversary structure (Q456087) (← links)
- Threshold protocols in survivor set systems (Q661005) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Refined quorum systems (Q992512) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- Resilient uniformity: applying resiliency in masking (Q2130025) (← links)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Reliable broadcast with respect to topology knowledge (Q2407628) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures (Q2701489) (← links)
- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity (Q2947521) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- Byzantine Agreement Using Partial Authentication (Q3095344) (← links)
- Broadcast from Minicast Secure Against General Adversaries (Q3449517) (← links)
- How to deal with malicious users in privacy‐preserving distributed data mining (Q3497744) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)
