Probabilistic Applied Pi Calculus and Zero Knowledge

Abstract

As Zero-Knowledge proof plays a more and moreimportant role in modern cryptography, the need for formalanalysis becomes more urgent. In this paper, we make use offormal methods to establish a Zero-Knowledge result. The formalmodel is Probabilistic Applied Pi and the Zero-Knowledge proofis Hamiltonian cycle. By this example, our preliminary workshows how Zero-Knowledge can be modeled in formal modelssuch as process calculi and how to establish a Zero-Knowledgeproof by checking equivalence in the model.