Batch secret sharing for secure multi-party computation in asynchronous network

DOI10.1007/S12204-009-0112-5MaRDI QIDQ615211zbMATH OpenOpenAlexFDO

Authors Zheng Huang, Zheng Gong, Qiang Li

Publication date 5 January 2011

Published in Journal of Shanghai Jiaotong University (Science) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12204-009-0112-5

zbMATH Keywords

asynchronous networksecret sharesecure multi-party computation

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Simple and Efficient Perfectly-Secure Asynchronous MPC
• scientific article; zbMATH DE number 1583939
• Efficient asynchronous verifiable secret sharing and multiparty computation
• scientific article; zbMATH DE number 1955785
• Secure multi-party computation in large networks

Cites work

• Asynchronous secure computations with optimal resilience (extended abstract)
• scientific article; zbMATH DE number 1583939 (Why is no real title available?)
• scientific article; zbMATH DE number 1950364 (Why is no real title available?)
• scientific article; zbMATH DE number 1842487 (Why is no real title available?)

Cited in

(3)

• Efficient asynchronous verifiable secret sharing and multiparty computation
• Batching multiple protocols to improve efficiency of multi-party computation
• Lightweight asynchronous verifiable secret sharing with optimal resilience

This page was built for publication: Batch secret sharing for secure multi-party computation in asynchronous network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615211)