• Please log in or register to access this feature.

Research Article

A finite equivalence of multisecret sharing based on Lagrange interpolating polynomial

  1. Hui Zhao1,*,
  2. Jonathan Z. Sun2,
  3. Fengying Wang1,
  4. Lei Zhao1

Article first published online: 24 JAN 2013

DOI: 10.1002/sec.694

Additional Information

How to Cite

Zhao, H., Sun, J. Z., Wang, F. and Zhao, L. (2013), A finite equivalence of multisecret sharing based on Lagrange interpolating polynomial. Security Comm. Networks. doi: 10.1002/sec.694

Author Information

  1. 1

    School of Computer Science and Technology, Shandong University of Technology, Zibo, SD, China

  2. 2

    School of Computing, The University of Southern Mississippi, Hattiesburg, MS, U.S.A.

* Hui Zhao, School of Computer Science and Technology, Shandong University of Technology, Zibo, SD 255000, China.
E-mail: Eric.Hui.Zhao@Gmail.com

Publication History

  1. Article first published online: 24 JAN 2013

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

View Full Article (HTML) Get PDF (162K)

Keywords:

  • pi-calculus;
  • secret sharing;
  • formal analysis;
  • protocol verifier

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.

View Full Article (HTML) Get PDF (162K)