Cryptanalysis of Secure Message Transmission Protocols with Feedback
From MaRDI portal
Publication:4931676
DOI10.1007/978-3-642-14496-7_14zbMath1282.94071OpenAlexW2135083604MaRDI QIDQ4931676
Publication date: 29 September 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14496-7_14
Related Items (2)
Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission ⋮ Secure Message Transmission in Asynchronous Directed Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Secure communication in minimal connectivity models
- Player simulation and general adversary structures in perfect multiparty computation
- How to share a secret
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
- Perfectly Secure Message Transmission Revisited
- The Byzantine generals strike again
- Perfectly secure message transmission
- Codes Which Detect Deception
- On perfectly secure communication over arbitrary networks
- Possibility and complexity of probabilistic reliable communication in directed networks
- Advances in Cryptology – CRYPTO 2004
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- Algorithms and Computation
This page was built for publication: Cryptanalysis of Secure Message Transmission Protocols with Feedback