Verifying Statistical Zero Knowledge with Approximate Implementations.
Ling Cheung, Sayan Mitra, Olivier Pereira · IACR Cryptology ePrint Archive · 2007
Abstract. Statistical zero-knowledge (SZK) properties play an important role in designing cryptographic protocols that enforce honest behavior while maintaining privacy. This paper presents a novel approach for verifying SZK properties, using recently developed techniques based on approximate simulation relations. We formulate statistical indistinguishability as an implementation relation in the Task-PIOA framework, which allows us to express computational restrictions. The implementation relation is then proven using approximate simulation relations. This technique separates proof obligations into two categories: those requiring probabilistic reasoning, as well as those that do not. The latter is a good candidate for mechanization. We illustrate the general method by verifying the SZK property of the well-known identification protocol proposed by Girault, Poupard and Stern. ⋆ Supported by the MURI project:DARPA/AFOSR MURI F49620-02-1-0325 grant. 1