Paper 2009/461
A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC)
Bruce Kapron, Lior Malka, and Venkatesh Srinivasan
Abstract
Zero-knowledge protocols are often studied through specific problems, like Graph-Isomorphism. In many cases this approach prevents an important level of abstraction and leads to limited results, whereas in fact the constructions apply to a wide variety of problems. We propose to address this issue with a formal framework of non-interactive instance-dependent commitment schemes (NIC). We define NIC in both the perfect, statistical, and computational settings, and formally characterize problems admitting NIC in all of these settings. We also prove other useful lemmas such as closure properties. Consequently, results that previously applied only to specific problems are now strengthened by our framework to apply to classes of problems. By providing formal yet intuitive tools, our framework facilitates the construction of zero-knowledge protocols for a wide variety of problems, in various settings, without the need to refer to a specific problem. Our results are unconditional.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Previously published in ICALP 2007. This version is full and the results are presented from a different perspective
- Keywords
- zero knowledgecommitment schemes
- Contact author(s)
- liorma @ cs uvic ca
- History
- 2009-09-20: received
- Short URL
- https://ia.cr/2009/461
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/461,
author = {Bruce Kapron and Lior Malka and Venkatesh Srinivasan},
title = {A Framework for Non-Interactive Instance-Dependent Commitment Schemes ({NIC})},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/461},
year = {2009},
url = {https://eprint.iacr.org/2009/461}
}
