Communication-optimal proactive secret sharing for dynamic groups

DOI10.1007/978-3-319-28166-7_2MaRDI QIDQ2794492zbMATH OpenOpenAlexFDO

Authors Joshua Baron, Karim Eldefrawy, Joshua Lampkins, Rafail Ostrovsky

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

dynamic groupsmobile secret sharingproactive securitysecret sharingsecure multiparty computation

Mathematics Subject Classification ID

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

Recommendations

• Proactive Secret Sharing with a Dishonest Majority
• Brief announcement: Proactive secret sharing with a dishonest majority
• How to withstand mobile virus attacks, revisited
• Communication-efficient proactive MPC for dynamic groups with dishonest majorities
• Fully dynamic secret sharing schemes

Cites work

• An O (log n ) expected rounds randomized byzantine generals protocol
• Communication-optimal proactive secret sharing for dynamic groups
• Eavesdropping games
• How to share a secret
• How to withstand mobile virus attacks (extended abstract)
• How to withstand mobile virus attacks, revisited
• scientific article; zbMATH DE number 1618053 (Why is no real title available?)
• scientific article; zbMATH DE number 1302840 (Why is no real title available?)
• scientific article; zbMATH DE number 1031003 (Why is no real title available?)
• scientific article; zbMATH DE number 1088252 (Why is no real title available?)
• scientific article; zbMATH DE number 1942440 (Why is no real title available?)
• scientific article; zbMATH DE number 1406798 (Why is no real title available?)
• scientific article; zbMATH DE number 1418290 (Why is no real title available?)
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Perfectly-Secure MPC with Linear Communication Complexity
• Proactive RSA with Non-interactive Signing
• Scalable and Unconditionally Secure Multiparty Computation
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Simplified Threshold RSA with Adaptive and Proactive Security
• Theory of Cryptography
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

Cited in

(18)

• Perennial secure multi-party computation of universal Turing machine
• Communication-efficient proactive MPC for dynamic groups with dishonest majorities
• Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups
• Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
• Secure publicly verifiable and proactive secret sharing schemes with general access structure
• Efficient proactive secret sharing for large data via concise vector commitments
• Communication-optimal proactive secret sharing for dynamic groups
• Proactive Secret Sharing with a Dishonest Majority
• Dynamic Secrets in Communication Security
• Dynamic and verifiable hierarchical secret sharing
• Storing and retrieving secrets on a blockchain
• Spreading Alerts Quietly and the Subgroup Escape Problem
• An efficient publicly verifiable and proactive secret sharing scheme
• Perfect MPC over layered graphs
• On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
• Proactive secret sharing with constant communication
• Spreading alerts quietly and the subgroup escape problem

This page was built for publication: Communication-optimal proactive secret sharing for dynamic groups

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