On Proactive Verifiable Secret Sharing Schemes
Serdica Journal of Computing, Tome 1 (2007) no. 3, pp. 337-364
Cet article a éte moissonné depuis la source Bulgarian Digital Mathematics Library
This paper investigates the security of Proactive Secret Sharing
Schemes. We first consider the approach of using commitment to 0 in the
renewal phase in order to refresh the player's shares and we present two types
of attacks in the information theoretic case. Then we prove the conditions
for the security of such a proactive scheme. Proactivity can be added also
using re-sharing instead of commitment to 0. We investigate this alternative
approach too and describe two protocols. We also show that both techniques
are not secure against a mobile adversary.
To summarize we generalize the existing threshold protocols to protocols
for general access structure. Besides this, we propose attacks against the
existing proactive verifiable secret sharing schemes, and give modifications
of the schemes that resist these attacks.
Keywords:
Secret Sharing Schemes, Proactive Security
@article{SJC_2007_1_3_a7,
author = {Nikov, Ventzislav and Nikova, Svetla and Preneel, Bart},
title = {On {Proactive} {Verifiable} {Secret} {Sharing} {Schemes}},
journal = {Serdica Journal of Computing},
pages = {337--364},
year = {2007},
volume = {1},
number = {3},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SJC_2007_1_3_a7/}
}
Nikov, Ventzislav; Nikova, Svetla; Preneel, Bart. On Proactive Verifiable Secret Sharing Schemes. Serdica Journal of Computing, Tome 1 (2007) no. 3, pp. 337-364. http://geodesic.mathdoc.fr/item/SJC_2007_1_3_a7/