Algorithms and Computation
From MaRDI portal
Publication:5897861
DOI10.1007/11602613zbMath1173.68325OpenAlexW2304246803MaRDI QIDQ5897861
Yvo G. Desmedt, Yongge Wang, M. V. D. Burmester
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (6)
Graph coloring applied to secure computation in non-abelian groups ⋮ Edge-colored graphs with applications to homogeneous faults ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures ⋮ Cryptanalysis of Secure Message Transmission Protocols with Feedback ⋮ Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary ⋮ Round-efficient perfectly secure message transmission scheme against general adversary
This page was built for publication: Algorithms and Computation
