2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | P.2.4 | ||
| Paper Title | Secret sharing schemes based on nonlinear codes | ||
| Authors | Deepak Agrawal, Smarajit Das, Srinivasan Krishanaswamy, Indian Institute of Technology, Guwahati, India | ||
| Session | P.2: Cryptography | ||
| Presentation | Lecture | ||
| Track | Cryptography, Security and Privacy | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | Secret sharing scheme is a method in which the secret is divided among finitely many participants by a dealer such that only the legitimate set of participants can recover the secret. The collection of sets of legitimate participants is called the access structure of the secret sharing scheme. There are various ways of constructing secret sharing schemes. Determination of the access structure for a secret sharing scheme is an important problem. Most of the known secret sharing schemes are based on linear codes. A major drawback of secret sharing schemes based on linear codes is that these schemes are susceptible to Tompa-Woll attack. In this paper, we use nonlinear codes to construct secret sharing schemes. These secret sharing schemes perform better than the secret sharing schemes based on linear codes with respect to Tompa-Woll attack. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
