Paper 2007/195
Verifying Statistical Zero Knowledge with Approximate Implementations
Ling Cheung, Sayan Mitra, and Olivier Pereira
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.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- formal verificationstatistical zero knowledge
- Contact author(s)
- lcheung @ theory csail mit edu
- History
- 2007-05-25: received
- Short URL
- https://ia.cr/2007/195
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/195,
author = {Ling Cheung and Sayan Mitra and Olivier Pereira},
title = {Verifying Statistical Zero Knowledge with Approximate Implementations},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/195},
year = {2007},
url = {https://eprint.iacr.org/2007/195}
}
