Pages that link to "Item:Q1917093"
From MaRDI portal
The following pages link to Efficient perfectly secure message transmission in synchronous networks (Q1917093):
Displaying 12 items.
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Round-efficient perfectly secure message transmission scheme against general adversary (Q766245) (← links)
- Perfectly reliable message transmission (Q845819) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity (Q2947521) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Secure Message Transmission in Asynchronous Directed Graphs (Q3104754) (← links)
- Perfectly Secure Message Transmission in Two Rounds (Q3179361) (← links)
- Perfectly Secure Message Transmission Against Independent Rational Adversaries (Q3297684) (← links)
- Making Asynchronous Distributed Computations Robust to Channel Noise (Q4993319) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
