CryptoDB
Verifying Statistical Zero Knowledge with Approximate Implementations
Authors: | |
---|---|
Download: | |
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 of Girault, Poupard and Stern. |
BibTeX
@misc{eprint-2007-13476, title={Verifying Statistical Zero Knowledge with Approximate Implementations}, booktitle={IACR Eprint archive}, keywords={foundations / formal verification, statistical zero knowledge}, url={http://eprint.iacr.org/2007/195}, note={ lcheung@theory.csail.mit.edu 13657 received 23 May 2007}, author={Ling Cheung and Sayan Mitra and Olivier Pereira}, year=2007 }