How to withstand mobile virus attacks, revisited

DOI10.1145/2611462.2611474zbMath1321.94036MaRDI 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 sharing; secure multiparty computation; proactive security

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

94A60: Cryptography

68M14: Distributed systems

68M12: Network protocols

94A62: Authentication, digital signatures and secret sharing

68W15: Distributed algorithms

68M11: Internet topics

Related Items

Storing and Retrieving Secrets on a Blockchain, Communication-efficient proactive MPC for dynamic groups with dishonest majorities, Fluid MPC: secure multiparty computation with dynamic participants, Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms, 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