Proactive Secret Sharing with a Dishonest Majority

DOI10.1007/978-3-319-44618-9_28zbMath1482.94066OpenAlexW2512970881MaRDI QIDQ2827737

Joshua Lampkins, Karim Eldefrawy, Shlomi Dolev, Rafail Ostrovsky, Mordechai M. Yung

Publication date: 21 October 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_28

zbMATH Keywords

PSS scheme

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Communication-efficient proactive MPC for dynamic groups with dishonest majorities

Cites Work

• Unnamed Item
• Unnamed Item
• Towards efficient private distributed computation on unbounded input streams
• Communication-Optimal Proactive Secret Sharing for Dynamic Groups
• A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
• How to withstand mobile virus attacks, revisited
• Proactive secure message transmission in asynchronous networks
• How to share a secret
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• How to withstand mobile virus attacks (extended abstract)
• Perfectly-Secure MPC with Linear Communication Complexity

This page was built for publication: Proactive Secret Sharing with a Dishonest Majority