A Finite Equivalence of Multisecret Sharing Based on Lagrange Interpolating Polynomial
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 (c) 2013 John Wiley & Sons, Ltd.
Security and Communication Networks
(2013). A Finite Equivalence of Multisecret Sharing Based on Lagrange Interpolating Polynomial. Security and Communication Networks, 6(9), 1169-1175.
Available at: https://aquila.usm.edu/fac_pubs/7787