Brief announcement
From MaRDI portal
Publication:5891974
DOI10.1145/2332432.2332453zbMath1301.94133OpenAlexW2171889784MaRDI QIDQ5891974
Publication date: 5 December 2014
Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2332432.2332453
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information theory (general) (94A15) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters ⋮ Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
This page was built for publication: Brief announcement
