Pages that link to "Item:Q3596386"
From MaRDI portal
The following pages link to Towards Optimal and Efficient Perfectly Secure Message Transmission (Q3596386):
Displaying 9 items.
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity (Q2947521) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- How to recover a secret with \(O(n)\) additions (Q6186593) (← links)
