Asynchronous unconditionally secure computation: An efficiency improvement

DOI10.1007/3-540-36231-2_9MaRDI QIDQ4417396zbMATH OpenFDO

Authors Balakrishna Prabhu, Kannan Srinathan, C. Pandu Rangan

Publication date 29 July 2003

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

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

• Efficient asynchronous secure multiparty distributed computation
• 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
• Efficient asynchronous secure multiparty distributed computation
• 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: Asynchronous unconditionally secure computation: An efficiency improvement

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