On Proactive Verifiable Secret Sharing Schemes

Nikov, Ventzislav, Nikova, Svetla, and Preneel, Bart. "On Proactive Verifiable Secret Sharing Schemes." Serdica Journal of Computing 1.3 (2007): 337-364. <http://eudml.org/doc/11429>.

@article{Nikov2007,
abstract = {The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006. The material in this paper was presented in part at the 11th Workshop on Selected Areas in Cryptography (SAC) 2004This 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.},
author = {Nikov, Ventzislav, Nikova, Svetla, Preneel, Bart},
journal = {Serdica Journal of Computing},
keywords = {Secret Sharing Schemes; Proactive Security; Proactive security},
language = {eng},
number = {3},
pages = {337-364},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {On Proactive Verifiable Secret Sharing Schemes},
url = {http://eudml.org/doc/11429},
volume = {1},
year = {2007},
}

TY - JOUR
AU - Nikov, Ventzislav
AU - Nikova, Svetla
AU - Preneel, Bart
TI - On Proactive Verifiable Secret Sharing Schemes
JO - Serdica Journal of Computing
PY - 2007
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 1
IS - 3
SP - 337
EP - 364
AB - The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006. The material in this paper was presented in part at the 11th Workshop on Selected Areas in Cryptography (SAC) 2004This 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.
LA - eng
KW - Secret Sharing Schemes; Proactive Security; Proactive security
UR - http://eudml.org/doc/11429
ER -