Secure message transmission in asynchronous networks
type: Item
instance of: scholarly article
title: Secure message transmission in asynchronous networks
zbMATH Open document ID: 1225.68039
author: Ashish Choudhury
author: Arpita Patra
author: B. V. Ashwinkumar
author: Kannan Srinathan
author: C. Pandu Rangan
published in: Journal of Parallel and Distributed Computing
publication date: 2011-08-19T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 5940553
zbMATH Keywords: information-theoretic security
zbMATH Keywords: error probability
zbMATH Keywords: optimality
zbMATH Keywords: asynchronous networks
MaRDI profile type: Publication
full work available at URL: j.jpdc.2011.03.004
OpenAlex ID: W2043885000
cites work: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
cites work: Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
cites work: Q4035736
cites work: Simple and Efficient Perfectly-Secure Asynchronous MPC
cites work: Perfectly-Secure MPC with Linear Communication Complexity
cites work: Theory of Cryptography
cites work: Asynchronous secure computation
cites work: Asynchronous secure computations with optimal resilience (extended abstract)
cites work: Fast asynchronous Byzantine agreement with optimal resilience
cites work: On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
cites work: Q4737267
cites work: The Byzantine generals strike again
cites work: Perfectly secure message transmission
cites work: Towards Optimal and Efficient Perfectly Secure Message Transmission
cites work: Secure communication in minimal connectivity models
cites work: The round complexity of verifiable secret sharing and secure multicast
cites work: Q2707411
cites work: Almost Secure (1-Round, n-Channel) Message Transmission Scheme
cites work: Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
cites work: Q3126969
cites work: Q4146667
cites work: Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
cites work: Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
cites work: The Round Complexity of Verifiable Secret Sharing Revisited
cites work: Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
cites work: Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
cites work: Simple and efficient asynchronous byzantine agreement with optimal resilience
cites work: Reaching Agreement in the Presence of Faults
cites work: Q4414293
cites work: Efficient perfectly secure message transmission in synchronous networks
cites work: How to share a secret
cites work: Asynchronous Secure Communication Tolerating Mixed Adversaries
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Q2707598
DOI: 10.1016/J.JPDC.2011.03.004
description: scientific article; zbMATH DE number 5940553