TY - JOUR
T1 - A finite equivalence of verifiable multi-secret sharing
AU - Zhao, Hui
AU - Li, Mingchu
AU - Sakurai, Kouichi
AU - Ren, Yizhi
AU - Sun, Jonathan Z.
AU - Wang, Fengying
N1 - Funding Information:
This research is supported by the Natural Science Foundation of Shandong Province under Grant ZR2010FL003.
PY - 2012/2
Y1 - 2012/2
N2 - We give an abstraction of verifiable multi-secret sharing schemes that is accessible to a fully mechanized analysis. This abstraction is formalized within the applied pi-calculus by using an equational theory which characterizes the cryptographic semantics of secret share. We also present an encoding from the equational theory into a convergent rewriting system, which is suitable for the automated protocol verifier ProVerif. Based on that, we verify the threshold certificate protocol in ProVerif.
AB - We give an abstraction of verifiable multi-secret sharing schemes that is accessible to a fully mechanized analysis. This abstraction is formalized within the applied pi-calculus by using an equational theory which characterizes the cryptographic semantics of secret share. We also present an encoding from the equational theory into a convergent rewriting system, which is suitable for the automated protocol verifier ProVerif. Based on that, we verify the threshold certificate protocol in ProVerif.
UR - http://www.scopus.com/inward/record.url?scp=84865741414&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84865741414&partnerID=8YFLogxK
U2 - 10.1080/18756891.2012.670517
DO - 10.1080/18756891.2012.670517
M3 - Article
AN - SCOPUS:84865741414
SN - 1875-6891
VL - 5
SP - 1
EP - 12
JO - International Journal of Computational Intelligence Systems
JF - International Journal of Computational Intelligence Systems
IS - 1
ER -