Organizer: Christian Janson, TU Darmstadt, Cryptoplexity Group
This talk is the fifth one in the seminar series “Reading the Crypto Classics” for the very special winter term 2020/2021. The idea of this seminar is to jointly read classical milestone papers in the area of cryptography, to discuss their impact and understand their relevance for current research areas. The seminar is running as an Oberseminar, but at the same time meant to be a joint reading group seminar of the CROSSING Special Interest Group on Advanced Cryptography with all interested CROSSING members being invited to participate.
This issue will cover the paper
Shamir: „How to Share a Secret“ (Communications of the ACM 1989); DOI: https://doi.org/10.1145/359168.359176
with the following abstract:
“In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k – 1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.”
Further information about the virtual format
For participation the following BigBlueButton-Link is required: