Achieving Rights Untransferability with Client-Independent Servers
This article presents a scheme for enforcing access rights untransferability in a client-server scenario. Assumptions include a central authority and servers which are trusted and hold no access information about clients. For a client sharing none of her rights, usurpation of a right seems as hard as the discrete logarithm. Also, rights sharing between clients does not compromise their non-shared rights when a sound public-key cryptosystem is used. Transferring rights between clients without the authority's contribution cannot be done if a sound public-key cryptosystem is used. However, only control on partial rights transfers is addressed in this paper, which does not deal with total identity transfer or alienation.
Unable to display preview. Download preview PDF.
- 1.D. Chaum, J.-H. Evertse and J. Van de Graaf, An improved procotol for demonstrating possession of discrete logarithms and some generalizations: Proceedings of Eurocrypt'87, Springer-Verlag (1988) pp. 127–141.Google Scholar
- 2.J. Domingo-Ferrer, Untransferable rights in a client-independent server environment: Proceedings of Euro-crypt'93, Springer-Verlag (1994) pp. 260–266.Google Scholar
- 3.G. S. Graham and P. J. Denning, Protection: Principles and practices: Proceedings of the AFIPS Spring Joint Computer Conference (1972) pp. 417–429.Google Scholar
- 4.M. A. Harrison, W. L. Ruzzo and J. D. Ullman, Protection in operating systems, Communications of the ACM, Vol. 19 (1976) pp. 461–471.Google Scholar
- 5.J. Linn, Practical authentication for distributed computing: Proc. IEEE Symposium on Research in Security and Privacy, IEEE CS Press (1990) pp. 31–40.Google Scholar
- 6.R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryp-tosystems, Communications of the ACM, Vol. 21 (1978) pp. 120–126.Google Scholar
- 7.T. Y. C. Woo and S. S. Lam, Authentication for distributed systems, IEEE Computer, Vol. 25 (1992) pp. 39–52.Google Scholar