CMU-CS-02-114R
Computer Science Department
School of Computer Science, Carnegie Mellon University



CMU-CS-02-114R

Verifiable Secret Redistribution for Threshold Sharing Schemes

Theodore M. Wong, Chenxi Wang*, Jeannette M. Wing

October 2002

Revision of CMU-CS-02-114 (February 2002)

CMU-CS-02-114R.ps
CMU-CS-02-114R.pdf


Keywords: Non-interactive verifiable secret redistribution, threshold sharing schemes, threshold cryptography


We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m',n') access structures for threshold sharing schemes. Our protocol enables the addition or removal of shareholders and also guards against mobile adversaries that cause permanent damage. We observe that existing protocols either cannot be readily extended to allow redistribution between different access structures, or have vulnerabilities that allow faulty old shareholders to corrupt the shares of new shareholders. Our primary contribution is that, in our protocol, new shareholders can verify the validity of their shares after redistribution between different access structures.

18 pages

*Dept. of Electrical and Computer Engineering, Carnegie Mellon University.


Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by reports@cs.cmu.edu