Cheraghchi, M. (2019). Nearly optimal robust secret sharing. Designs, codes, and cryptography, 87(8), 1777-1796. https://doi.org/10.1007/s10623-018-0578-y
Chicago Style (17th ed.) CitationCheraghchi, Mahdi. "Nearly Optimal Robust Secret Sharing." Designs, Codes, and Cryptography 87, no. 8 (2019): 1777-1796. https://doi.org/10.1007/s10623-018-0578-y.
MLA (9th ed.) CitationCheraghchi, Mahdi. "Nearly Optimal Robust Secret Sharing." Designs, Codes, and Cryptography, vol. 87, no. 8, 2019, pp. 1777-1796, https://doi.org/10.1007/s10623-018-0578-y.
Warning: These citations may not always be 100% accurate.