Paper 2023/1532
Unclonable Non-Interactive Zero-Knowledge
Abstract
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets about them. However, an adversary that obtains a NIZK proof may be able to clone this proof and distribute arbitrarily many copies of it to various entities: this is inevitable for any proof that takes the form of a classical string. In this paper, we ask whether it is possible to rely on quantum information in order to build NIZK proof systems that are impossible to clone. We define and construct unclonable non-interactive zero-knowledge arguments (of knowledge) for NP, addressing a question first posed by Aaronson (CCC 2009). Besides satisfying the zero-knowledge and argument of knowledge properties, these proofs additionally satisfy unclonability. Very roughly, this ensures that no adversary can split an honestly generated proof of membership of an instance $x$ in an NP language $\mathcal{L}$ and distribute copies to multiple entities that all obtain accepting proofs of membership of $x$ in $\mathcal{L}$. Our result has applications to unclonable signatures of knowledge, which we define and construct in this work; these non-interactively prevent replay attacks.
Note: Clarified definitions and included applications
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in ASIACRYPT 2024
- Keywords
- unclonablezero-knowledgequantum moneysignatures of knowledgerevocation
- Contact author(s)
-
jawale2 @ illinois edu
dakshita @ illinois edu - History
- 2024-09-24: last of 2 revisions
- 2023-10-07: received
- See all versions
- Short URL
- https://ia.cr/2023/1532
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1532,
author = {Ruta Jawale and Dakshita Khurana},
title = {Unclonable Non-Interactive Zero-Knowledge},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1532},
year = {2023},
url = {https://eprint.iacr.org/2023/1532}
}
