A finite equivalence of multisecret sharing based on Lagrange interpolating polynomial. Issue 9 (24th January 2013)

• Record Type: Journal Article
• Authors: Zhao, Hui; Sun, Jonathan Z.; Wang, Fengying; Zhao, Lei
• Is Part Of: Security and communication networks. Volume 6:Issue 9(2013:Sep.)
• Page Start: 1169
• Page End: 1175
• Publication Date: 2013-01-24
• Subjects: pi‐calculus -- secret sharing -- formal analysis -- protocol verifier; Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.694
• Languages: English
• ISSNs: 1939-0114

Abstract

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. Abstract : In this paper, we give an abstraction of multi‐secret sharing based on Lagrange interpolating polynomial that is accessible to a fully mechanized analysis. 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 a practical verifiable multi‐secret sharing scheme based on YCH in ProVerif.