Communication-Optimal Proactive Secret Sharing for Dynamic Groups

DOI10.1007/978-3-319-28166-7_2zbMath1459.94157OpenAlexW2296195235MaRDI QIDQ2794492

Joshua Lampkins, Karim Eldefrawy, Rafail Ostrovsky, Joshua Baron

Publication date: 10 March 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28166-7_2

zbMATH Keywords

secret sharingsecure multiparty computationdynamic groupsproactive securitymobile secret sharing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ Storing and Retrieving Secrets on a Blockchain ⋮ Dynamic and Verifiable Hierarchical Secret Sharing ⋮ An efficient publicly verifiable and proactive secret sharing scheme ⋮ Perfect MPC over layered graphs ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Perennial secure multi-party computation of universal Turing machine ⋮ Communication-Optimal Proactive Secret Sharing for Dynamic Groups ⋮ Secure publicly verifiable and proactive secret sharing schemes with general access structure ⋮ Proactive Secret Sharing with a Dishonest Majority ⋮ Communication-efficient proactive MPC for dynamic groups with dishonest majorities

Cites Work

• Communication-Optimal Proactive Secret Sharing for Dynamic Groups
• How to withstand mobile virus attacks, revisited
• How to share a secret
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Simplified Threshold RSA with Adaptive and Proactive Security
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Proactive RSA with Non-interactive Signing
• Scalable and Unconditionally Secure Multiparty Computation
• An O (log n ) expected rounds randomized byzantine generals protocol
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• How to withstand mobile virus attacks (extended abstract)
• Eavesdropping games
• Perfectly-Secure MPC with Linear Communication Complexity
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Communication-Optimal Proactive Secret Sharing for Dynamic Groups