Secure message transmission in asynchronous networks

DOI10.1016/j.jpdc.2011.03.004zbMath1225.68039OpenAlexW2043885000MaRDI QIDQ635383

Arpita Patra, B. V. Ashwinkumar, C. Pandu Rangan, Ashish Choudhury, Kannan Srinathan

Publication date: 19 August 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.03.004

zbMATH Keywords

optimalityerror probabilityinformation-theoretic securityasynchronous networks

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items

Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient perfectly secure message transmission in synchronous networks
• Secure communication in minimal connectivity models
• Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
• An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
• How to share a secret
• The Round Complexity of Verifiable Secret Sharing Revisited
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Reaching Agreement in the Presence of Faults
• The Byzantine generals strike again
• Perfectly secure message transmission
• Asynchronous Secure Communication Tolerating Mixed Adversaries
• Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
• Simple and efficient asynchronous byzantine agreement with optimal resilience
• The round complexity of verifiable secret sharing and secure multicast
• Fast asynchronous Byzantine agreement with optimal resilience
• Asynchronous secure computation
• Advances in Cryptology – CRYPTO 2004
• Asynchronous secure computations with optimal resilience (extended abstract)
• Perfectly-Secure MPC with Linear Communication Complexity
• Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Theory of Cryptography