Tolerating generalized mobile adversaries in secure multiparty computation

DOI10.1007/3-540-44495-5_12MaRDI QIDQ2707599zbMATH OpenFDO

Authors C. Pandu Rangan, Kannan Srinathan

Publication date 8 July 2001

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

Full work available at URL https://doi.org/10.1007/3-540-44495-5_12

zbMATH Keywords

distributed adversarial model of computationmultiparty protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Player simulation and general adversary structures in perfect multiparty computation
• Proactive secure multiparty computation with a dishonest majority
• General adversaries in unconditional multi-party computation
• scientific article; zbMATH DE number 1256784
• scientific article; zbMATH DE number 1950364

Cited in

(1)

• Distributed protocols against mobile eavesdroppers

This page was built for publication: Tolerating generalized mobile adversaries in secure multiparty computation

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