Kasper Green Larsen, Mark Simkin 0001. Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long. In Clemente Galdi, Vladimir Kolesnikov, editors, Security and Cryptography for Networks - 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings. Volume 12238 of Lecture Notes in Computer Science, pages 566-578, Springer, 2020. [doi]
@inproceedings{LarsenS20, title = {Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long}, author = {Kasper Green Larsen and Mark Simkin 0001}, year = {2020}, doi = {10.1007/978-3-030-57990-6_28}, url = {https://doi.org/10.1007/978-3-030-57990-6_28}, researchr = {https://researchr.org/publication/LarsenS20}, cites = {0}, citedby = {0}, pages = {566-578}, booktitle = {Security and Cryptography for Networks - 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings}, editor = {Clemente Galdi and Vladimir Kolesnikov}, volume = {12238}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-030-57990-6}, }