Pages that link to "Item:Q4974071"
From MaRDI portal
The following pages link to Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme (Q4974071):
Displaying 9 items.
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Quantum verifiable protocol for secure modulo zero-sum randomness (Q2101598) (← links)
- On one-round reliable message transmission (Q2414041) (← links)
- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity (Q2947521) (← links)
- Secure Message Transmission in Asynchronous Directed Graphs (Q3104754) (← links)
- Perfectly Secure Message Transmission in Two Rounds (Q3179361) (← links)
- Realistic versus Rational Secret Sharing (Q3297660) (← links)
- Perfectly Secure Message Transmission Against Independent Rational Adversaries (Q3297684) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
