Secret sharing and its variants, matroids, combinatorics/ Shion Samadder Chaudhury
Material type:
TextPublication details: Kolkata: Indian Statistical Institute, 2020Description: vi, 169 pagesSubject(s): DDC classification: - 23 511.6 Sa187
- Guided by Prof. Bimal Kumar Roy
| Item type | Current library | Call number | Status | Notes | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
| THESIS | ISI Library, Kolkata | 511.6 Sa187 (Browse shelf(Opens below)) | Available | E-Thesis | Th480 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | |||||||
| 511.6 R842 Studies in foundations and combinatorics | 511.6 R996 Combinatorial mathematics | 511.6 Sa121 Combinatorial methods in discrete mathematics | 511.6 Sa187 Secret sharing and its variants, matroids, combinatorics/ | 511.6 Sa241 Combinatorial algebra : syntax and semantics / | 511.6 Sch379 Combinatorial optimization polyhedra and efficiency | 511.6 Sch379 Combinatorial optimization polyhedra and efficiency |
Thesis (Ph.D.) - Indian Statistical Institute, 2020
Includes appendices and bibliographical references
Literature Survey -- Secret Sharing in AC0 -- Perpetual Secret Sharing Scheme from Fractional Cascading -- A Quantum Evolving Secret Sharing Scheme -- A Quantum Hierarchical Secret Sharing Scheme - Further Studies -- Embedding Hard Functions in Secret Sharing Schemes -- Generalized Matroid Ports and Non-Perfect Secret Sharing -- A short note on intervals in Hales-Jewett Theorem.
Guided by Prof. Bimal Kumar Roy
The main focus of this thesis is secret sharing. Secret Sharing is a very basic and
fundamental cryptographic primitive. It is a method to share a secret by a dealer among different parties in such a way that only certain predetermined subsets of parties can together reconstruct the secret while some of the remaining subsets of parties can have no information about the secret.
There are no comments on this title.
