Author of the publication

Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols.

, , , , , and . ACM Conference on Computer and Communications Security, page 2387-2402. ACM, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Low-Distortion Inference of Latent Similarities from a Multiplex Social Network., , , and . SIAM J. Comput., 44 (3): 617-668 (2015)SBFT: A Scalable and Decentralized Trust Infrastructure., , , , , , , , and . DSN, page 568-580. IEEE, (2019)Compact name-independent routing with minimum stretch., , , , and . SPAA, page 20-24. ACM, (2004)Distributed SSH Key Management with Proactive RSA Threshold Signatures., , and . ACNS, volume 10892 of Lecture Notes in Computer Science, page 22-43. Springer, (2018)Compact Routing for Graphs Excluding a Fixed Minor., , and . DISC, volume 3724 of Lecture Notes in Computer Science, page 442-456. Springer, (2005)On Approximate Distance Labels and Routing Schemes with Affine Stretch., and . DISC, volume 6950 of Lecture Notes in Computer Science, page 404-415. Springer, (2011)Volume in General Metric Spaces., , , and . ESA (2), volume 6347 of Lecture Notes in Computer Science, page 87-99. Springer, (2010)LAND: stretch (1 + epsilon) locality-aware networks for DHTs., , and . SODA, page 550-559. SIAM, (2004)Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus., , , , and . OPODIS, volume 95 of LIPIcs, page 25:1-25:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Forbidden-set distance labels for graphs of bounded doubling dimension., , , and . PODC, page 192-200. ACM, (2010)