{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:03:11Z","timestamp":1766268191732,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1650441"],"award-info":[{"award-number":["DGE-1650441"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354207","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"2387-2402","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols"],"prefix":"10.1145","author":[{"given":"Soumya","family":"Basu","sequence":"first","affiliation":[{"name":"Cornell University & IC3, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alin","family":"Tomescu","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ittai","family":"Abraham","sequence":"additional","affiliation":[{"name":"VMware Research, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[{"name":"Calibra, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[{"name":"University of North Carolina at Chapel Hill & VMware Research, Chapel Hill, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emin G\u00fcn","family":"Sirer","sequence":"additional","affiliation":[{"name":"Cornell University & IC3, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Brief Note: Asynchronous Verifiable Secret Sharing with Optimal Resilience and Linear Amortized Overhead. arXiv preprintarXiv:1902.06095(2019).","author":"Kate T. Yurek A.","year":"2019","unstructured":"T. Yurek A. Kate , A. Miller . 2019 . Brief Note: Asynchronous Verifiable Secret Sharing with Optimal Resilience and Linear Amortized Overhead. arXiv preprintarXiv:1902.06095(2019). T. Yurek A. Kate, A. Miller. 2019. Brief Note: Asynchronous Verifiable Secret Sharing with Optimal Resilience and Linear Amortized Overhead. arXiv preprintarXiv:1902.06095(2019)."},{"key":"e_1_3_2_2_2_1","unstructured":"D. F. Aranha and C. P. L. Gouv\u00eaa. [n.d.]. RELIC is an Efficient Library for Cryptography. https:\/\/github.com\/relic-toolkit\/relic.  D. F. Aranha and C. P. L. Gouv\u00eaa. [n.d.]. RELIC is an Efficient Library for Cryptography. https:\/\/github.com\/relic-toolkit\/relic."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"M. Backes A. Datta and A. Kate. 2013. Asynchronous computational VSS with reduced communication complexity. In Topics in Cryptology -- CT-RSA 2013 (LNCS) Vol. 7779. 259--276.  M. Backes A. Datta and A. Kate. 2013. Asynchronous computational VSS with reduced communication complexity. In Topics in Cryptology -- CT-RSA 2013 (LNCS) Vol. 7779. 259--276.","DOI":"10.1007\/978-3-642-36095-4_17"},{"key":"e_1_3_2_2_4_1","volume-title":"Revisited. In ACM Conference on Principles of Distributed Computing (PODC)","author":"Baron J.","year":"2014","unstructured":"J. Baron , K. El Defrawy , J. Lampkins , and R. Ostrovsky . 2014. How to Withstand Mobile Virus Attacks , Revisited. In ACM Conference on Principles of Distributed Computing (PODC) 2014 . 293--302. J. Baron, K. El Defrawy, J. Lampkins, and R. Ostrovsky. 2014. How to Withstand Mobile Virus Attacks, Revisited. In ACM Conference on Principles of Distributed Computing (PODC) 2014. 293--302."},{"key":"e_1_3_2_2_5_1","volume-title":"Communication-Optimal Proactive Secret Sharing for Dynamic Groups. In International Conference on Applied Cryptography and Network Security (ACNS)","author":"Baron J.","year":"2015","unstructured":"J. Baron , K. El Defrawy , J. Lampkins , and R. Ostrovsky . 2015 . Communication-Optimal Proactive Secret Sharing for Dynamic Groups. In International Conference on Applied Cryptography and Network Security (ACNS) 2015 . 23--41. J. Baron, K. El Defrawy, J. Lampkins, and R. Ostrovsky. 2015. Communication-Optimal Proactive Secret Sharing for Dynamic Groups. In International Conference on Applied Cryptography and Network Security (ACNS) 2015. 23--41."},{"key":"e_1_3_2_2_6_1","volume-title":"ACM Conference on Computer and Communications Security (CCS)","author":"Bowers K. D.","year":"2009","unstructured":"K. D. Bowers , A. Juels , and A. Oprea . 2009. HAIL: A high-availability and integrity layer for cloud storage . In ACM Conference on Computer and Communications Security (CCS) 2009 . 187--198. K. D. Bowers, A. Juels, and A. Oprea. 2009. HAIL: A high-availability and integrity layer for cloud storage. In ACM Conference on Computer and Communications Security (CCS) 2009. 187--198."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"volume-title":"9th ACM Conference on Computer and Communications Security (CCS).","author":"Cachin C.","key":"e_1_3_2_2_8_1","unstructured":"C. Cachin , K. Kursawe , A. Lysyanskaya , and R. Strobl . 2002. Asynchronous verifiable secret sharing and proactive cryptosystems . In 9th ACM Conference on Computer and Communications Security (CCS). C. Cachin, K. Kursawe, A. Lysyanskaya, and R. Strobl. 2002. Asynchronous verifiable secret sharing and proactive cryptosystems. In 9th ACM Conference on Computer and Communications Security (CCS)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"C. Cachin K. Kursawe F. Petzold and V. Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology -- CRYPTO '01.524--541.  C. Cachin K. Kursawe F. Petzold and V. Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology -- CRYPTO '01.524--541.","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"volume-title":"Fast Asynchronous Byzantine Agreement with Optimal Resilience. In 25th ACM Symposium on Theory of Computing (STOC).42--51","author":"Canetti R.","key":"e_1_3_2_2_11_1","unstructured":"R. Canetti and T. Rabin . 1993 . Fast Asynchronous Byzantine Agreement with Optimal Resilience. In 25th ACM Symposium on Theory of Computing (STOC).42--51 . R. Canetti and T. Rabin. 1993. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In 25th ACM Symposium on Theory of Computing (STOC).42--51."},{"key":"e_1_3_2_2_12_1","volume-title":"SCRAPE: Scalable randomness attested by public entities. In International Conference on Applied Cryptography and Network Security(ACNS)","author":"Cascudo I.","year":"2017","unstructured":"I. Cascudo and B. David . 2017 . SCRAPE: Scalable randomness attested by public entities. In International Conference on Applied Cryptography and Network Security(ACNS) . Springer , 537--556. I. Cascudo and B. David. 2017. SCRAPE: Scalable randomness attested by public entities. In International Conference on Applied Cryptography and Network Security(ACNS). Springer, 537--556."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"volume-title":"26th IEEE Symposium on Foundations of Computer Science (FOCS). 383--395","author":"Chor B.","key":"e_1_3_2_2_14_1","unstructured":"B. Chor , S. Goldwasser , S. Micali , and B. Awerbuch . 1985. Verifiable secret sharing and achieving simultaneity in the presence of faults . In 26th IEEE Symposium on Foundations of Computer Science (FOCS). 383--395 . B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. 1985. Verifiable secret sharing and achieving simultaneity in the presence of faults. In 26th IEEE Symposium on Foundations of Computer Science (FOCS). 383--395."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"R. Cramer R. Gennaro and B. Schoenmakers. 1997. A Secure and Optimally Efficient Multi-Authority Election Scheme. In Advances in Cryptology -- EUROCRYPT 1997. 103--118.  R. Cramer R. Gennaro and B. Schoenmakers. 1997. A Secure and Optimally Efficient Multi-Authority Election Scheme. In Advances in Cryptology -- EUROCRYPT 1997. 103--118.","DOI":"10.1007\/3-540-69053-0_9"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd V. Pastro N. Smart and S. Zakarias. 2012. Multiparty computation from somewhat homomorphic encryption. In Advances in Cryptology -- CRYPTO 2012 (LNCS) Vol. 7417. 643--662.  I. Damg\u00e5rd V. Pastro N. Smart and S. Zakarias. 2012. Multiparty computation from somewhat homomorphic encryption. In Advances in Cryptology -- CRYPTO 2012 (LNCS) Vol. 7417. 643--662.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Y. Desmedt and Y. Frankel. 1991. Shared generation of authenticators and signatures. In Advances in Cryptology -- CRYPTO 1991. 457--469.  Y. Desmedt and Y. Frankel. 1991. Shared generation of authenticators and signatures. In Advances in Cryptology -- CRYPTO 1991. 457--469.","DOI":"10.1007\/3-540-46766-1_37"},{"key":"e_1_3_2_2_18_1","unstructured":"Y. Desmedt and S. Jajodia. 1997. Redistributing secret shares to new access structures and its applications. Technical Report ISSE TR-97-01. George Mason University.  Y. Desmedt and S. Jajodia. 1997. Redistributing secret shares to new access structures and its applications. Technical Report ISSE TR-97-01. George Mason University."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/RISP.1991.130780"},{"volume-title":"International Conference on Dependable Systems and Networks (DSN)'17","author":"Duan S.","key":"e_1_3_2_2_20_1","unstructured":"S. Duan , M. K. Reiter , and H. Zhang . 2017. Secure causal atomic broadcast, revisited . In International Conference on Dependable Systems and Networks (DSN)'17 . 61--72. S. Duan, M. K. Reiter, and H. Zhang. 2017. Secure causal atomic broadcast, revisited. In International Conference on Dependable Systems and Networks (DSN)'17. 61--72."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"e_1_3_2_2_23_1","volume-title":"IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Frankel Y.","year":"1997","unstructured":"Y. Frankel , P. Gemmell , P. D. MacKenzie , and M. Yung . 1997. Optimal-resilience proactive public-key cryptosystems . In IEEE Symposium on Foundations of Computer Science (FOCS) 1997 . 384--393. Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. 1997. Optimal-resilience proactive public-key cryptosystems. In IEEE Symposium on Foundations of Computer Science (FOCS) 1997. 384--393."},{"volume-title":"ACM Symposium on Theory of Computing (STOC)1992","author":"Franklin M.","key":"e_1_3_2_2_24_1","unstructured":"M. Franklin and M. Yung . 1992. Communication Complexity of Secure Computation (Extended Abstract) . In ACM Symposium on Theory of Computing (STOC)1992 . 699--710. M. Franklin and M. Yung. 1992. Communication Complexity of Secure Computation (Extended Abstract). In ACM Symposium on Theory of Computing (STOC)1992. 699--710."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.863969"},{"volume-title":"49th International Conference on Dependable Systems and Networks (DSN).","author":"Gueta G. G.","key":"e_1_3_2_2_26_1","unstructured":"G. G. Gueta , I. Abraham , S. Grossman , D. Malkhi , B. Pinkas , M. K. Reiter , D.-A. Seredinschi , O. Tamir , and A. Tomescu . 2019. SBFT: a scalable and decentralized trust infrastructure . In 49th International Conference on Dependable Systems and Networks (DSN). G. G. Gueta, I. Abraham, S. Grossman, D. Malkhi, B. Pinkas, M. K. Reiter, D.-A. Seredinschi, O. Tamir, and A. Tomescu. 2019. SBFT: a scalable and decentralized trust infrastructure. In 49th International Conference on Dependable Systems and Networks (DSN)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"M. P. Herlihy and J. D. Tygar. 1988. How to make replicated data secure. In Advances in Cryptology -- CRYPTO '87 (LNCS) Vol. 293. 379--391.  M. P. Herlihy and J. D. Tygar. 1988. How to make replicated data secure. In Advances in Cryptology -- CRYPTO '87 (LNCS) Vol. 293. 379--391.","DOI":"10.1007\/3-540-48184-2_33"},{"key":"e_1_3_2_2_28_1","volume-title":"Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12 (July","author":"Herlihy M. P.","year":"1990","unstructured":"M. P. Herlihy and J. M. Wing . 1990 . Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12 (July 1990), 463--492. Issue 3. M. P. Herlihy and J. M. Wing. 1990. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12 (July 1990), 463--492. Issue 3."},{"volume-title":"Proactive Public Key and Signature Systems. In 4th ACM Conference on Computer and Communications Security (CCS). 100--110","author":"Herzberg A.","key":"e_1_3_2_2_29_1","unstructured":"A. Herzberg , M. Jakobsson , S. Jarecki , H. Krawczyk , and M. Yung . 1997 . Proactive Public Key and Signature Systems. In 4th ACM Conference on Computer and Communications Security (CCS). 100--110 . A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. 1997. Proactive Public Key and Signature Systems. In 4th ACM Conference on Computer and Communications Security (CCS). 100--110."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"A. Herzberg S. Jarecki H. Krawczyk and M. Yung. 1995. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. In Advances in Cryptology -- CRYPTO'95 Vol. 963. 339--352.  A. Herzberg S. Jarecki H. Krawczyk and M. Yung. 1995. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. In Advances in Cryptology -- CRYPTO'95 Vol. 963. 339--352.","DOI":"10.1007\/3-540-44750-4_27"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"A. Kate G. M. Zaverucha and I. Goldberg. 2010. Constant-size commitments to polynomials and their applications. In Advances in Cryptology -- ASIACRYPT 2010 (LNCS) Vol. 6477. 177--194.  A. Kate G. M. Zaverucha and I. Goldberg. 2010. Constant-size commitments to polynomials and their applications. In Advances in Cryptology -- ASIACRYPT 2010 (LNCS) Vol. 6477. 177--194.","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_2_32_1","volume-title":"CALYPSO: Auditable Sharing of Private Data over Blockchains. Cryptology ePrint Archive, Report 2018\/209. https:\/\/eprint.iacr.org\/2018\/209.","author":"Kokoris-Kogias E.","year":"2018","unstructured":"E. Kokoris-Kogias , E. C. Alp , S. D. Siby , N. Gailly , L. Gasser , P. Jovanovic , E. Syta ,and B. Ford . 2018 . CALYPSO: Auditable Sharing of Private Data over Blockchains. Cryptology ePrint Archive, Report 2018\/209. https:\/\/eprint.iacr.org\/2018\/209. E. Kokoris-Kogias, E. C. Alp, S. D. Siby, N. Gailly, L. Gasser, P. Jovanovic, E. Syta,and B. Ford. 2018. CALYPSO: Auditable Sharing of Private Data over Blockchains. Cryptology ePrint Archive, Report 2018\/209. https:\/\/eprint.iacr.org\/2018\/209."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658357.1658358"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"R. Kotla A. Clement E. Wong L. Alvisi and M. Dahlin. 2008. Zyzzyva: speculative byzantine fault tolerance. Commun. ACM51 11 (2008) 86--95.  R. Kotla A. Clement E. Wong L. Alvisi and M. Dahlin. 2008. Zyzzyva: speculative byzantine fault tolerance. Commun. ACM51 11 (2008) 86--95.","DOI":"10.1145\/1400214.1400236"},{"volume-title":"Advances in Cryptology --CRYPTO '93 (LNCS)","author":"Krawczyk H.","key":"e_1_3_2_2_35_1","unstructured":"H. Krawczyk . 1994. Secret sharing made short . In Advances in Cryptology --CRYPTO '93 (LNCS) , Vol. 773 . 136--146. H. Krawczyk. 1994. Secret sharing made short. In Advances in Cryptology --CRYPTO '93 (LNCS), Vol. 773. 136--146."},{"key":"e_1_3_2_2_36_1","volume-title":"CHURP: Dynamic-Committee Proactive Secret Sharing. Cryptology ePrint Archive, Report 2019\/017. https:\/\/eprint.iacr.org\/2019\/017.","author":"Maram S. K. D.","year":"2019","unstructured":"S. K. D. Maram , F. Zhang , L. Wang , A. Low , Y. Zhang , A. Juels , and D. Song . 2019 . CHURP: Dynamic-Committee Proactive Secret Sharing. Cryptology ePrint Archive, Report 2019\/017. https:\/\/eprint.iacr.org\/2019\/017. S. K. D. Maram, F. Zhang, L. Wang, A. Low, Y. Zhang, A. Juels, and D. Song. 2019. CHURP: Dynamic-Committee Proactive Secret Sharing. Cryptology ePrint Archive, Report 2019\/017. https:\/\/eprint.iacr.org\/2019\/017."},{"key":"e_1_3_2_2_37_1","first-page":"3","article-title":"Fast Byzantine consensus","volume":"3","author":"Martin J.-P.","year":"2006","unstructured":"J.-P. Martin and L. Alvisi . 2006 . Fast Byzantine consensus . IEEE Transactions on Dependable and Secure Computing 3 , 3 (July 2006), 202--215. J.-P. Martin and L. Alvisi. 2006. Fast Byzantine consensus. IEEE Transactions on Dependable and Secure Computing 3, 3 (July 2006), 202--215.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.34"},{"volume-title":"23rd ACM Conference on Computer and Communications Security(CCS). 31--42","author":"Miller A.","key":"e_1_3_2_2_39_1","unstructured":"A. Miller , Y. Xia , K. Croman , E. Shi , and D. Song . 2016. The honey badger of BFT protocols . In 23rd ACM Conference on Computer and Communications Security(CCS). 31--42 . A. Miller, Y. Xia, K. Croman, E. Shi, and D. Song. 2016. The honey badger of BFT protocols. In 23rd ACM Conference on Computer and Communications Security(CCS). 31--42."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"M. Naor B. Pinkas and O. Reingold. 1999. Distributed pseudo-random functions and KDCs. In Advances in Cryptology -- EUROCRYPT '99 (LNCS) Vol. 1592. 327--346.  M. Naor B. Pinkas and O. Reingold. 1999. Distributed pseudo-random functions and KDCs. In Advances in Cryptology -- EUROCRYPT '99 (LNCS) Vol. 1592. 327--346.","DOI":"10.1007\/3-540-48910-X_23"},{"key":"e_1_3_2_2_41_1","volume-title":"On Proactive Secret Sharing Schemes. In International Workshop on Selected Areas in Cryptography","author":"Nikov V.","year":"2004","unstructured":"V. Nikov and S. Nikova . 2005 . On Proactive Secret Sharing Schemes. In International Workshop on Selected Areas in Cryptography 2004 . 308--325. V. Nikov and S. Nikova. 2005. On Proactive Secret Sharing Schemes. In International Workshop on Selected Areas in Cryptography 2004. 308--325."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2013.7.39"},{"key":"e_1_3_2_2_43_1","volume-title":"International Conference on Applied Cryptography and Network Security (ACNS) 2018 (LNCS)","volume":"10892","author":"Nordhold P. S.","unstructured":"P. S. Nordhold and M. Veeningen . 2018. Minimising communication in honest-majority MPC by batchwise multiplication verification . In International Conference on Applied Cryptography and Network Security (ACNS) 2018 (LNCS) , Vol. 10892 . 321--339. P. S. Nordhold and M. Veeningen. 2018. Minimising communication in honest-majority MPC by batchwise multiplication verification. In International Conference on Applied Cryptography and Network Security (ACNS) 2018 (LNCS), Vol. 10892. 321--339."},{"volume-title":"Non-interactive and information-theoretic secure verifiable secret sharing. InAdvances in Cryptology -- CRYPTO '91 (LNCS)","author":"Pedersen T. P.","key":"e_1_3_2_2_44_1","unstructured":"T. P. Pedersen . 1992. Non-interactive and information-theoretic secure verifiable secret sharing. InAdvances in Cryptology -- CRYPTO '91 (LNCS) , Vol. 576 . 129--140. T. P. Pedersen. 1992. Non-interactive and information-theoretic secure verifiable secret sharing. InAdvances in Cryptology -- CRYPTO '91 (LNCS), Vol. 576. 129--140."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177745"},{"key":"e_1_3_2_2_46_1","unstructured":"T. Rocket M. Yin K. Sekniqi R. van Renesse and E. G. Sirer. 2019. Scalable and Probabilistic Leaderless BFT Consensus through Metastability. arXiv preprint arXiv:1906.08936(2019).  T. Rocket M. Yin K. Sekniqi R. van Renesse and E. G. Sirer. 2019. Scalable and Probabilistic Leaderless BFT Consensus through Metastability. arXiv preprint arXiv:1906.08936(2019)."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880022.1880028"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/56175.56181"},{"key":"e_1_3_2_2_51_1","volume-title":"Verifiable Secret Redistribution forArchive Systems. InInternational IEEE Security in Storage Workshop","author":"Wong T. M.","year":"2002","unstructured":"T. M. Wong , C. Wang , and J. M. Wing . 2002 . Verifiable Secret Redistribution forArchive Systems. InInternational IEEE Security in Storage Workshop 2002 . T. M. Wong, C. Wang, and J. M. Wing. 2002. Verifiable Secret Redistribution forArchive Systems. InInternational IEEE Security in Storage Workshop 2002."},{"volume-title":"38th ACM Conference on Principles of Distributed Computing (PODC).","author":"Yin M.","key":"e_1_3_2_2_52_1","unstructured":"M. Yin , D. Malkhi , M. K. Reiter , G. G. Gueta , and I. Abraham . 2019. Hot Stuff: BFT consensus with linearity and responsiveness . In 38th ACM Conference on Principles of Distributed Computing (PODC). M. Yin, D. Malkhi, M. K. Reiter, G. G. Gueta, and I. Abraham. 2019. Hot Stuff: BFT consensus with linearity and responsiveness. In 38th ACM Conference on Principles of Distributed Computing (PODC)."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1085126.1085127"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"London United Kingdom","acronym":"CCS '19"},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354207","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:02Z","timestamp":1750202642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":53,"alternative-id":["10.1145\/3319535.3354207","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354207","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}