Proactive secret sharing with constant communication
From MaRDI portal
Recommendations
- Proactive Secret Sharing with a Dishonest Majority
- How to withstand mobile virus attacks, revisited
- Brief announcement: Proactive secret sharing with a dishonest majority
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
- Provably secure proactive secret sharing without the adjacent assumption
Cites work
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
- Communication-optimal proactive secret sharing for dynamic groups
- Efficient robust secret sharing from expander graphs
- 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 1302840 (Why is no real title available?)
- scientific article; zbMATH DE number 1031003 (Why is no real title available?)
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- scientific article; zbMATH DE number 1406798 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. IV: Bipartite Ramanujan graphs of all sizes
- Maintaining authenticated communication in the presence of break-ins
- On the second eigenvalue of a graph
- Pseudorandom functions and permutations provably secure against related-key attacks
- Related-key security for pseudorandom functions beyond the linear barrier
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Cited in
(1)
This page was built for publication: Proactive secret sharing with constant communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582179)
