Efficient asynchronous verifiable secret sharing and multiparty computation
From MaRDI portal
Publication:2018817
DOI10.1007/S00145-013-9172-7zbMath1308.94099OpenAlexW2037353768MaRDI QIDQ2018817
C. Pandu Rangan, Arpita Patra, Ashish Choudhury
Publication date: 25 March 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9172-7
Fault detection; testing in circuits and networks (94C12) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)
Related Items (10)
Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Efficient perfectly secure computation with optimal resilience
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Batch secret sharing for secure multi-party computation in asynchronous network
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- 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
- Improving the Round Complexity of VSS in Point-to-Point Networks
- Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
- Scalable and Unconditionally Secure Multiparty Computation
- Asynchronous Multiparty Computation: Theory and Implementation
- Privacy Amplification by Public Discussion
- Perfectly secure message transmission
- Generalized privacy amplification
- 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
- Asynchronous secure computations with optimal resilience (extended abstract)
- Perfectly-Secure MPC with Linear Communication Complexity
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- Scalable Secure Multiparty Computation
- On Expected Constant-Round Protocols for Byzantine Agreement
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Efficient asynchronous verifiable secret sharing and multiparty computation
