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
Citácia podle Chicago (17th ed.)Cheraghchi, 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.
Citácia podľa MLA (8th ed.)Cheraghchi, 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.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..