scientific article; zbMATH DE number 1955785

MaRDI QIDQ4417396zbMATH OpenFDO

Authors

Publication date 29 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2551/25510093.htm

zbMATH Keywords

asynchronous secure computationsecure multiparty computation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1583939
• Asynchronous secure multiparty computation in constant time
• Asynchronous Multiparty Computation: Theory and Implementation
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation

Cited in

(12)

• Secure multi-party computation in large networks
• On communication-efficient asynchronous MPC with adaptive security
• scientific article; zbMATH DE number 1583939 (Why is no real title available?)
• Asynchronous Multi-Party Computation with Quadratic Communication
• Asynchronous Multiparty Computation: Theory and Implementation
• Multiparty Interactive Communication with Private Channels
• Batch secret sharing for secure multi-party computation in asynchronous network
• Network-agnostic security comes (almost) for free in DKG and MPC
• Perfect asynchronous MPC with linear communication overhead
• Towards achieving asynchronous MPC with linear communication and optimal resilience
• Fast and efficient perfectly secure network-agnostic secure computation
• Reducing communication costs in robust peer-to-peer networks

This page was built for publication:

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