Pages that link to "Item:Q5170880"
From MaRDI portal
The following pages link to On perfectly secure communication over arbitrary networks (Q5170880):
Displayed 15 items.
- Round-efficient perfectly secure message transmission scheme against general adversary (Q766245) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- On minimal connectivity requirements for secure message transmission in directed networks (Q1685018) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Reliable broadcast with respect to topology knowledge (Q2407628) (← links)
- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity (Q2947521) (← links)
- Secure Message Transmission in Asynchronous Directed Graphs (Q3104754) (← links)
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary (Q3511161) (← links)
- Cryptanalysis of Secure Message Transmission Protocols with Feedback (Q4931676) (← links)
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary (Q5458496) (← links)
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary (Q5502798) (← links)
- Efficient reliable communication over partially authenticated networks (Q5917936) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)