How to withstand mobile virus attacks, revisited

DOI10.1145/2611462.2611474zbMath1321.94036OpenAlexW2029416521MaRDI QIDQ2943628

Karim Eldefrawy, Rafail Ostrovsky, Joshua Lampkins, Joshua Baron

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2611462.2611474

zbMATH Keywords

secret sharingsecure multiparty computationproactive security

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15) Internet topics (68M11)

Related Items (9)

Fluid MPC: secure multiparty computation with dynamic participants ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ Storing and Retrieving Secrets on a Blockchain ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Communication-Optimal Proactive Secret Sharing for Dynamic Groups ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Proactive Secret Sharing with a Dishonest Majority ⋮ Communication-efficient proactive MPC for dynamic groups with dishonest majorities

This page was built for publication: How to withstand mobile virus attacks, revisited