scientific article; zbMATH DE number 467267

From MaRDI portal
Publication:4272011





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.











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)