This project considers schemes that allow shared authority.
In many applications of cryptography, the secret key is very often divided
into several subkeys so that certain collections of these subkeys can together
reconstruct the secret key, but any other collection has no information on
the secret key. We have provided schemes that allow "trusted" parties to
be removed from the trusted circle and compute the information rates of these
scheme. We continue studying variations of secret sharing schemes for
cryptography and in particular, for secure distributed computing.
Secret Sharing Schemes
B. Blakley, G. Blakley, A.H. Chan and J. Massey, ``Secret Sharing
Schemes with Disenrollment'', Proceedings of Crypto92, Springer Lecture
Notes in Computer Science, pages 540 - 548.