Paper 2020/223
Compact NIZKs from Standard Assumptions on Bilinear Maps
Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, and Takashi Yamakawa
Abstract
A non-interactive zero-knowledge (NIZK) protocol enables a prover to convince a verifier of the truth of a statement without leaking any other information by sending a single message.
The main focus of this work is on exploring short pairing-based NIZKs for all NP languages based on standard assumptions.
In this regime, the seminal work of Groth, Ostrovsky, and Sahai (J.ACM'12) (GOS-NIZK) is still considered to be the state-of-the-art.
Although fairly efficient, one drawback of GOS-NIZK is that the proof size is multiplicative in the circuit size computing the NP relation.
That is, the proof size grows by
Note: Added remarks on NC1 decryptable SKE (6/2/2020)
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in EUROCRYPT 2020
- Keywords
- non-interactive zero-knowledgeDLINattribute-based encryptionconstrained signature
- Contact author(s)
-
shuichi katsumata @ aist go jp
ryo nishimaki @ gmail com
yamada-shota @ aist go jp
takashi yamakawa ga @ hco ntt co jp - History
- 2020-06-02: revised
- 2020-02-21: received
- See all versions
- Short URL
- https://ia.cr/2020/223
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/223, author = {Shuichi Katsumata and Ryo Nishimaki and Shota Yamada and Takashi Yamakawa}, title = {Compact {NIZKs} from Standard Assumptions on Bilinear Maps}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/223}, year = {2020}, url = {https://eprint.iacr.org/2020/223} }