A Finite Equivalence of Verifiable Multi-secret Sharing

International Journal of Computational Intelligence Systems

关键词: Pi-calculus;    Secret-sharing;    Formal analysis;    Protocol verifier;   

DOI  :  10.1080/18756891.2012.670517

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown