Reliable communication over partially authenticated networks
type: Item
instance of: scholarly article
title: Reliable communication over partially authenticated networks
zbMATH Open document ID: 0916.68008
DOI: 10.1016/S0304-3975(98)00241-2
author: Matthew Franklin
author: Amos Beimel
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1306153
zbMATH Keywords: reliable communication
zbMATH Keywords: private communication
zbMATH Keywords: authentication keys
zbMATH Keywords: graph connectivity
zbMATH Keywords: Byzantine failures
MaRDI profile type: Publication
cites work: Universal classes of hash functions
cites work: The Byzantine generals strike again
cites work: Perfectly secure message transmission
cites work: Fault Tolerance in Networks of Bounded Degree
cites work: Q3883524
cites work: Easy impossibility proofs for distributed consensus problems
cites work: Q4940691
cites work: Q2757253
cites work: Reaching Agreement in the Presence of Faults
cites work: Q4004196
cites work: Tolerating a linear number of faults in networks of bounded degree
cites work: New hash functions and their use in authentication and set equality
full work available at URL: s0304-3975(98)00241-2
OpenAlex ID: W1999268372
description: scientific article; zbMATH DE number 1306153