Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience

DOI10.1007/978-3-642-14496-7_7zbMath1282.94063MaRDI QIDQ4931669

Arpita Patra, C. Pandu Rangan, Ashish Choudhury

Publication date: 29 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14496-7_7

Mathematics Subject Classification ID

94A60: Cryptography

68M14: Distributed systems

Related Items

Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience, Network-agnostic security comes (almost) for free in DKG and MPC, Secure message transmission in asynchronous networks, Efficient asynchronous verifiable secret sharing and multiparty computation, Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation, Threshold changeable secret sharing with secure secret reconstruction, Dynamic threshold secret reconstruction and its application to the threshold cryptography, On the communication efficiency of statistically secure asynchronous MPC with optimal resilience, On communication-efficient asynchronous MPC with adaptive security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
• 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
• Perfectly secure message transmission
• 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
• On Expected Constant-Round Protocols for Byzantine Agreement
• Theory of Cryptography
• Theory of Cryptography