A finite equivalence of verifiable multi-secret sharing

Hui Zhao, Mingchu Li, Kouichi Sakurai, Yizhi Ren, Jonathan Z. Sun, Fengying Wang

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Pages (from-to)1-12
Number of pages12
JournalInternational Journal of Computational Intelligence Systems
Issue number1
Publication statusPublished - Feb 2012

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computational Mathematics


Dive into the research topics of 'A finite equivalence of verifiable multi-secret sharing'. Together they form a unique fingerprint.

Cite this