Paper 2021/1450
Efficient Zero-Knowledge Argument in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier
Abstract
We propose three interactive zero-knowledge arguments for arithmetic circuit of size
Note: Updates (21.11.22) Revise comparison tables - table 1, table 22, Unify reference style Updates (22.02.24) Add new protocols and reorganize contents Updates (22.05.28) Reorganize contents and add details for explanations
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in ASIACRYPT 2022
- Keywords
- Zero-knowledge argument Circuit satisfiability Trustless setup
- Contact author(s)
-
kim sungwook @ swu ac kr
leehb3706 @ hanyang ac kr
jaehongseo @ hanyang ac kr - History
- 2022-10-01: last of 6 revisions
- 2021-10-29: received
- See all versions
- Short URL
- https://ia.cr/2021/1450
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1450, author = {Sungwook Kim and Hyeonbum Lee and Jae Hong Seo}, title = {Efficient Zero-Knowledge Argument in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/1450}, year = {2021}, url = {https://eprint.iacr.org/2021/1450} }