Asynchronous perfectly secure computation tolerating generalized adversaries

DOI10.1007/3-540-45450-0_37MaRDI QIDQ4413003zbMATH OpenFDO

Authors M. V. N. Ashwin Kumar, C. Pandu Rangan, Kannan Srinathan

Publication date 17 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/2384/23840497.htm

zbMATH Keywords

asynchronous multiparty computationasynchronous threshold protocolssecure multiparty computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Efficient asynchronous secure multiparty distributed computation
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Asynchronous Multiparty Computation: Theory and Implementation
• Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries

Cited in

(12)

• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• Player simulation and general adversary structures in perfect multiparty computation
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Efficient asynchronous secure multiparty distributed computation
• Tolerating generalized mobile adversaries in secure multiparty computation
• Secure Protocols with Asymmetric Trust
• Asynchronous secure communication tolerating mixed adversaries
• Efficient perfectly secure computation with optimal resilience
• Batch secret sharing for secure multi-party computation in asynchronous network
• Maliciously secure massively parallel computation for all-but-one corruptions
• Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
• Network agnostic MPC with statistical security

This page was built for publication: Asynchronous perfectly secure computation tolerating generalized adversaries

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