Efficient asynchronous verifiable secret sharing and multiparty computation
type: Item
instance of: scholarly article
title: Efficient asynchronous verifiable secret sharing and multiparty computation
zbMATH Open document ID: 1308.94099
author: Arpita Patra
author: Ashish Choudhury
author: C. Pandu Rangan
published in: Journal of Cryptology
publication date: 2015-03-25T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94C12
Mathematics Subject Classification ID: 94A17
zbMATH DE Number: 6419544
zbMATH Keywords: unconditional security
zbMATH Keywords: fault tolerance
zbMATH Keywords: communication complexity
describes a project that uses: VIFF
MaRDI profile type: Publication
full work available at URL: s00145-013-9172-7
OpenAlex ID: W2037353768
cites work: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
cites work: Q4035736
cites work: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
cites work: Theory of Cryptography
cites work: Simple and Efficient Perfectly-Secure Asynchronous MPC
cites work: Perfectly-Secure MPC with Linear Communication Complexity
cites work: Asynchronous secure computation
cites work: Asynchronous secure computations with optimal resilience (extended abstract)
cites work: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
cites work: Generalized privacy amplification
cites work: Privacy Amplification by Public Discussion
cites work: Fast asynchronous Byzantine agreement with optimal resilience
cites work: Q4250770
cites work: Asynchronous Multiparty Computation: Theory and Implementation
cites work: Scalable Secure Multiparty Computation
cites work: Scalable and Unconditionally Secure Multiparty Computation
cites work: Perfectly secure message transmission
cites work: The round complexity of verifiable secret sharing and secure multicast
cites work: Q2707411
cites work: Improving the Round Complexity of VSS in Point-to-Point Networks
cites work: On Expected Constant-Round Protocols for Byzantine Agreement
cites work: Q4146667
cites work: The Round Complexity of Verifiable Secret Sharing Revisited
cites work: Round Efficient Unconditionally Secure Multiparty Computation Protocol
cites work: Simple and efficient asynchronous byzantine agreement with optimal resilience
cites work: Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
cites work: Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
cites work: Q4414293
cites work: How to share a secret
cites work: Q2707598
cites work: Batch secret sharing for secure multi-party computation in asynchronous network
DOI: 10.1007/S00145-013-9172-7
description: scientific article; zbMATH DE number 6419544