scientific article; zbMATH DE number 1950364

MaRDI QIDQ4413003zbMATH OpenFDO

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

Publication date 17 July 2003

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)
• scientific article; zbMATH DE number 1583939
• 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)
• scientific article; zbMATH DE number 1583939 (Why is no real title available?)
• scientific article; zbMATH DE number 1583940 (Why is no real title available?)
• 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:

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