Title

A finite equivalence of multisecret sharing based on Lagrange interpolating polynomial

Document Type

Article

Publication Date

9-1-2013

Department

Computing

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 (c) 2013 John Wiley & Sons, Ltd.

Publication Title

SECURITY AND COMMUNICATION NETWORKS

Volume

6

Issue

9

First Page

1169

Last Page

1175

This document is currently not available here.

Find in your library

Share

 
COinS