Fault-tolerant Computation in the Full Information Model

DOI10.1137/S0097539793246689zbMath0912.68037OpenAlexW2130960476MaRDI QIDQ4388884

Nathan Linial, Oded Goldreich

Publication date: 10 May 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793246689

zbMATH Keywords

fault-tolerant multiparty protocolsinfluences in general two-party computationssampling with weak sources of randomness

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Related Items (6)

On the round complexity of randomized Byzantine agreement ⋮ High entropy random selection protocols ⋮ Mirror games against an open book player ⋮ On private computation in incomplete networks ⋮ Efficient reliable communication over partially authenticated networks ⋮ Rationality in the Full-Information Model

This page was built for publication: Fault-tolerant Computation in the Full Information Model