Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Kasper Green Larsen' in GoogleThis author has not been identified. Look up 'Mark Simkin 0001' in Google

runs on WebDSL