Pages that link to "Item:Q5311556"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2004 (Q5311556):
Displaying 21 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)
- Efficient perfectly secure message transmission in synchronous networks (Q1917093) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Human Perfectly Secure Message Transmission Protocols and Their Applications (Q2912818) (← 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)
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary (Q3511161) (← links)
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited (Q3540054) (← links)
- Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes (Q3558311) (← links)
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks (Q3616571) (← links)
- Cryptanalysis of Secure Message Transmission Protocols with Feedback (Q4931676) (← links)
- Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality (Q5458204) (← 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)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees (Q6573950) (← links)