Skip Navigation

The Computer Journal 1999 42(8):638-649; doi:10.1093/comjnl/42.8.638
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Martin, K. M.
Right arrow Articles by Wang, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures

Keith M. Martin1, Rei Safavi-Naini2 and Huaxiong Wang2

1 Katholieke Universiteit Leuven, Dept. Elektrotechniek—ESAT, Kardinaal Mercierlaan 94, B-3001 Heverlee, Belgium Email: hw13@cs.uow.edu.au 2 School of Information Technology and Computer Science, University of Wollongong, Northfields Avenue, Wollongong 2522, Australia

We consider the problem of redistributing shares in a secret sharing scheme in such a way that shareholders of a scheme with one access structure can transfer information to a new set of shareholders, resulting in a sharing of the old secret among a new access structure. We describe a number of different scenarios and applications within which such a redistribution might be required, give some techniques for conducting a redistribution, and discuss the optimisation of the efficiency of such a process.

Received 11 September, 1998. Revised 16 September, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.