TENET: Sublogarithmic Proof and Sublinear Verifier Inner Product Argument without a Trusted Setup
- Authors
- Lee, Hyeonbum; Seo, Jae Hong
- Issue Date
- Aug-2023
- Publisher
- Springer Science and Business Media Deutschland GmbH
- Keywords
- Inner product argument; Transparent setup; Zero knowledge proof
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.14128 LNCS, pp.214 - 234
- Indexed
- SCOPUS
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 14128 LNCS
- Start Page
- 214
- End Page
- 234
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191801
- DOI
- 10.1007/978-3-031-41326-1_12
- ISSN
- 0302-9743
- Abstract
- We propose a new inner product argument (IPA), called TENET, which features sublogarithmic proof size and sublinear verifier without a trusted setup. IPA is a core primitive for various advanced proof systems including range proofs, circuit satisfiability, and polynomial commitment, particularly where a trusted setup is hard to apply. At ASIACRYPT 2022, Kim, Lee, and Seo showed that pairings can be utilized to exceed the complexity barrier of the previous discrete logarithm-based IPA without a trusted setup. More precisely, they proposed two pairing-based IPAs, one with sublogarithmic proof size and the other one with sublinear verifier cost, but they left achieving both complexities simultaneously as an open problem. We investigate the obstacles for this open problem and then provide our solution TENET, which achieves both sublogarithmic proof size and sublinear verifier. We prove the soundness of TENET under the discrete logarithm assumption and double pairing assumption.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 자연과학대학 > 서울 수학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191801)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.