Volume 5, Issue 1, February 2012, Pages 1 - 12
A Finite Equivalence of Verifiable Multi-secret Sharing
Hui Zhao, Mingchu Li, Kouichi Sakurai, Yizhi Ren, JonathanZ. Sun, Fengying Wang
Received 10 March 2011, Accepted 9 December 2011, Available Online 1 February 2012.
- https://doi.org/10.1080/18756891.2012.670517How to use a DOI?
- Pi-calculus, Secret-sharing, Formal analysis, Protocol verifier
- 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - JOUR AU - Hui Zhao AU - Mingchu Li AU - Kouichi Sakurai AU - Yizhi Ren AU - JonathanZ. Sun AU - Fengying Wang PY - 2012 DA - 2012/02 TI - A Finite Equivalence of Verifiable Multi-secret Sharing JO - International Journal of Computational Intelligence Systems SP - 1 EP - 12 VL - 5 IS - 1 SN - 1875-6883 UR - https://doi.org/10.1080/18756891.2012.670517 DO - https://doi.org/10.1080/18756891.2012.670517 ID - Zhao2012 ER -