Almost-everywhere secure computation with edge corruptions
type: Item
instance of: scholarly article
title: Almost-everywhere secure computation with edge corruptions
zbMATH Open document ID: 1332.94062
author: Nishanth Chandran
author: Juan Garay
author: Rafail Ostrovsky
published in: Journal of Cryptology
publication date: 2016-01-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6528668
zbMATH Keywords: almost-everywhere secure computation
zbMATH Keywords: bounded-degree network
zbMATH Keywords: secure message transmission
zbMATH Keywords: Byzantine agreement
MaRDI profile type: Publication
full work available at URL: s00145-013-9176-3
OpenAlex ID: W1995324556
cites work: Secure Computation Without Authentication
cites work: Reliable communication over partially authenticated networks
cites work: Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
cites work: Improved Fault Tolerance and Secure Computation on Sparse Networks
cites work: Reliable broadcasting in hypercubes with random link and node failures
cites work: The Byzantine generals strike again
cites work: Perfectly secure message transmission
cites work: Efficient player-optimal protocols for strong and differential consensus
cites work: Secure Message Transmission by Public Discussion: A Brief Survey
cites work: Almost-Everywhere Secure Computation
cites work: Authenticated broadcast with a partially compromised public-key infrastructure
cites work: The Byzantine Generals Problem
cites work: Reaching Agreement in the Presence of Faults
cites work: Reliable communication in networks with Byzantine link failures
cites work: Tolerating linear number of faults in networks of bounded degree
cites work: Realistic Failures in Secure Multi-party Computation
DOI: 10.1007/S00145-013-9176-3
description: scientific article; zbMATH DE number 6528668