Paper 2017/362
Universally Composable Zero-Knowledge Proof of Membership
Jesper Buus Nielsen
Abstract
Since its introduction the UC framework by Canetti has received a lot of attention. A contributing factor to its popularity is that it allows to capture a large number of common cryptographic primitives using ideal functionalities and thus can be used to give modular proofs for many cryptographic protocols. However, an important member of the cryptographic family has not yet been captured by an ideal functionality, namely the zero-knowledge proof of membership. We give the first formulation of a UC zero-knowledge proof of membership and show that it is closely related to the notions of straight-line zero-knowledge and simulation soundness.
Note: This is an old note of mine that I found while doing spring cleaning. It tries to formulate a notion of UC proof of membership. I think there are still ideas here that might inspire how to extend the UC framework to capture more tasks than it does now, so I choose to archive it here.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- UCzero-knowledge
- Contact author(s)
- jbn @ cs au dk
- History
- 2017-04-26: received
- Short URL
- https://ia.cr/2017/362
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/362,
author = {Jesper Buus Nielsen},
title = {Universally Composable Zero-Knowledge Proof of Membership},
howpublished = {Cryptology ePrint Archive, Paper 2017/362},
year = {2017},
note = {\url{https://eprint.iacr.org/2017/362}},
url = {https://eprint.iacr.org/2017/362}
}
