Get access

A finite equivalence of multisecret sharing based on Lagrange interpolating polynomial

Authors


Correspondence: Hui Zhao, School of Computer Science and Technology, Shandong University of Technology, Zibo, SD 255000, China.

E-mail: Eric.Hui.Zhao@Gmail.com

ABSTRACT

We give an abstraction of multisecret sharing based on Lagrange interpolating polynomial that is accessible to a fully mechanized analysis. This abstraction is formalized in the applied pi-calculus by using an equational theory that characterizes the cryptographic semantics of multisecret sharing based on Lagrange interpolating polynomial. We also present an encoding from the equational theory into a convergent rewriting system, which is suitable for the automated protocol verifier ProVerif. Finally, we verify the Yang–Chang–Hwang (YCH) protocol in ProVerif. Copyright © 2013 John Wiley & Sons, Ltd.

Get access to the full text of this article

Ancillary