A Finite Equivalence of Verifiable Multi-Secret Sharing

Authors

Hui Zhao, Shandong University of TechnologyFollow
Mingchu Li, Dalian University of TechnologyFollow
Kouichi Sakurai, Kyushu UniversityFollow
Yizhi Ren, Hangzhou Dianzi University
Jonathan Z. Sun, University of Southern MississippiFollow
Fengying Wang, Shandong University of Technology

Document Type

Article

Publication Date

2-1-2012

School

Computing Sciences and Computer Engineering

Abstract

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.

Publication Title

International Journal of Communication Systems

Volume

5

Issue

1

First Page

1

Last Page

12

Recommended Citation

Zhao, H., Li, M., Sakurai, K., Ren, Y., Sun, J. Z., Wang, F. (2012). A Finite Equivalence of Verifiable Multi-Secret Sharing. International Journal of Communication Systems, 5(1), 1-12.
Available at: https://aquila.usm.edu/fac_pubs/140