Secure communication in multicast channels: The answer to Franklin and Wright's question
From MaRDI portal
Publication:5934143
DOI10.1007/s00145-001-0002-yzbMath1027.94012MaRDI QIDQ5934143
Publication date: 21 December 2003
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-001-0002-y
Related Items
ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH, Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality, Efficient reliable communication over partially authenticated networks, A one-round secure message broadcasting protocol through a key sharing tree, Edge-colored graphs with applications to homogeneous faults, On private computation in incomplete networks, On one-round reliable message transmission, Probabilistic reliability and privacy of communication using multicast in general neighbor networks, AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT