On one-round reliable message transmission
From MaRDI portal
Publication:2414041
DOI10.1016/j.ipl.2019.02.011zbMath1473.94093OpenAlexW2794575702WikidataQ128280206 ScholiaQ128280206MaRDI QIDQ2414041
Publication date: 10 May 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://people.math.aau.dk/~rene/postprints/RelMessageTrans_extended.pdf
Cites Work
- Universal hashing and authentication codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Secure communication in minimal connectivity models
- Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Perfectly Secure Message Transmission in Two Rounds
- Perfectly secure message transmission
- Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- Secure communication in multicast channels: The answer to Franklin and Wright's question
This page was built for publication: On one-round reliable message transmission