scientific article; zbMATH DE number 467267
A shared secret scheme or threshold scheme is a cryptographic procedure to split up a given secret (master key) into \(n\) partial secrets (shadows) such that the master key can be reconstructed from any \(k\) or more shadows (\(k\leq n)\), but it is computationally infeasible to calculate the master key from \(k-1\) or less shadows. Furthermore, a shared secret scheme is called robust if it can be checked that the reconstructed master key has been calculated correctly without comparing it with the original master key. The theory of robust shared secret schemes has been developed by G. J. Simmons in the late eighties. The pamphlet gives a description of the state of art of robust shared secret schemes and a generalization of Simmon's theory. Especially, realizations of robust shared secret schemes in projective spaces are studied. A cryptanalysis of these systems and an outlook on possible applications conclude the booklet.
- Strongly ideal secret sharing schemes
- How to build robust shared control systems
- Nearly optimal robust secret sharing
- Robust vector space secret sharing schemes
- Robust Encryption
- scientific article; zbMATH DE number 54225 (Why is no real title available?)
- scientific article; zbMATH DE number 1822318 (Why is no real title available?)
- Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272011)