location: Current position: Home >> Scientific Research >> Paper Publications

A Finite Equivalence of Verifiable Multi-secret Sharing

Hits:

Indexed by:期刊论文

Date of Publication:2012-02-01

Journal:INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS

Included Journals:SCIE、EI、Scopus

Volume:5

Issue:1

Page Number:1-12

ISSN No.:1875-6883

Key Words:Pi-calculus; Secret-sharing; Formal analysis; Protocol verifier

Abstract:We give an abstraction of verifiable multi-secret sharing schemes that is accessible to a fully mechanized analysis. This abstraction is formalized within the applied pi-calculus by using an equational theory which characterizes the cryptographic semantics of secret share. We also present an encoding from the equational theory into a convergent rewriting system, which is suitable for the automated protocol verifier ProVerif. Based on that, we verify the threshold certificate protocol in ProVerif.

Pre One:基于非完全信息博弈的网格资源分配模型

Next One:FoSSicker: A personalized search engine by location-awareness